Sciweavers

Share
VTC
2006
IEEE

List Stack Detection with Reduced Search Space for MIMO Communication Systems

8 years 11 months ago
List Stack Detection with Reduced Search Space for MIMO Communication Systems
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorithms. Algorithms such as the M algorithm and the Stack algorithm yields near-ML performance while only requiring a fraction of the computational complexity of an ML receiver. While the Stack algorithm is computationally less intensive than the M algorithm for uncoded systems and hard decision decoding, the reverse is true for soft decision decoding as a candidate list is required to compute the soft metric. The M algorithm can easily generate a candidate list at no extra cost, the Stack algorithm, on the other hand, would require more iterations to generate the list. In this paper, we propose a modified Stack algorithm which have a lower computational complexity than a conventional one without sacrificing much of the performance of the algorithm.
Woon Hau Chin, Sumei Sun
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where VTC
Authors Woon Hau Chin, Sumei Sun
Comments (0)
books