Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2000-09-06
2003-12-30
Decady, Albert (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S780000
Reexamination Certificate
active
06671852
ABSTRACT:
FIELD OF THE INVENTION
This present invention relates generally to communication systems, and more particularly to a soft-output decoder for use in a receiver of a convolutional code communication system.
BACKGROUND OF THE INVENTION
Convolutional codes are often used in digital communication systems (e.g., the direct sequence code division multiple access (DS-CDMA), IS-95, IS-136, and Global System for Mobile Communications (GSM) standards) to protect transmitted information. At the transmitter, an outgoing code vector may be described using a trellis diagram whose complexity is determined by the constraint length of the encoder. Although computational complexity increases with increasing constraint length, the robustness of the coding also increases with constraint length.
At the receiver, a soft-decision decoder, such as a Viterbi decoder, uses a trellis structure to perform an optimal search for the maximum likelihood transmitted code vector. More recently, turbo codes have been developed that outperform conventional coding techniques. Turbo codes are generally composed of two or more convolutional codes and random interleavers. Turbo decoding is iterative using a soft output decoder to decode the constituent convolutional codes.
The soft output decoder provides a reliability measure on each information bit, which is used to help the soft output decoder of the other convolutional codes. The soft output decoder computes an approximated probability ratio (the log likelihood probability ratio) for each information bit in a received signal. The soft output decoder is usually a type of MAP (maximum a posterior) decoder, which uses both backward and forward decoding to determine the soft output. Due to memory, processing, and numerical tradeoffs, MAP decoding is usually limited to a sub-optimal approximation. All of these variants require both forward and backward decoding over the block.
For future standards, such as the 3GPP (third generation partnership project for wireless systems), an 8-state turbo code with a block length of N=5120, will need 40960 words of intermediate storage, which may be unacceptable for practical implementation. Future systems employing larger frames and a greater number of states will require even more memory. By comparison, a Viterbi decoder that does not produce soft outputs for an N=5120, 8-state trellis requires less than 100 words of intermediate storage.
There is a need for an efficient soft output decoder that reduces overall memory and processing requirements for decoding convolutional codes without the limitations imposed by prior art turbo and MAP decoders.
REFERENCES:
patent: 3662338 (1972-05-01), Cain III
patent: 4354269 (1982-10-01), Vries et al.
patent: 4404674 (1983-09-01), Rhodes
patent: RE31666 (1984-09-01), Doi et al.
patent: 4521886 (1985-06-01), Dollard et al.
patent: 4998253 (1991-03-01), Ohashi et al.
patent: 5381425 (1995-01-01), Bitzer et al.
patent: 5682395 (1997-10-01), Begin et al.
patent: 5848106 (1998-12-01), Khayrallah
patent: 5920599 (1999-07-01), Igarashi
patent: 6088828 (2000-07-01), De Bart et al.
patent: 6167552 (2000-12-01), Gagnon et al.
patent: 0625829 (1994-11-01), None
Ohashi et al., Development of a variable rate syndrome sequential decoder based on a stack algorithm, 1988, IEEE, p. 0131-1035.*
Schalwijk et al., Syndrome decoding of convolutional codes, Jul., -1975, IEEE Trans. on Comm., p. 789-792.*
Bahl et al., Optimal decoding of linear codes for minimizing symbol error rate, Mar.,-1974, IEEE trans. on Info. Theory, p. 284-287.*
Lucas et al., “On Iterative Soft-Decision Decoding of Linear Binary Block Codes and Product Codes”, IEEE 1998, col. 2, p. 276.
Hsu et al., “A Soft Decision Syndrome Decoding Algorithm for Convolutional Codes”, IEEE 1990, col. 1, p. 375.
Ariel et al., “Soft Syndrome Decoding of Binary Convolutional Codes”, IEEE 1995, col. 1, p. 288.
Moeneclaey et al., “Syndrome-Based Viterbi Decoder Node Synchronization and Out-of Lock Detection”, IEEE 1990, col. 1, p. 605.
Amrani Ofer
Ariel Meir
Meidan Reuven
Chase Shelly A
De'cady Albert
Motorola Inc.
Vaas Randall S.
LandOfFree
Syndrome assisted iterative decoder for turbo codes does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Syndrome assisted iterative decoder for turbo codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Syndrome assisted iterative decoder for turbo codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3158994