Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Algorithm and implementation of the K-best sphere decoding for MIMO detection
IEEE Journal on Selected Areas in Communications
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
Reduced complexity sphere decoding
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
In this letter, we propose a reordering of the channel representation for Sphere Decoding (SD) where the real and imaginary parts of each jointly detected symbol are decoded independently. Making use of the proposed structure along with a scalar quantization technique, we reduce the decoding complexity substantially. We show that this approach achieves 85% reduction in the overall complexity compared to the conventional SD for a 2 × 2 system, and 92% reduction for the 4 × 4 and 6 × 6 cases at low SNR values, and almost 50% at high SNR, thus relaxing the requirements for hardware implementation.