TY - GEN
T1 - Sphere decoding algorithms with improved radius search
AU - Zhao, Wanlun
AU - Giannakis, Georgios B
PY - 2004
Y1 - 2004
N2 - In this work, we first identify the most efficient version of the sphere decoding algorithms (SDA). We then develop a novel SDA based on an improved increasing radius search (IIRS), which essentially achieves maximum likelihood (ML) error performance with considerable complexity reduction. We provide both design intuition and analytical parameter specification. We also introduce a probabilistic trimming approach, which exploits both channel realizations and the noise distribution. Simulations confirm our claims on both the IIRS and the probabilistic trimming aspects.
AB - In this work, we first identify the most efficient version of the sphere decoding algorithms (SDA). We then develop a novel SDA based on an improved increasing radius search (IIRS), which essentially achieves maximum likelihood (ML) error performance with considerable complexity reduction. We provide both design intuition and analytical parameter specification. We also introduce a probabilistic trimming approach, which exploits both channel realizations and the noise distribution. Simulations confirm our claims on both the IIRS and the probabilistic trimming aspects.
UR - https://www.scopus.com/pages/publications/4544298447
UR - https://www.scopus.com/pages/publications/4544298447#tab=citedBy
U2 - 10.1109/WCNC.2004.1311445
DO - 10.1109/WCNC.2004.1311445
M3 - Conference contribution
AN - SCOPUS:4544298447
SN - 0780383443
SN - 9780780383449
T3 - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
SP - 2290
EP - 2294
BT - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004
Y2 - 21 March 2004 through 25 March 2004
ER -