System and method for decoding tail-biting code especially appli

Pulse or digital communications – Repeaters – Testing

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

379 59, 371 43, H03A 100, H04L 2706

Patent

active

053696719

ABSTRACT:
A digital cellular system (10) employs a decoder that decodes control messages encoded by a convolutional tail-biting encoding procedure. The control messages (57) contain 65 bits that are encoded in a 260 bit data frame (59). The decoder reads (112) the first x quadruple bits and writes them also at the end of the data frame bit stream. A Viterbi decoding algorithm (114) is applied to the modified bit stream for x plus 65 steps. A bit stream of (65+x) bits is selected (116) from a best value path and y first bits are discarded from the selected stream. The output decoded message (118) includes bits (y+1) through (y+65).

REFERENCES:
patent: 5199031 (1993-03-01), Dahlin
"An Efficient Maximum Likelihood Decoding Algorithm for Generalized Tail Biting Convolutional Codes Including Quasicyclic Codes" by: Qiang Wang and Vijay K. Bhargava, IEEE Transactions on communications, vol. 37, No. 8, Aug. 1989.
"On Tail Biting Convolutional Codes" by Howard H. Ma, 1986 IEEE.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System and method for decoding tail-biting code especially appli does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for decoding tail-biting code especially appli, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for decoding tail-biting code especially appli will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-79075

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.