Parallel concatenated tail-biting convolutional code and decoder therefor

Patent 5721745 Issued on February 24, 1998. Estimated Expiration Date:

April 19, 2016. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Abstract Claims Description Full Text

Patent References

Generalized viterbi algorithm with tail-biting
Patent #: 5349589
Issued on: 09/20/1994
Inventor: Chennakeshu, et al.

System and method for decoding tail-biting code especially applicable to digital cellular base stations and mobile units
Patent #: 5369671
Issued on: 11/29/1994
Inventor: Yehushua, et al.

Method for a maximum likelihood decoding of a convolutional code with decision weighting, and corresponding decoder
Patent #: 5406570
Issued on: 04/11/1995
Inventor: Berrou, et al.

Error-correction coding method with at least two systematic convolutional codings in parallel, corresponding iterative decoding method, decoding module and decoder
Patent #: 5446747
Issued on: 08/29/1995
Inventor: Berrou

Method and apparatus for decoder optimization Patent #: 5577053
Issued on: 11/19/1996
Inventor: Dent

Inventors

Application

No. 636732 filed on 04/19/1996

US Classes:

714/755, Double encoding codes (e.g., product, concatenated)714/786Forward error correction by tree code (e.g., convolutional)

Examiners

Primary: Baker, Stephen M.

Attorney, Agent or Firm

Breedlove; Jill M., Snyder; Marvin

International Classes

H03M 013/12
H03M 013/22

Abstract

A parallel concatenated convolutional coding scheme utilizes tail-biting nonrecursive systematic convolutional codes. The associated decoder iteratively utilizes circular maximum a posteriori decoding to produce hard and soft decision outputs. This encoding/decoding system results in improved error-correction performance for short messages.

Other References

"Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate, " LR Bahl, J. Cocke, F. Jelinek, J. Raviv, IEEE Transactions on Information Theory, pp. 284-287, Mar. 1974
"Decision Depths of Convolutional Codes", J.B. Anderson, K. Balachandran, IEEE Transactions on Information Theory, vol. IT-35, pp. 455-459, Mar. 1989
"An Efficient Adaptive Circular Vitebi Algorithm for Decoding Generalized Tailbiting Convolutional Codes," IEEE Transactions on Vehicular Technology, vol. 43, No. 1, pp. 57-68, Feb.1994
"On Tail Biting Convolutional Codes, " HH Ma JK Wolf, IEEE Transactions on Communications, vol. 34, pp. 104-111, Feb. 1986
"An Efficient Maximum Likelihood Decoding Algorithm for Generalized Tailbiting Convolutional Codes Including Quasicyclic Codes," Q. Wang, VK Bhargava, IEEE Transactions on Communications, vol. 37, No. 8, pp. 875-879, Aug. 1989
"Near Shannon Limit Error--Correcting Coding and Decoding: Turbo-Codes," C. Berrou, A. Glavieux, P. Thitimajshima, Proc. of the IEEE Inter. Conf. on Comm., pp. 1064-1070, 1993
"The TURBO Coding Scheme, " JD Anderson, Report IT-146 ISSN 0105-584, Institute of Telecommunication, Technical University of Denmark, Dec. 1994
"Illuminating the Structure of Code and Decoder of Parallel Concatenated Recursive Systematic (Turbo) Codes," P. Robertson, 1994 IEEE Globecom Conference, pp. 1298-1303
"Terminating the Trellis of Turbo-Codes," O. Joersson, H. Meyr, IEE Electronics Letters, vol. 30, No. 6, Aug. 4, 1994, pp. 1285-1286
"A Viterbi Algorithm with Soft-Decision Outputs and its Applications," H. Hagenauer, P. Hoeher, 1989 IEEE Globecom Conference, pp. 1680-1686
"Terminating the Trellis of Turbo-Codes in the Same State," AS Barbulescu, SS Pietrobon, IEE Electronics Letters, 1995, vol. 31, No. 1, Jan. 5, pp. 22-23
"Source and Channel Coding --An Algorithmic Approach", JB Anderson, S. Mohan, pp.216 and 336-34