Abstract
Sphere decoding for multiple antenna systems has been shown to achieve near-ML performance with low complexity. However, the achievement of such an excellent performance-complexity tradeoff is highly dependent on the initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm which is even less computationally complex than the original sphere decoder. Moreover, the complexity of the new sphere decoder is relatively insensitive to the initial choice of sphere radius. Thus, by making the choice of radius sufficiently large, the ML solution is guaranteed with low complexity, even for large constellations. In our simulations, we show that with 4 transmit and 4 receive antennas and 64-QAM, our new sphere decoding algorithm achieves the exact ML solution with approximately a factor of 3.5 reduction in complexity when compared to the original sphere decoder, and a factor of 10 5 reduction when compared to brute-force ML decoding.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Communications |
| Pages | 460-464 |
| Number of pages | 5 |
| Volume | 1 |
| Publication status | Published - 2002 |
| Externally published | Yes |
| Event | 2002 International Conference on Communications (ICC 2002) - New York, NY, United States Duration: 2002 Apr 28 → 2002 May 2 |
Other
| Other | 2002 International Conference on Communications (ICC 2002) |
|---|---|
| Country | United States |
| City | New York, NY |
| Period | 02/4/28 → 02/5/2 |
Fingerprint
ASJC Scopus subject areas
- Media Technology
Cite this
A new reduced-complexity sphere decoder for multiple antenna systems. / Chan, Albert M.; Lee, Inkyu.
IEEE International Conference on Communications. Vol. 1 2002. p. 460-464.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A new reduced-complexity sphere decoder for multiple antenna systems
AU - Chan, Albert M.
AU - Lee, Inkyu
PY - 2002
Y1 - 2002
N2 - Sphere decoding for multiple antenna systems has been shown to achieve near-ML performance with low complexity. However, the achievement of such an excellent performance-complexity tradeoff is highly dependent on the initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm which is even less computationally complex than the original sphere decoder. Moreover, the complexity of the new sphere decoder is relatively insensitive to the initial choice of sphere radius. Thus, by making the choice of radius sufficiently large, the ML solution is guaranteed with low complexity, even for large constellations. In our simulations, we show that with 4 transmit and 4 receive antennas and 64-QAM, our new sphere decoding algorithm achieves the exact ML solution with approximately a factor of 3.5 reduction in complexity when compared to the original sphere decoder, and a factor of 10 5 reduction when compared to brute-force ML decoding.
AB - Sphere decoding for multiple antenna systems has been shown to achieve near-ML performance with low complexity. However, the achievement of such an excellent performance-complexity tradeoff is highly dependent on the initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm which is even less computationally complex than the original sphere decoder. Moreover, the complexity of the new sphere decoder is relatively insensitive to the initial choice of sphere radius. Thus, by making the choice of radius sufficiently large, the ML solution is guaranteed with low complexity, even for large constellations. In our simulations, we show that with 4 transmit and 4 receive antennas and 64-QAM, our new sphere decoding algorithm achieves the exact ML solution with approximately a factor of 3.5 reduction in complexity when compared to the original sphere decoder, and a factor of 10 5 reduction when compared to brute-force ML decoding.
UR - http://www.scopus.com/inward/record.url?scp=0036282015&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036282015&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0036282015
VL - 1
SP - 460
EP - 464
BT - IEEE International Conference on Communications
ER -