Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems 


Vol. 34,  No. 4, pp. 460-468, Apr.  2009


PDF
  Abstract

Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.

  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, H. An, K. Chang, "Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 4, pp. 460-468, 2009. DOI: .

[ACM Style]

Manar Mohaisen, HongSun An, and KyungHi Chang. 2009. Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems. The Journal of Korean Institute of Communications and Information Sciences, 34, 4, (2009), 460-468. DOI: .

[KICS Style]

Manar Mohaisen, HongSun An, KyungHi Chang, "Reduced Complexity QRD-M Algorithm for Spatial Multiplexing MIMO-OFDM Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 4, pp. 460-468, 4. 2009.