Proceedings ArticleDOI
A near-ML sphere constraint stack detection algorithm with very low complexity in VBLAST systems
Chunlin Xiong,De-gang Wang,Jibo Wei +2 more
- pp 1-5
Reads0
Chats0
TLDR
The simulation results of computational complexity and detection performance presented in this paper show that the SC-Stack algorithm improves detection performance with lower complexity than the conventional stack algorithm.Abstract:
The stack algorithm is a promising tree-search algorithm with relatively low computation complexity for multi-input multi-output (MIMO) systems. Recent researches show that it obtains low detection complexity at the price of performance degradation. To achieve a better compromise between computational complexity and detection performance, a sphere constraint stack detection algorithm (SC-Stack) is proposed in this paper. With the aid of sorted QR decomposition based on the MMSE criterion (MMSE-SQRD), the proposed algorithm constrains conventional stack algorithm by a sphere radius obtained from partial serial interference cancellation (PSIC) algorithm. The SC-Stack algorithm avoids abundant metric computation by excluding a large number of nodes from the stack according to the sphere radius. The simulation results of computational complexity and detection performance presented in this paper show that the SC-Stack algorithm improves detection performance with lower complexity than the conventional stack algorithm. Moreover, the proposed algorithm achieves almost the same performance as sphere decoding algorithm while expanding far fewer nodes. So it is more feasible in practical systems.read more
References
More filters
Proceedings ArticleDOI
V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel
TL;DR: This paper describes a wireless communication architecture known as vertical BLAST (Bell Laboratories Layered Space-Time) or V-BLAST, which has been implemented in real-time in the laboratory and demonstrated spectral efficiencies of 20-40 bps/Hz in an indoor propagation environment at realistic SNRs and error rates.
Journal ArticleDOI
On maximum-likelihood detection and the search for the closest lattice point
TL;DR: A novel algorithm is developed that is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction in complexity compared to the Viterbo-Boutros sphere decoder and is supported by intuitive arguments and simulation results in many relevant scenarios.
Journal ArticleDOI
On the sphere-decoding algorithm I. Expected complexity
Babak Hassibi,Haris Vikalo +1 more
TL;DR: For the "sphere decoding" algorithm of Fincke and Pohst, a closed-form expression is found for the expected complexity, both for the infinite and finite lattice, which suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can be implemented in real time.
Proceedings ArticleDOI
MMSE extension of V-BLAST based on sorted QR decomposition
TL;DR: A novel, computationally efficient algorithm for detecting V-BLAST architectures with respect to the MMSE criterion is presented, which utilizes a sorted QR decomposition of the channel matrix and leads to a simple successive detection structure.
Proceedings ArticleDOI
Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction
TL;DR: This paper adopts lattice-reduction-aided schemes to the MMSE criterion and proposes an alternative method based on an extended system model, which in conjunction with simple successive interference cancellation nearly reaches the performance of maximum-likelihood detection.