Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Advanced receiver algorithms for MIMO wireless communications
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Space-Time Wireless Systems: From Array Processing to MIMO Communications
Space-Time Wireless Systems: From Array Processing to MIMO Communications
A scalable VLSI architecture for soft-input soft-output depth-first sphere decoding
IEEE Transactions on Circuits and Systems II: Express Briefs
Minimum mean squared error equalization using a priori information
IEEE Transactions on Signal Processing
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Dynamic Nulling-and-Canceling for Efficient Near-ML Decoding of MIMO Systems
IEEE Transactions on Signal Processing
Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels
IEEE Transactions on Signal Processing
Speeding up the Sphere Decoder With H∞ and SDP Inspired Lower Bounds
IEEE Transactions on Signal Processing
Iterative decoding for MIMO channels via modified sphere decoding
IEEE Transactions on Wireless Communications
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Soft-output sphere decoding: algorithms and VLSI implementation
IEEE Journal on Selected Areas in Communications
A scalable VLSI architecture for soft-input soft-output depth-first sphere decoding
IEEE Transactions on Circuits and Systems II: Express Briefs
| Hi-index | 754.84 |
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses Significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO) wireless communication systems. In this paper, we present a low-complexity SISO sphere-decoding algorithm, based on the single tree-search paradigm proposed originally for soft-output MIMO detection in Studer et al. ("Soft-output sphere decoding: Algorithms and VLSI implementation", IEEE J. Sel. Areas Commun., vol. 26, no. 2, pp. 290-300, Feb. 2008). The new algorithm incorporates clipping of the extrinsic log-likelihood ratios (LLRs) into the tree-search, which results in significant complexity savings and allows to cover a large performance/complexity tradeoff region by adjusting a single parameter. Furthermore, we propose a new method for correcting approximate LLRs--resuiting from sub-optimal detectors--which (often significantly) improves detection performance at low additional computational complexity.