Stopping criterion for complexity reduction of sphere decoding
IEEE Communications Letters
The error probability of the fixed-complexity sphere decoder
IEEE Transactions on Signal Processing
Probabilistic spherical detection and VLSI implementation for multiple-antenna systems
IEEE Transactions on Circuits and Systems Part I: Regular Papers
WSEAS Transactions on Signal Processing
Low-complexity decoding via reduced dimension maximum-likelihood search
IEEE Transactions on Signal Processing
A 1.1-Gb/s 115-pJ/bit configurable MIMO detector using 0.13- µm CMOS technology
IEEE Transactions on Circuits and Systems II: Express Briefs
A radius adaptive K-Best decoder with early termination: algorithm and VLSI architecture
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special section on 2009 IEEE custom integrated circuits conference
A Parallel Early-Pruned K-Best MIMO Signal Detector Up to 1.9Gb/s
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
Abstract-Closest point algorithms find wide applications in decoding block transmissions encountered with single- or multiuser communication links relying on a single or multiple antennas. Capitalizing on the random channel and noise models typically encountered in wireless communications, the sphere decoding algorithm (SDA) and related complexity-reducing techniques are approached in this paper from a probabilistic perspective. With both theoretical analysis and simulations, combining SDA with detection ordering is justified. A novel probabilistic search algorithm examining potential candidates in a descending probability order is derived and analyzed. Based on probabilistic search and an error-performance-oriented fast stopping criterion, a computationally efficient layered search is developed. Having comparable decoding complexity to the ing-canceling (NQ algorithm with detection ordering, simulations confirm that the novel layered search achieves considerable error-performance enhancement.