Low Complexity QRD-M MIMO Detection Algorithm Based on Adaptive Search Area 


Vol. 33,  No. 6, pp. 614-623, Jun.  2008


PDF
  Abstract

A very low complexity QRD-M algorithm based on adaptive search area is proposed for MIMO systems. The conventional QRD-M scheme extends each survivor paths to all constellation symbols at each layer and selects M paths of minimum path metrics. We found that performance will not be degraded even if we adaptively restrict the survivor path extension only to the neighboring points of temporary detection symbol according to the channel condition at each layer. By employing this feature, we propose a new QRD-M algorithm achieving the near MLD performance with a reduced complexity. We employ the channel gain ratio among the layers as a channel condition indicator, which does not require SNR estimation. The simulation results show that the proposed scheme effectively achieves near MLD performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

B. Kim and K. Choi, "Low Complexity QRD-M MIMO Detection Algorithm Based on Adaptive Search Area," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 6, pp. 614-623, 2008. DOI: .

[ACM Style]

Bong-seok Kim and Kwonhue Choi. 2008. Low Complexity QRD-M MIMO Detection Algorithm Based on Adaptive Search Area. The Journal of Korean Institute of Communications and Information Sciences, 33, 6, (2008), 614-623. DOI: .

[KICS Style]

Bong-seok Kim and Kwonhue Choi, "Low Complexity QRD-M MIMO Detection Algorithm Based on Adaptive Search Area," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 6, pp. 614-623, 6. 2008.