On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
Multi-strata codes: space-time block codes with low detection complexity
IEEE Transactions on Communications
Turbo-BLAST for wireless communications: theory and experiments
IEEE Transactions on Signal Processing
Bit-interleaved space-time coded modulation with iterative decoding
IEEE Transactions on Wireless Communications
Iterative decoding for MIMO channels via modified sphere decoding
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
An Optimized-Hierarchy-Aided Approximate Log-MAP Detector for MIMO Systems
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
IEEE Transactions on Information Theory
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
High-rate concatenated space-time block code M-TCM designs
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Soft-output sphere decoding: algorithms and VLSI implementation
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Two kinds of iterative sphere detectors based on modifications of the Schnorr-Euchner enumeration are presented. The first is capable of finding 'good' candidate lattice points relatively soon. Its complexity and performance are controlled by an adaptive radius backlash update strategy. The second systematically searches for the most contributive term in each of the two log-sum-exponents. Both kinds require modifications to the original Schnorr-Euchner enumeration. The objective function must account for the input a priories and explicit sorting of the branches stemming from the tree nodes must be done because the simple zigzag order in this case is not valid. The impact of the a priories on the log-likelihood ratio clipping is also addressed. The advantages of the new detectors compared to the Fincke-Pohst-based ones are: i) No initial radius is required, ii) the search step is division- and square-root-free and iii) the average computational complexity is lower.