This invention relates to channel decoders, and more particularly to applying metric correction to the log-likelihood ratio (LLR) of transmitted symbols.
For multiple component codes, optimal decoding is often a very complex task, and may require large periods of time, not usually available for on-line decoding. In order to overcome this problem, iterative decoding techniques have been developed. Rather than determining immediately whether received bits are zero or one, the receiver assigns each bit a value on a multi-level scale representative of the probability that the bit is one.
A soft input channel decoder requires having at its input the log-likelihood ratio (LLR) of the transmitted symbols, or some approximation of the LLR of the transmitted symbols. When using biphase phase shift keying (BPSK), a large positive value of the LLR indicates that the transmitted symbol is a “1” with high probability. A large negative value of the LLR indicates that the transmitted symbol is a “−1” with high probability. A low LLR magnitude implies low confidence in the value of the symbol. The channel decoder then utilizes the sequence of LLR values to decode the transmitted information in a manner that minimizes the error probability. This is possible because the LLR value of each symbol is directly related to the noise and interference that distorted the transmission the corresponding symbol.
Data represented on the multi-level scale is referred to as “soft data,” and iterative decoding is usually soft-in/soft-out, i.e., the decoding process receives a sequence of inputs corresponding to probabilities for the bit values and provides as output corrected probabilities taking into account constraints of the code. Generally, a decoder which performs iterative decoding, uses soft data from former iterations to decode the soft data read by the receiver.
Like reference symbols in the various drawings indicate like elements.
One embodiment of the present invention determines the LLR value for long-code direct sequence code division multiple access (DS-CDMA). In direct sequence spread spectrum, the stream of information to be transmitted is divided into small pieces, each of which is allocated across the spectrum to a frequency channel. A data signal at the point of transmission is combined with a higher data-rate bit sequence (chipping code) that divides the data according to a spreading ratio. The redundant chipping code helps the signal resist interference and also enables the original data to be recovered if data bits are damaged during transmission. The use of long codes results in interference being proportional to the cross-correlations between the spreading sequences of the different users. These spreading sequences change from symbol to symbol, resulting in a change in the level of multiple access interference (MAI) from symbol to symbol. By using the present invention, the performance of a conventional rake receiver may be improved, especially when the noise level is low and the dominant source of the signal degradation is the MAI.
For BPSK signaling, the LLR of the nth symbol is given by the following equation 1:
where:
r(n) is the detector output of the nth symbol;
g(n) is the time varying gain associated with the desired signal; and
is the total noise variance.
This equation assumes additive white Gaussian noise, which is the common practice in the DS-CDMA setting. However, modifications for other noise and multiple access interference distributions are possible and well known in the art. Further, extensions to other symbol constellations and to different modulations may be performed.
The desired signal term, which is g(n) multiplied by the transmitted symbol;
The multiple access interference (MAI) term which is assumed to be a white Gaussian process whose variance is denoted by
and
The noise term that is assumed to be a white Gaussian process whose variance is denoted by
Proceeding to block 215, the process 200 determines the normalization factor. The normalization factor is determined by calculating the gain of the desired term g(n). The variances
and
are then calculated. The total noise variance
is then determined using the following equation:
The normalization factor is then determined by placing the values of g(n) and
into Equation 1.
Proceeding to block 220, the process 200 multiplies the normalization factor by the output symbol to determine the metric correction 120. The metric correction 120 is then provided to the channel decoder 125 in block 225. After the channel decoder 125 receives the metric correction 120, the process 200 terminates in the END block 230.
An estimation error is provided in a feedback loop to continually refine the estimation of the MAI variance.
By determining and applying the metric correction 120, the gain of a MUD receiver may be preserved. For example, in the Wideband Code Division Multiple Access (WCDMA) standard 25.101 case 4 channel set-up, a gain of about 3 dB can be achieved with a conventional minimum mean-squared error multiuser detection (MMSE MUD) at the uncoded bit error rate (BER) level compared to the rake receiver. However, the 3 dB gain is lost when examining the block error rate (BLER) performance. By applying the metric correction, the 3 dB gain is obtained for the BLER performance.
A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5539832 | Weinstein et al. | Jul 1996 | A |
5930231 | Miller et al. | Jul 1999 | A |
6034986 | Yellin | Mar 2000 | A |
6047035 | Yellin | Apr 2000 | A |
6061520 | Yellin et al. | May 2000 | A |
6208684 | Yellin et al. | Mar 2001 | B1 |
6314130 | Smolyar et al. | Nov 2001 | B1 |
6459398 | Gureshnik et al. | Oct 2002 | B1 |
6546042 | Yellin et al. | Apr 2003 | B1 |
6603823 | Yellin et al. | Aug 2003 | B1 |
6618433 | Yellin | Sep 2003 | B1 |
6628701 | Yellin | Sep 2003 | B2 |
6661832 | Sindhushayana et al. | Dec 2003 | B1 |
6674793 | Smolyar et al. | Jan 2004 | B2 |
6741662 | Francos et al. | May 2004 | B1 |
6754251 | Sriram et al. | Jun 2004 | B1 |
6801581 | Francos et al. | Oct 2004 | B1 |
6848069 | Levy et al. | Jan 2005 | B1 |
6870890 | Yellin et al. | Mar 2005 | B1 |
6895421 | Dor et al. | May 2005 | B1 |
6895541 | Yellin | May 2005 | B1 |
20020025008 | Jurgensen et al. | Feb 2002 | A1 |
20020057728 | Yellin | May 2002 | A1 |
20020061052 | Smolyar et al. | May 2002 | A1 |
20020181624 | Gonzalez et al. | Dec 2002 | A1 |
20020194567 | Yellin et al. | Dec 2002 | A1 |
20030021337 | Moshavi et al. | Jan 2003 | A1 |
20030067962 | Yellin | Apr 2003 | A1 |
20030072388 | Francos et al. | Apr 2003 | A1 |
20030072396 | Binshtok et al. | Apr 2003 | A1 |
Number | Date | Country |
---|---|---|
10-233756 | Sep 1998 | JP |
WO 9610299 | Apr 1996 | WO |
WO 9966658 | Dec 1999 | WO |
WO 0013386 | Mar 2000 | WO |
WO 0069090 | Nov 2000 | WO |
Number | Date | Country | |
---|---|---|---|
20030081701 A1 | May 2003 | US |