A new reduced-complexity sphere decoder for multiple antenna systems

Albert M. Chan, Inkyu Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

186 Citations (Scopus)

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 languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages460-464
Number of pages5
Volume1
Publication statusPublished - 2002
Externally publishedYes
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: 2002 Apr 282002 May 2

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period02/4/2802/5/2

Fingerprint

Antennas
Decoding
Quadrature amplitude modulation

ASJC Scopus subject areas

  • Media Technology

Cite this

Chan, A. M., & Lee, I. (2002). A new reduced-complexity sphere decoder for multiple antenna systems. In IEEE International Conference on Communications (Vol. 1, pp. 460-464)

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 proceedingConference contribution

Chan, AM & Lee, I 2002, A new reduced-complexity sphere decoder for multiple antenna systems. in IEEE International Conference on Communications. vol. 1, pp. 460-464, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 02/4/28.
Chan AM, Lee I. A new reduced-complexity sphere decoder for multiple antenna systems. In IEEE International Conference on Communications. Vol. 1. 2002. p. 460-464
Chan, Albert M. ; Lee, Inkyu. / A new reduced-complexity sphere decoder for multiple antenna systems. IEEE International Conference on Communications. Vol. 1 2002. pp. 460-464
@inproceedings{87f5b1d4f543436ba7ef763583f87d7a,
title = "A new reduced-complexity sphere decoder for multiple antenna systems",
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.",
author = "Chan, {Albert M.} and Inkyu Lee",
year = "2002",
language = "English",
volume = "1",
pages = "460--464",
booktitle = "IEEE International Conference on Communications",

}

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 -