Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Convex Optimization
Big Omicron and big Omega and big Theta
ACM SIGACT News
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Introduction to Space-Time Wireless Communications
Introduction to Space-Time Wireless Communications
Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication
Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication
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
IEEE Transactions on Signal Processing - Part I
Statistical Pruning for Near-Maximum Likelihood Decoding
IEEE Transactions on Signal Processing
Performance analysis of the V-BLAST algorithm: an analytical approach
IEEE Transactions on Wireless Communications
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
IEEE Transactions on Information Theory
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
Remarks on space-time codes including a new lower bound and an improved code
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
Soft-output sphere decoding: algorithms and VLSI implementation
IEEE Journal on Selected Areas in Communications
Improved detection algorithm for MIMO wireless communication system based on chase detector
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
| Hi-index | 754.84 |
Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) norm that is used to conduct the tree traversal step in SD is the l2-norm. It was, however, recently observed that using the l∞-norm instead reduces the hardware complexity of SD considerably at only a marginal performance loss. These savings result from a reduction in the length of the critical path in the circuit and the silicon area required for metric computation, but are also, as observed previously through simulation results, a consequence of a reduction in the computational (i.e., algorithmic) complexity. The aim of this paper is an analytical performance and computational complexity analysis of l∞-norm SD. For independent and identically distributed (i.i.d.) Rayleigh fading MIMO channels, we show that l∞-norm SD achieves full diversity order with an asymptotic SNR gap, compared to l2-norm SD, that increases at most linearly in the number of receive antennas. Moreover, we provide a closed-form expression for the computational complexity of l∞-norm SD based on which we establish that its complexity scales exponentially in the system size. Finally, we characterize the tree pruning behavior of l∞-norm SD and show that it behaves fundamentally different from that of l2-norm SD.