Decoding method for tail-biting convolutional codes using a...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S341000, C375S346000

Reexamination Certificate

active

07856591

ABSTRACT:
A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

REFERENCES:
patent: 5349589 (1994-09-01), Chennakeshu et al.
patent: 5355376 (1994-10-01), Cox et al.
patent: 6088405 (2000-07-01), Hladik et al.
patent: 6256764 (2001-07-01), Atallah
patent: 6877132 (2005-04-01), De et al.
patent: 7116734 (2006-10-01), Nergis
patent: 2002/0150180 (2002-10-01), Malmberg et al.
International Search report for Application No. 07251368.2—2415 / 1841116, mailed May 28, 2009, p. 17.
Anderson, John B. et al., “An Optimal Circular Viterbi Decoder for the Bounded Distance Criterion”, IEEE Transactions on Communications, Piscataway, NJ, vol. 50, No. 11, Nov. 11, 2002, pp. 1736-1742.
Schlegel, Christian B. et al., “Trellis and Turbo Coding”, Wiley Interscience, John Wiley & Sons, Inc., XP002526652, 2004, pp. 200-203.
Ma, Howard H., Wolf, Jack K., On Tail Biting Convolutional Codes, IEEE Transactions On Communications, vol. COM-34, No. 2, Feb. 1986, pp. 104-111.
Wang, Qiang, Bhargava, Vijay K., An Efficient Maximum Likelihood Decoding Algorithm for Generalized Tail Biting Convolutional Codes Including Quasicyclic Codes, IEEE Transactions on Communications, vol. 37, No. 8, Aug. 1989, pp. 875-879.
Cox, Richard V., Sundberg, Carl-Erik W., An Efficient Adaptive Circular Viterbi Algorithm for Decoding Generalized Tailbiting Convolutional Codes, IEEE Transactions on Vehicular Technology, vol. 43, No. 1, Feb. 1994, pp. 57-68.

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

Decoding method for tail-biting convolutional codes using a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decoding method for tail-biting convolutional codes using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding method for tail-biting convolutional codes using a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4182102

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