Application-specific instruction set processor implementation of list sphere detector
EURASIP Journal on Embedded Systems
EURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wireless Communications and Networking
Performance of space-time-frequency block-coded MC-DS-CDMA in correlated conditions
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Lattice-reduction for power optimisation using the fast least-squares solution-seeker algorithm
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ICT'09 Proceedings of the 16th international conference on Telecommunications
Multiple decision feedback equalizers for vector systems with complexity/performance tradeoff
ICT'09 Proceedings of the 16th international conference on Telecommunications
Tail behavior of sphere-decoding complexity in random lattices
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
IEEE Transactions on Communications
A deterministic method for choosing search radii in sphere decoding
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Low-complexity decoding via reduced dimension maximum-likelihood search
IEEE Transactions on Signal Processing
A new decoding algorithm in MIMO-ZP-OFDM systems
ICDHM'07 Proceedings of the 1st international conference on Digital human modeling
Efficient symbol detection in multi-device STBC-MIMO system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Near-optimal detection in MIMO systems using Gibbs sampling
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A joint symbol detection algorithm efficient at low SNR for a multi-device STBC-MIMO system
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Performance and complexity analysis of infinity-norm sphere-decoding
IEEE Transactions on Information Theory
Small-area and low-energy K-best MIMO detector using relaxed tree expansion and early forwarding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
A List Sphere Decoding Algorithm with Improved Radius Setting Strategies
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Low-complexity dominance-based sphere decoder for MIMO systems
Signal Processing
High-throughput soft-output MIMO detector based on path-preserving trellis-search algorithm
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.06 |
In Part I, we found a closed-form expression for the expected complexity of the sphere-decoding algorithm, both for the infinite and finite lattice. We continue the discussion in this paper by generalizing the results to the complex version of the problem and using the expected complexity expressions to determine situations where sphere decoding is practically feasible. In particular, we consider applications of sphere decoding to detection in multiantenna systems. We show that, for a wide range of signal-to-noise ratios (SNRs), rates, and numbers of antennas, the expected complexity is polynomial, in fact, often roughly cubic. Since many communications systems operate at noise levels for which the expected complexity turns out to be polynomial, this suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can, in fact, be implemented in real-time-a result with many practical implications. To provide complexity information beyond the mean, we derive a closed-form expression for the variance of the complexity of sphere-decoding algorithm in a finite lattice. Furthermore, we consider the expected complexity of sphere decoding for channels with memory, where the lattice-generating matrix has a special Toeplitz structure. Results indicate that the expected complexity in this case is, too, polynomial over a wide range of SNRs, rates, data blocks, and channel impulse response lengths.