A novel approach for K-best MIMO detection and its VLSI implementation

Sudip Mondal; Khaled N. Salama; Warsame H. Ali

doi:10.1109/ISCAS.2008.4541573

A novel approach for K-best MIMO detection and its VLSI implementation

Sudip Mondal^*, Khaled N. Salama, Warsame H. Ali

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Since the complexity of MIMO detection algorithms is exponential, the K-best algorithm is often chosen for efficient VLSI implementation. This detection problem is often viewed as a tree search problem where the Breadth First Search (BFS) method is adopted and only the K-best branches are kept at each level of the tree. An earlier VLSI implementation of the K-best BFS has been reported, however it has an inherent speed bottleneck due to the calculation of many path metrics and then sorting among them to select the K-best. In this paper an alternative implementation of the BFS is presented, which is suitable for VLSI implementation. To test the performance of this approach it has been applied to a 4X4 MIMO detector with a 64 QAM constellation. The results show less than 1dB degradation from the sphere decoding algorithm. The implementation of a single spiral cell, the basic block behind the system, occupies a 764μm² of area and consumes a 52.58μw of power a 0.13μm CMOS technology.

Original language	English (US)
Title of host publication	2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008
Pages	936-939
Number of pages	4
DOIs	https://doi.org/10.1109/ISCAS.2008.4541573
State	Published - 2008
Externally published	Yes
Event	2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008 - Seattle, WA, United States Duration: May 18 2008 → May 21 2008

Other

Other	2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008
Country/Territory	United States
City	Seattle, WA
Period	05/18/08 → 05/21/08

ASJC Scopus subject areas

Electrical and Electronic Engineering
Electronic, Optical and Magnetic Materials

Access to Document

10.1109/ISCAS.2008.4541573

Cite this

@inproceedings{cc565b64b3794eb5b648889cebf56509,

title = "A novel approach for K-best MIMO detection and its VLSI implementation",

abstract = "Since the complexity of MIMO detection algorithms is exponential, the K-best algorithm is often chosen for efficient VLSI implementation. This detection problem is often viewed as a tree search problem where the Breadth First Search (BFS) method is adopted and only the K-best branches are kept at each level of the tree. An earlier VLSI implementation of the K-best BFS has been reported, however it has an inherent speed bottleneck due to the calculation of many path metrics and then sorting among them to select the K-best. In this paper an alternative implementation of the BFS is presented, which is suitable for VLSI implementation. To test the performance of this approach it has been applied to a 4X4 MIMO detector with a 64 QAM constellation. The results show less than 1dB degradation from the sphere decoding algorithm. The implementation of a single spiral cell, the basic block behind the system, occupies a 764μm2 of area and consumes a 52.58μw of power a 0.13μm CMOS technology.",

author = "Sudip Mondal and Salama, {Khaled N.} and Ali, {Warsame H.}",

year = "2008",

doi = "10.1109/ISCAS.2008.4541573",

language = "English (US)",

isbn = "9781424416844",

pages = "936--939",

booktitle = "2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008",

note = "2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008 ; Conference date: 18-05-2008 Through 21-05-2008",

}

TY - GEN

T1 - A novel approach for K-best MIMO detection and its VLSI implementation

AU - Mondal, Sudip

AU - Salama, Khaled N.

AU - Ali, Warsame H.

PY - 2008

Y1 - 2008

N2 - Since the complexity of MIMO detection algorithms is exponential, the K-best algorithm is often chosen for efficient VLSI implementation. This detection problem is often viewed as a tree search problem where the Breadth First Search (BFS) method is adopted and only the K-best branches are kept at each level of the tree. An earlier VLSI implementation of the K-best BFS has been reported, however it has an inherent speed bottleneck due to the calculation of many path metrics and then sorting among them to select the K-best. In this paper an alternative implementation of the BFS is presented, which is suitable for VLSI implementation. To test the performance of this approach it has been applied to a 4X4 MIMO detector with a 64 QAM constellation. The results show less than 1dB degradation from the sphere decoding algorithm. The implementation of a single spiral cell, the basic block behind the system, occupies a 764μm2 of area and consumes a 52.58μw of power a 0.13μm CMOS technology.

AB - Since the complexity of MIMO detection algorithms is exponential, the K-best algorithm is often chosen for efficient VLSI implementation. This detection problem is often viewed as a tree search problem where the Breadth First Search (BFS) method is adopted and only the K-best branches are kept at each level of the tree. An earlier VLSI implementation of the K-best BFS has been reported, however it has an inherent speed bottleneck due to the calculation of many path metrics and then sorting among them to select the K-best. In this paper an alternative implementation of the BFS is presented, which is suitable for VLSI implementation. To test the performance of this approach it has been applied to a 4X4 MIMO detector with a 64 QAM constellation. The results show less than 1dB degradation from the sphere decoding algorithm. The implementation of a single spiral cell, the basic block behind the system, occupies a 764μm2 of area and consumes a 52.58μw of power a 0.13μm CMOS technology.

UR - http://www.scopus.com/inward/record.url?scp=51749097330&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2008.4541573

DO - 10.1109/ISCAS.2008.4541573

M3 - Conference contribution

AN - SCOPUS:51749097330

SN - 9781424416844

SP - 936

EP - 939

BT - 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008

T2 - 2008 IEEE International Symposium on Circuits and Systems, ISCAS 2008

Y2 - 18 May 2008 through 21 May 2008

ER -

A novel approach for K-best MIMO detection and its VLSI implementation

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this