A simplified fixed-complexity sphere decoder for V-BLAST systems
IEEE Communications Letters
The error probability of the fixed-complexity sphere decoder
IEEE Transactions on Signal Processing
Low-complexity adaptive tree search algorithm for MIMO detection
IEEE Transactions on Wireless Communications
Variable-breadth K-best detector for MIMO systems
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Simplified ordering for fixed-complexity sphere decoder
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Random-restart reactive tabu search algorithm for detection in large-MIMO systems
IEEE Communications Letters
A new efficient ordering scheme for sphere detection
Journal of Electrical and Computer Engineering
A power-efficient soft-output detector for spatial-multiplexing MIMO communications
Journal of Electrical and Computer Engineering - Special issue on Implementations of Signal-Processing Algorithms for OFDM Systems
VLSI Design - Special issue on Flexible Radio Design: Trends and Challenges in Digital Baseband Implementation
Adaptive Parallel and Iterative QRDM Detection Algorithms for MIMO Multiplexing Systems
Wireless Personal Communications: An International Journal
Multicore implementation of a fixed-complexity tree-search detector for MIMO communications
The Journal of Supercomputing
An efficient GPU implementation of fixed-complexity sphere decoders for MIMO wireless systems
Integrated Computer-Aided Engineering
| Hi-index | 0.01 |
A new detection algorithm for uncoded multiple input-multiple output (MIMO) systems based on the complex version of the sphere decoder (SD) is presented in this paper. It performs a fixed number of operations during the detection process, overcoming the two main problems of the SD from an implementation point of view: its variable complexity and its sequential nature. The algorithm combines a novel channel matrix ordering with a search through a very small subset of the complete transmit constellation. A geometrically-based method is used to study the effect the proposed ordering has on the statistics of the MIMO channel. Using those results, a generalization is given for the structure this subset needs to follow in order to achieve quasi-maximum likelihood (ML) performance. Simulation results show that it has only a very small bit error rate (BER) degradation compared to the original SD while being suited for a fully-pipelined hardware implementation due to its low and fixed complexity.