Efficient Symbol Detection Algorithm for Space-Frequency OFDM Transmit Diversity Scheme 


Vol. 30,  No. 4, pp. 283-289, Apr.  2005


PDF
  Abstract

In this paper, we propose two efficient symbol detection algorithms for space-frequency OFDM (SF-OFDM) transmit diversity scheme. When the number of sub-carriers in SF-OFDM scheme is small, the interference between adjacent sub-carriers may be generated. The proposed algorithms eliminate this interference in a parallel or sequential manner and achieve a considerable performance improvement over the conventional detection algorithm. The bit error rate (BER) performance of the proposed detection algorithms is evaluated by the simulation. In the case of 2 transmit and 2 receive antennas, at BER=10-4 the proposed algorithms achieve the gain improvement of about 3 dB. The symbol detectors with the proposed algorithms are designed in a hardware description language and synthesized to gate-level circuits with the 0.18um 1.8V CMOS standard cell library. With the division-free architecture, the proposed SF-OFDM-PIC and SF-OFDM-SIC symbol detectors can be implemented using 140K and 129K logic gates, respectively.

  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]

Y. h. Jung and J. s. Kim, "Efficient Symbol Detection Algorithm for Space-Frequency OFDM Transmit Diversity Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 283-289, 2005. DOI: .

[ACM Style]

Yun ho Jung and Jae seok Kim. 2005. Efficient Symbol Detection Algorithm for Space-Frequency OFDM Transmit Diversity Scheme. The Journal of Korean Institute of Communications and Information Sciences, 30, 4, (2005), 283-289. DOI: .

[KICS Style]

Yun ho Jung and Jae seok Kim, "Efficient Symbol Detection Algorithm for Space-Frequency OFDM Transmit Diversity Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 283-289, 4. 2005.