Receivers for Spatially Multiplexed Space-Time Block Coded Systems: Reduced Complexity 


Vol. 29,  No. 11, pp. 1244-1252, Nov.  2004


PDF
  Abstract

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properties, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identifthat sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

  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]

H. C. Hwang, S. H. Shin, C. J. Lee, K. S. Kwak, "Receivers for Spatially Multiplexed Space-Time Block Coded Systems: Reduced Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 11, pp. 1244-1252, 2004. DOI: .

[ACM Style]

Hyeon Chyeol Hwang, Seung Hoon Shin, Cheol Jin Lee, and Kyung Sup Kwak. 2004. Receivers for Spatially Multiplexed Space-Time Block Coded Systems: Reduced Complexity. The Journal of Korean Institute of Communications and Information Sciences, 29, 11, (2004), 1244-1252. DOI: .

[KICS Style]

Hyeon Chyeol Hwang, Seung Hoon Shin, Cheol Jin Lee, Kyung Sup Kwak, "Receivers for Spatially Multiplexed Space-Time Block Coded Systems: Reduced Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 11, pp. 1244-1252, 11. 2004.