Abstract
The traditional K-best sphere decoder retains the best K-nodes at each level of the search tree; these K-nodes, include irrelevant nodes which increase the complexity without improving the performance. A variant of the K-best sphere decoding algorithm for ill-conditioned MIMO channels is proposed, namely, the ill-conditioned reduced complexity K-best algorithm (ill-RCKB). The ill-RCKB provides lower complexity than the traditional K-best algorithm without sacrificing its performance; this is achieved by discarding irrelevant nodes that have distance metrics greater than a pruned radius value, which depends on the channel condition number. A hybrid-RCKB decoder is also proposed in order to balance the performance and complexity in both well and ill-conditioned channels. Complexity analysis for the proposed algorithms is provided as well. Simulation results show that the ill-RCKB provides significant complexity reduction without compromising the performance.
| Original language | English |
|---|---|
| Title of host publication | 2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 183-187 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781467392921 |
| DOIs | |
| Publication status | Published - Mar 30 2016 |
| Event | 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016 - Las Vegas, United States Duration: Jan 6 2016 → Jan 13 2016 |
Publication series
| Name | 2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016 |
|---|
Other
| Other | 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016 |
|---|---|
| Country | United States |
| City | Las Vegas |
| Period | 1/6/16 → 1/13/16 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computer Networks and Communications
- Hardware and Architecture
Cite this
Reduced complexity K-best sphere decoding algorithms for ill-conditioned MIMO channels. / Al-Nahhal, Ibrahim; Alghoniemy, Masoud; Muta, Osamu; El-Rahman, Adel B.Abd.
2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 183-187 7444753 (2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Reduced complexity K-best sphere decoding algorithms for ill-conditioned MIMO channels
AU - Al-Nahhal, Ibrahim
AU - Alghoniemy, Masoud
AU - Muta, Osamu
AU - El-Rahman, Adel B.Abd
PY - 2016/3/30
Y1 - 2016/3/30
N2 - The traditional K-best sphere decoder retains the best K-nodes at each level of the search tree; these K-nodes, include irrelevant nodes which increase the complexity without improving the performance. A variant of the K-best sphere decoding algorithm for ill-conditioned MIMO channels is proposed, namely, the ill-conditioned reduced complexity K-best algorithm (ill-RCKB). The ill-RCKB provides lower complexity than the traditional K-best algorithm without sacrificing its performance; this is achieved by discarding irrelevant nodes that have distance metrics greater than a pruned radius value, which depends on the channel condition number. A hybrid-RCKB decoder is also proposed in order to balance the performance and complexity in both well and ill-conditioned channels. Complexity analysis for the proposed algorithms is provided as well. Simulation results show that the ill-RCKB provides significant complexity reduction without compromising the performance.
AB - The traditional K-best sphere decoder retains the best K-nodes at each level of the search tree; these K-nodes, include irrelevant nodes which increase the complexity without improving the performance. A variant of the K-best sphere decoding algorithm for ill-conditioned MIMO channels is proposed, namely, the ill-conditioned reduced complexity K-best algorithm (ill-RCKB). The ill-RCKB provides lower complexity than the traditional K-best algorithm without sacrificing its performance; this is achieved by discarding irrelevant nodes that have distance metrics greater than a pruned radius value, which depends on the channel condition number. A hybrid-RCKB decoder is also proposed in order to balance the performance and complexity in both well and ill-conditioned channels. Complexity analysis for the proposed algorithms is provided as well. Simulation results show that the ill-RCKB provides significant complexity reduction without compromising the performance.
UR - http://www.scopus.com/inward/record.url?scp=84966473889&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84966473889&partnerID=8YFLogxK
U2 - 10.1109/CCNC.2016.7444753
DO - 10.1109/CCNC.2016.7444753
M3 - Conference contribution
AN - SCOPUS:84966473889
T3 - 2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016
SP - 183
EP - 187
BT - 2016 13th IEEE Annual Consumer Communications and Networking Conference, CCNC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
ER -