A Low Complexity Candidate List Generation for MIMO Iterative Receiver via Hierarchically Modulated Property 


Vol. 34,  No. 6, pp. 500-505, Jun.  2009


PDF
  Abstract

In this paper, We present a low complexity candidate list generation scheme in iterative MIMO receiver. Since QAM modulation can be decomposed into HP symbols and LP symbol and HP symbol is robust in error capability, we generate HP symbol list with simple ZF detector output and its corresponding neighbor HP symbols. Then, based on HP symbol list, the LP symbol list is generated by using the sphere decoder. From the second iteration, since apriori value from channel decoder is available, the candidate list is updated based on demodulated apriori value. Through the simulation, we observe that at the first iteration, the BER performance is worse than LSD. However, as the number of iteration is increased, the proposed scheme has almost same performance as LSD. Moreover, the proposed one has reduced candidate list generation time and lower number of candidate list compared with LSD.

  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]

E. S. Jeon, J. H. Yang, D. K. Kim, "A Low Complexity Candidate List Generation for MIMO Iterative Receiver via Hierarchically Modulated Property," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 500-505, 2009. DOI: .

[ACM Style]

Eun Sung Jeon, Jang Hoon Yang, and Dong Ku Kim. 2009. A Low Complexity Candidate List Generation for MIMO Iterative Receiver via Hierarchically Modulated Property. The Journal of Korean Institute of Communications and Information Sciences, 34, 6, (2009), 500-505. DOI: .

[KICS Style]

Eun Sung Jeon, Jang Hoon Yang, Dong Ku Kim, "A Low Complexity Candidate List Generation for MIMO Iterative Receiver via Hierarchically Modulated Property," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 500-505, 6. 2009.