Abstract
We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD) algorithm, while maintaining the DMT optimality at high signal to noise ratio (SNR) regime. The search tree of the sphere decoding algorithm is pruned via intersecting one dimensional spheres with the hypersphere of the SD algorithm, and the radii are chosen to guarantee the DMT optimality. In contrast to the conventional DMT optimal SD algorithm, which is known to have a polynomial complexity at high SNR regime, we show that the proposed method achieves the DMT optimality by solely visiting a single branch of the search tree at high SNR regime. The simulation results are corroborated with the claimed characteristics of the algorithm in two different scenarios.
Original language | English |
---|---|
Title of host publication | 2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020 - Proceedings |
Publisher | IEEE |
Pages | 5165-5169 |
Number of pages | 5 |
ISBN (Electronic) | 9781509066315 |
DOIs | |
Publication status | Published - May 2020 |
MoE publication type | A4 Conference publication |
Event | IEEE International Conference on Acoustics, Speech, and Signal Processing - Virtual conference, Barcelona, Spain Duration: 4 May 2020 → 8 May 2020 Conference number: 45 |
Publication series
Name | Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing |
---|---|
ISSN (Print) | 1520-6149 |
ISSN (Electronic) | 2379-190X |
Conference
Conference | IEEE International Conference on Acoustics, Speech, and Signal Processing |
---|---|
Abbreviated title | ICASSP |
Country/Territory | Spain |
City | Barcelona |
Period | 04/05/2020 → 08/05/2020 |
Other | Virtual conference |