Low Complexity LSD Scheme for Joint Iterative MIMO Detection 


Vol. 38,  No. 11, pp. 1051-1059, Nov.  2013


PDF Full-Text
  Abstract

This paper proposes a complexity reduced list sphere decoding (LSD) scheme for joint iterative soft detection scheme for coded MIMO system. The conventional LSD scheme is based on searching the candidates with a fixed radius. However, once the candidate list is full, it is highly probable that the radius can be reduced. By reducing the radius, the complexity can be also reduced. We propose a simple and efficient radius update method for complexity reduction of list version sphere decoding and its application to iterative soft MIMO detection. We evaluate the performance of the proposed scheme with a joint soft-input-soft-ouput iterative MIMO detection in combination with turbo codes. Simulation results show that the proposed methods provide substantial complexity reduction while achieving similar bit error rate (BER) performance as the conventional LSD scheme.

  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]

S. Ahmed and S. Kim, "Low Complexity LSD Scheme for Joint Iterative MIMO Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 11, pp. 1051-1059, 2013. DOI: .

[ACM Style]

Saleem Ahmed and Sooyoung Kim. 2013. Low Complexity LSD Scheme for Joint Iterative MIMO Detection. The Journal of Korean Institute of Communications and Information Sciences, 38, 11, (2013), 1051-1059. DOI: .

[KICS Style]

Saleem Ahmed and Sooyoung Kim, "Low Complexity LSD Scheme for Joint Iterative MIMO Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 11, pp. 1051-1059, 11. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880