Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2000-05-05
2004-05-04
Decady, Albert (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S786000
Reexamination Certificate
active
06732327
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to Turbo decoding of digital data transmission received over a noisy channel, and particularly to use of scaled feedback in Turbo decoding.
2. Description of the Related Art
The paper “A Mathematical Theory of Communication” (C. E. Shannon,
Bell System Technical Journal
, 27:349-423, 623-656, October, 1948) set forth “The Noisy Channel Coding Theorem”, which stated that so long as the rate at which information is transmitted over a channel is less than the channel capacity, there exist error control codes that can provide arbitrarily high levels of reliability at the receiver output. However, the paper did not provide any actual coding methods for achieving arbitrarily high reliability.
The effectiveness of a code is usually expressed in terms of coding gain; i.e., the difference between the Eb/No (energy per bit over noise, a signal-to-noise ratio) required to achieve a given BER (bit error rate) in the coded system and the Eb/No required to achieve the same BER without benefit of coding.
Improvements in coding gain were made slowly. An early factor was the introduction of Golay code in the early 1950's, followed by some NASA-inspired uses of Reed-Solomon Code and Viterbi Code in the 1980's. Some of these implementations required very complex hardware, and yet, forty-five years after the publication of Shannon's paper, a gap of almost 2 db. continued to separate the performance of the most advanced error-control systems from the theoretical limit (the “Shannon limit”).
A new coding method was announced in the paper “Near-Shannon-Limit Error-Correcting Coding and Decoding: Turbo Codes” (C. Berrou, A. Glavieux, and P. Thitmajshima,
Proceedings of the
1993
International Conference on Cominunications
, pages 1064-1070, 1993). (See generally
Turbo Coding
, Heegard and Wicker, Kluwer Academic Publishers, Norwell, Mass., 1999, ISBN 0-7923-8378-8.)
Although Turbo Codes have effected significant advances in coding gain, additional advances, closing even further the gap with the Shannon limit, are still desirable. In space communication, for example, transmitter power is inherently limited; in terrestrial wireless communication, a steep increase in the kinds of services available and in the demand for them is making bandwidth scarce. It has been estimated in the Deep Space Project that one db. of coding gain is worth eighty million dollars in spacecraft equipment costs (
Turbo Coding
at page 5).
SUMMARY OF THE INVENTION
The Turbo decoder of the present invention has improved coding gain over the prior-art Turbo decoders.
The invention is an improvement to iterative Turbo decoders of the prior art. In a prior-art Turbo decoder, a Turbo-coded signal is repetitively subjected to the process of decoding in a first decoder, interleaving, decoding in a second decoder, and deinterleaving. The improvement of the present invention is to scale the signal after each decoding step by a predetermined value. Predetermined values in the vicinity of 0.7 to 0.8 are found to improve coding gain.
Other objects and features of the present invention will become apparent from the following detailed description considered in conjunction with the accompanying drawings. It is to be understood, however, that the drawings are designed solely for purposes of illustration and not as a definition of the limits of the invention, for which reference should be made to the appended claims. It should be further understood that the drawings are not necessarily drawn to scale and that, unless otherwise indicated, they are merely intended to conceptually illustrate the structures and procedures described herein.
REFERENCES:
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5970085 (1999-10-01), Yi
patent: 5978365 (1999-11-01), Yi
patent: 6145114 (2000-11-01), Crozier et al.
patent: 6304996 (2001-10-01), Van Stralen et al.
patent: 0 963 048 (1999-08-01), None
IEEE Transactions On Communications, vol. 44, No. 10 Oct., 1996; Near Optimum Error Correcting coding and Decoding: Turbo-Codes.
Near Shannon Limit Error-Correcting Coding And Decoding: /Turbo-Codes (1).
IEEE Journal On Selected Areas In Communications, vol. 16, No. 2, Feb., 1998; An Intuitive Justification And a Simplified Implementation Of The MAP Decoder For Convolutional Codes; Andrew J. Viterbi, Life Fellow, IEEE.
Vogt J. et al.: “Improving the max-log-MAP turbo decorder” Electronics Letters, Nov. 9, 2000, IEEE, UK, vol. 36, No. 23, pp. 1937-1939, XP000994694, ISSN: 0013-5194.
Robertson P et al.: “Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding” European Transactions on Telecommunications, Mar.-Apr. 1997 AEI, Italy, vol. 8, No. 2, pp. 119-125, XP000687105 ISSN: 1120-3862.
Viterbi A J: “An Intuitive Justification and a Simplified Implementation of the Map Decoder For Convolutional codes” IEEE Journal on Selected Areas in Communications, US, IEEE Inc. New York, vol. 16, No. 2, Feb. 1, 1998, pp. 260-264, XP000741780, ISSN 0733-8716.
Z. Blazek et al., “A DSP-Based Implementation of a Turbo-Decoder”, IEEE, 1998, pp. 2751-2752, XP-000801545.
Chaudry Mujtaba
Cohen & Pontani, Lieberman & Pavane
De'cady Albert
Nokia Networks Oy
LandOfFree
Scaled-feedback turbo decoder does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scaled-feedback turbo decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaled-feedback turbo decoder will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3244894