Sphere decoding apparatus

• US 8,462,859 B2
• Filed: 05/31/2006
• Issued: 06/11/2013
• Est. Priority Date: 06/01/2005
• Status: Active Grant

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Sampath, Hemanth, Kadous, Tamer
• Primary Examiner(s): HA, DAC V
• Application Number:
  US11/445,377
• Publication Number:
  US 20060274836A1
• Time in Patent Office: 2,568 Days
• Field of Search: 375/260, 375/262, 375/265, 375/267, 375/340, 375/341, 375/141, 375/147, 375/148, 370/464, 370/465, 370479-480
• US Class Current: 375/260
• CPC Class Codes: H03M 13/45 Soft decoding, i.e. using symbol reliability information H03M13/41 takes precedence
• CPC Class Codes: H04B 7/04 using two or more spaced independent antennas
• CPC Class Codes: H04L 1/0003 by switching between different modulation schemes
• CPC Class Codes: H04L 1/0009 by adapting the channel coding H04L1/1812 takes precedence
• CPC Class Codes: H04L 1/0026 Transmission of channel quality indication
• CPC Class Codes: H04L 1/0048 in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder for spatial equalizer H04L25/03286
• CPC Class Codes: H04L 1/0066 Parallel concatenated codes
• CPC Class Codes: H04L 1/06 using space diversity
• CPC Class Codes: H04L 1/0631 Receiver arrangements
• CPC Class Codes: H04L 1/0656 Cyclotomic systems, e.g. Bell Labs Layered Space-Time [BLAST]
• CPC Class Codes: H04L 2025/03414 Multicarrier
• CPC Class Codes: H04L 25/03197 methods of calculation involving metrics
• CPC Class Codes: H04L 25/03242 Methods involving sphere decoding
• CPC Class Codes: H04L 27/2601 Multicarrier modulation systems
• CPC Class Codes: H04L 27/38 Demodulator circuits; Receiver circuits

Abstract

Methods and apparatuses for decoding codewords received over a MIMO channel are provided. According to one aspect of the disclosure, a cost function is computed for each constellation point of an Mth rank or spatial layer, and N_cand of those constellation points having minimum cost are preserved as candidate points, where N_cand is a parameter specified to the decoding algorithm. In addition, a cost function may be computed for all possible transitions from the N_cand candidate points of the Mth rank to all possible constellation points of the (M−1)th spatial layer, and N_cand of those transitions having minimum cost are preserved as candidate points. The process is repeated for all spatial layers, resulting in the identification of N_cand candidate codewords and their associated cost functions.

Claims

1. A method for list sphere decoding comprising:

receiving at a receiver at least one codeword sent over a multiple-input multiple-output (MIMO) channel, wherein the at least one codeword comprises a plurality of layers, each layer comprising a constellation point of a plurality of candidate constellation points;

for each layer, computing a state cost metric using said codeword for each constellation point of the at least one layer, and selecting preferred states of the at least one layer whose state cost metrics meet first preferred criteria; and

for each of a plurality of constellation points of said layer, computing a state cost metric using said codeword for each transition from a preferred constellation point of said layer to each constellation point of a following layer, and selecting preferred transitions to said following layer whose state cost metrics meet second preferred criteria.

2. The method of claim 1, further comprising, for each layer, storing in a memory the state cost metrics associated with said selected preferred constellation points and transitions.

3. The method of claim 1, wherein meeting the first preferred criteria comprises being one of a candidate plurality of constellation point s having the lowest state costs for a constellation point.

4. The method of claim 3, wherein meeting the second preferred criteria comprises being one of a candidate plurality of transitions having the lowest constellation point costs for a layer.

5. The method of claim 4, wherein said candidate plurality can be variable across layers, and can be a function of the number of candidate constellation points for each layer.

6. The method of claim 5, wherein said codeword is a multiple-code word (MCW).

7. The method of claim 4, wherein said codeword is a single-code word (SCW).

8. The method of claim 1, further comprising storing in a memory said constellation point cost metric for a stage after computation, and re-using said stored metric when computing a constellation point cost metric during a following layer.

9. The method of claim 1, further comprising determining candidate codewords from said preferred constellation points and said preferred transitions.

10. The method of claim 9, further comprising computing overall cost metrics for said candidate codewords.

11. The method of claim 10, further comprising selecting a candidate codeword having the lowest overall cost metric.

12. The method of claim 1, wherein the first and second preferred criteria are met when a computed constellation point cost metric is one of a candidate plurality of constellation point cost metrics having the lowest values for a given layer, and wherein said candidate plurality can be variable across layers.

13. The method of claim 12, wherein said candidate plurality is constant for all layers.

14. The method of claim 1, wherein the first preferred criteria are met when a computed state cost metric is lower than a specified threshold.

15. The method of claim 1, further comprising calculating a soft extrinsic information metric for each bit.

16. The method of claim 15, wherein said soft extrinsic information metric for each bit is provided to a turbo decoder.

17. The method of claim 16, wherein said turbo decoder further generates an additional soft extrinsic information metric for each bit.

18. The method of claim 17, wherein each layer comprises a stage of a trellis and each constellation point comprises a state of one stage of the trellis.

19. A decoding method comprising:

receiving a codeword comprising a plurality of symbols, each symbol corresponding to at least one of a plurality of candidate constellation points;

for a first symbol;

computing a cost metric for each candidate constellation point of said first symbol;

storing in a memory only those candidate constellation points whose computed cost metrics meet first preferred criteria;

for each following symbol, and for each candidate constellation point previously stored in said memory for the symbol immediately preceding said following symbol;

computing a cost metric for each candidate transition from said previously stored candidate constellation point to a candidate constellation point of said following symbol; and

storing in said memory only those candidate transitions whose computed cost metrics meet second preferred criteria.

20. The method of claim 19, further comprising determining candidate codewords from the candidate constellation points and candidate transitions stored in said memory.

21. The method of claim 19, wherein said codeword is transmitted over a MIMO channel, and said symbols of said codeword are simultaneously transmitted on different antennas over said MIMO channel.

22. The method of claim 21, wherein said MIMO channel is characterized by a channel matrix H;

further comprising providing an upper triangular matrix R related to the matrix H by a unitary transformation, and wherein said computed cost metric for each symbol is a function of the coefficients in the rows of the matrix R corresponding to said symbol and all symbols preceding said symbol.

23. The method of claim 19, wherein meeting said first preferred criteria comprises being a candidate constellation point having an associated cost metric that is one of the a first candidate plurality of lowest cost metrics for all candidate constellation points.

24. The method of claim 23, wherein said first candidate plurality is less than the total number of candidate constellation points for a symbol.

25. The method of claim 24, wherein meeting said second preferred criteria comprises being a candidate transition having an associated cost metric that is one of a second candidate plurality of lowest cost metrics for all candidate transitions for that symbol, wherein said second candidate plurality is less than the total number of candidate transitions from a candidate constellation point of the preceding symbol to a candidate constellation point of the following symbol, and wherein said first candidate plurality is equal to said second candidate plurality.

26. The method of claim 19, wherein meeting said second preferred criteria comprises being a candidate transition having an associated cost metric that is one of a second candidate plurality of lowest cost metrics for all candidate transitions.

27. The method of claim 26, wherein said second candidate plurality is less than the total number of candidate transitions from a candidate constellation point of the preceding symbol to a candidate constellation point of the following symbol.

28. The method of claim 19, wherein each of said following symbols comprises a symbol following in time.

29. The method of claim 19, wherein each of said following symbols comprises a symbol following in rank.

30. A decoder apparatus comprising:

a receiver configured to receive at least one codeword sent over a multiple-input multiple-output (MIMO) channel, wherein the at least one codeword comprises a plurality of layers, each layer comprising a constellation point selected from a plurality of candidate constellation points; and

a processor configured to, for at least one layer, compute a constellation point metric for the at least one layer, and to select preferred constellation points of the at least one layer whose state cost metrics meet first preferred criteria;

the processor further configured to compute a constellation point cost metric for each transition from a preferred constellation point of the layer to each constellation point of a following layer, and selecting preferred transitions to said following layer whose constellation point cost metrics meet second preferred criteria.

31. The apparatus of claim 30, further comprising a memory for storing, for each stage, the state cost metrics associated with the preferred states and the preferred transitions.

32. The apparatus of claim 30, wherein meeting the first preferred criteria comprises being one of a candidate plurality states having the lowest state costs for the stage.

33. The apparatus of claim 32, wherein meeting the second preferred criteria comprises being one of said candidate plurality of transitions having the lowest state costs for the stage.

34. The apparatus of claim 33, wherein the MIMO channel is characterized by a channel matrix H, wherein the rank of the matrix H is M, further comprising providing an upper triangular matrix R related to said channel matrix H, wherein said state cost metric for each state of the number of stages is expressed as R_MM²∥

s_M−

ŝ

_M∥

², and wherein the state cost metric of said Mth stage is expressed as R_MM²∥

s_M−

ŝ

_M∥

², wherein;

R is an upper triangular matrix related to the matrix H by a unitary transformation;

RMM denotes the entry of said matrix R corresponding to the Mth row and the Mth column;

sM denotes a candidate constellation point of the Mth layer; and

ŝ

_M denotes the Mth entry of the zero-forcing solution ŝ

=(H*H)<sup>−

1</sup>H*x.

35. The apparatus of claim 34, wherein the state cost metric for each transition of the ith stage is expressed as follows:

36. The apparatus of claim 30, further comprising a soft information processor for computing soft extrinsic information for each bit associated with each constellation point associated with each layer of a candidate codeword, wherein a candidate codeword can be determined from said preferred states and preferred transitions.

37. A processor readable media comprising instructions thereon that may be utilized by a processor, the instructions comprising:

instructions for a first symbol, of a codeword comprising a plurality of symbols, each symbol corresponding to at least one of a plurality of candidate constellation points, computing a cost metric for each candidate constellation point of said first symbol;

instructions for storing in a memory only those candidate constellation points whose computed cost metrics meet first preferred criteria; and

instructions, for each following symbol and for each candidate constellation point previously stored in said memory for the symbol immediately preceding said following symbol, computing a cost metric for each candidate transition from said previously stored candidate constellation point to a candidate constellation point of said following symbol.

38. The processor readable media of claim 37, further comprising instructions for storing in said memory only those candidate transitions whose computed cost metrics meet second preferred criteria.