Efficient Detection of Space-Time Block Codes Based on Parallel Detection 


Vol. 36,  No. 2, pp. 100-107, Feb.  2011


PDF Full-Text
  Abstract

Algorithms based on the QR decomposition of the equivalent space-time channel matrix have been proved useful in the detection of V-BLAST systems. Especially, the parallel detection (PD) algorithm offers ML approaching performance up to 4 transmit antennas with reasonable complexity. We show that when directly applied to STBCs, the PD algorithm may suffer a rather significant SNR degradation over ML detection, especially at high SNRs. However, simply extending the PD algorithm to allow p ≥2 candidate layers, i.e. p -PD, regains almost all the loss but only at a significant increase in complexity. Here, we propose a simplification to the p-PD algorithm specific to STBCs without a corresponding sacrifice in performance. The proposed algorithm results in significant complexity reductions for moderate to high order modulations.

  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]

J. Kim and K. Cheun, "Efficient Detection of Space-Time Block Codes Based on Parallel Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 2, pp. 100-107, 2011. DOI: .

[ACM Style]

Jeongchang Kim and Kyungwhoon Cheun. 2011. Efficient Detection of Space-Time Block Codes Based on Parallel Detection. The Journal of Korean Institute of Communications and Information Sciences, 36, 2, (2011), 100-107. DOI: .

[KICS Style]

Jeongchang Kim and Kyungwhoon Cheun, "Efficient Detection of Space-Time Block Codes Based on Parallel Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 2, pp. 100-107, 2. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880