Decoding of turbo codes using data scaling

Details Decoding of turbo codes using data scaling Decoding of turbo codes using data scaling

2000-10-11

2002-05-21

Chin, Stephen (Department: 2634)

Pulse or digital communications

Receivers

Particular pulse demodulator or detector

Reexamination Certificate

active

06393076

ABSTRACT:

FIELD OF THE INVENTION
This invention relates generally to communication systems, and more particularly to decoding in a receiver of a convolutionally coded communication system.
BACKGROUND OF THE INVENTION
Convolutional codes are often used in digital communication systems to protect transmitted information from error. Such communication systems include the Direct Sequence Code Division Multiple Access (DS-CDMA) standard IS-95 and the Global System for Mobile Communications (GSM) and future CDMA2000 systems. Typically in these systems, a signal is convolutionally coded into an outgoing code vector that is transmitted. At a receiver, a practical soft-decision decoder, such as a Viterbi decoder as is known in the art, uses a trellis structure to perform an optimum 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 turbo interleavers. Turbo decoding is iterative and uses a soft output decoder to decode the individual convolutional codes. The soft output decoder provides information on each bit position which helps the soft output decoder decode the other convolutional codes. The soft output decoder is usually a MAP (maximum a posteriori) or soft output Viterbi algorithm (SOVA) decoder.
Turbo coding is efficiently utilized to correct errors in the case of communicating over an added white Gaussian noise (AWGN) channel. Intuitively, there are a few ways to examine and evaluate the error correcting performance of the turbo decoder. One observation is that the magnitude of log-likelihood ratio (LLR) for each information bit in the iterative portion of the decoder increases as iterations go on. This improves the probability of the correct decisions. The LLR magnitude increase is directly related to the number of iterations in the turbo decoding process. The rate of increase of the LLR magnitude varies as the quality of the incoming signal and the resulting number of errors incurred therein. In other words, the rate of increase of the LLR magnitude is related to channel conditions, where a more noisy environment increases error.
Prior art methods for improving turbo coder performance include scaling the channel outputs of the turbo decoder by an estimate of the channel characteristics. However, this scaling is only useful for the next set of data to be decoded and not for the data from which the channel estimate is derived. This problem is compounded where channel conditions are variable. In addition, an inaccurate estimate will yield sever performance degradation.
There is a need for an improvement that does not rely on channel estimation as a base for scaling. In addition, it would be of benefit to provide correction to existing data instead of using information from the existing data to correct subsequent data as is done in the prior art. Moreover, it would be beneficial to provide the improvement without an increase in calculation complexity, hardware requirements, or cost.


REFERENCES:
patent: 5173879 (1992-12-01), Cung et al.
patent: 5949796 (1999-09-01), Kumar
patent: 6067327 (2000-05-01), Creigh et al.
patent: 6145114 (2000-11-01), Crozier et al.
patent: 6307901 (2001-10-01), Yu et al.
Hagenauer et al., “Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Trans. Inf. Theory, vol. 42, Mar. 1996, pp. 429-445.
Viterbi, A., “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolution Codes”, IEEE Journal of Select. Areas Commun., vol. 16, No. 2, Feb. 1998, pp. 260-264.
Bahl et al., “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Trans. Inform. Theory, vol. IT-20, Mar. 1974, pp. 284-287.

Affiliated with

Also associated with

Rating

Decoding of turbo codes using data scaling 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 of turbo codes using data scaling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding of turbo codes using data scaling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2874158