Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2006-01-31
2006-01-31
Baker, Stephen M. (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
Reexamination Certificate
active
06993698
ABSTRACT:
Turbocoding methods use a first RSC coder operating on sequences of binary dataa, and a second RSC coder operating on binary sequencesa* each obtained fromaby means of a predetermined permutation. These permutations are designed so that, for any sequencearepresented by a polynomial divisible by the recursion polynomial, the associated sequencea* is also represented by a polynomial divisible by the recursion polynomial. These permutations are relatively simple to implement, and are applicable to all the data sequencesawhich have a length which is a multiple of the period of the recursion polynomial. In addition, once the transfer functions of the coders and the sequence length have been chosen, it is possible to select, amongst the corresponding permutations, the one which will probably offer the highest minimum distance of the code. Application to devices and apparatus implementing these methods.
REFERENCES:
patent: 5905739 (1999-05-01), Piret et al.
patent: 6370670 (2002-04-01), Le Dantec et al.
patent: 6543021 (2003-04-01), Piret
patent: 6560362 (2003-05-01), Piret et al.
patent: 6578170 (2003-06-01), Piret et al.
patent: 6578171 (2003-06-01), Braneci et al.
patent: 6625762 (2003-09-01), Le Dantec
patent: 6638318 (2003-10-01), Piret et al.
patent: 6766489 (2004-07-01), Piret et al.
patent: 2004/0117719 (2004-06-01), Piret
patent: 0928071 (1999-07-01), None
McEliece et al., “Permutations Preserving Divisibility”, IEEE Transactions on Information Theory, vol. 47, No. 3, Mar. 2001.
Wang, et al., “Interleaver Design for Turbo Codes Based on Divisibility”, ITW 1999, p. 58.
Barbulescu A. S., et al., “Terminating the trellis of turbo-codes in the same state”, Electronics Letters, vol. 31, No. 1, Jan. 5, 1995, pp. 22-23.
Blackert W. J., et al., “Turbo code termination and interleaver conditions”, Electronics Letters, vol. 31, No. 24, Nov. 23, 1995, pp. 2082-2084.
Divsalar D., et al., “Turbo Codes for PCS Applications”, Proceedings of the International Conference on Communications (ICC), US, New York, IEEE, Jun. 1995, pp. 54-59.
Yung-Cheng Lo, et al., “High Dimensional Circular Trellis-Coded Modulation”, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 1998, pp. 560-564.
C. Berrou, et al., “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes (I)”, ICC '93, Geneva, IEEE pp. 1064-1070, 1993.
C. Berrou, et al., “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,”, IEEE Transactions on Communications, vol. 44, No. 10, Oct. 1996, pp. 1261-1271.
J. Hagenauer, et al., “Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Transactions on Information Theory, vol. 42, No. 2, pp. 429-445, 1996.
A. Tannenbaum, “Computer Networks”, 3rdEdition, Prentice-Hall International, New Jersey, 1996, pp. 184-186.
F.J. McWilliams et al., “The Theory of Error Correcting Codes”, North-Holland 1992, pp. 82-109.
C. Berrou et al., “Turbo-Codes: General Principles and Applications”, Audio and Video Digital Radio Broadcasting Systems and Techniques, Proceedings of the Sixth International Seminar of Tirrenia on Digital Communications, 1993, pp. 215-226.
C. Berrou et al., “Turbo-Block-Codes”, Proceedings of the Seminar “Turbo-Coding” organized by the Applied Electronics Department of the Institute of Technology of Lund, Sweden, Aug., 1996, 7 pages.
L.R. Bahl et al., “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Transactions of Information Theory, Mar. 1974, pp. 284-287.
J. Hagenauer et al., “Iterative (‘TURBO’) Decoding of Systematic Convolutional Codes with the MAP and SOVA Algorithms”, Proc. of the ITG- Conference, Source and Channel Coding, CDE—Verlag Frankfurt, Informationstechnische Gesellschaft (ITG) Fachbericht, pp. 21-29, Oct. 1994.
Baker Stephen M.
Canon Kabushiki Kaisha
Fitzpatrick ,Cella, Harper & Scinto
LandOfFree
Turbocoding methods with a large minimum distance, and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Turbocoding methods with a large minimum distance, and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turbocoding methods with a large minimum distance, and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3582416