Fixed-complexity Sphere Encoder for Multi-user MIMO Systems 


Vol. 35,  No. 7, pp. 632-638, Jul.  2010


PDF
  Abstract

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The Proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4x4 MU-MIMO system, the complexity of the proposed FSE is 16% that of the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed endoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

  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]

M. Mohaisen, D. Han, K. Chang, "Fixed-complexity Sphere Encoder for Multi-user MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 632-638, 2010. DOI: .

[ACM Style]

Manar Mohaisen, DongKeol Han, and KyungHi Chang. 2010. Fixed-complexity Sphere Encoder for Multi-user MIMO Systems. The Journal of Korean Institute of Communications and Information Sciences, 35, 7, (2010), 632-638. DOI: .

[KICS Style]

Manar Mohaisen, DongKeol Han, KyungHi Chang, "Fixed-complexity Sphere Encoder for Multi-user MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 632-638, 7. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880