Excavating
Patent
1991-07-01
1994-09-20
Beausoliel, Jr., Robert W.
Excavating
341144, 371 491, G06F 1110
Patent
active
053495896
ABSTRACT:
A method and apparatus for digital radio communication employs separation of a frame of data to be transmitted into key bits, critical bits and unprotected bits. The key bits are processed to provide parity bits. The parity bits, and key bits are convolutionally encoded using a tail-biting scheme and merged with unprotected bits, and then transmitted. At the receiver, the decoder splits the received data into convolutionally encoded bits and unprotected bits, and trellis decodes the convolutionally encoded bits into a number of possible paths through a trellis using a generalized Viterbi algorithm. The tail-biting scheme reduces the number of bits that must be transmitted. Paths having errors in the key bits are rejected, and the path having the best metric without key bit errors is used in decoding the transmitted information. In the event that there is no such path, a previously selected path is substituted and decoded.
REFERENCES:
patent: 4110735 (1979-08-01), Maxemchuck
patent: 4747104 (1988-05-01), Piret
patent: 5073940 (1991-12-01), Zinser et al.
patent: 5105442 (1992-04-01), Wei
patent: 5113401 (1992-05-01), Chevillat et al.
patent: 5182753 (1993-01-01), Dahlin et al.
Qiang Wang et al. "An Efficient Maximum Likelihood Decoding Algorithm for Generating Tail Biting Convolution Codes" pp. 875-879 (IEEE Transactions).
G. D. Forney, Jr. "The Viterbi Algorithm." Proc. of the IEEE, 61:268-277 1973.
Howard Ma and Jack Wolf. "On tail biting convolutional codes." IEEE Trans. on Communications, COM-34, pp. 104-111, Feb. 1986.
N. Seshadri and C. E. W. Sundberg, "Generalized viterbi algorithms for error detection with convolutional codes." In IEEE Global Telecommunications Conference, pp. 1534-1538, Dallas, Tex. Nov. 27-30, 1989.
Andrew S. Tanenbaum. Computer Networks. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1981. (Enclosed copy of title page, table of contents, and preface--pp. i-xv.).
Andrew Viterbi and Jim Omura. Principles of Digital Communications and Coding. McGraw-Hill, Inc. N.Y., 1979. (Enclosed copy of title page, table of contents, and preface--pp. i-xiii.).
Qiang Wang and Vijay Bhargava. "An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes." IEEE Trans. on Commun., COM-37:875-879, Aug. 1989.
Chennakeshu Sandeep
Toy Raymond L.
Beausoliel, Jr. Robert W.
De'cady Albert
Ericsson - GE Mobile Communications Inc.
LandOfFree
Generalized viterbi algorithm with tail-biting does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Generalized viterbi algorithm with tail-biting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized viterbi algorithm with tail-biting will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2430512