Residual ISI cancellation and EM-based channel estimation for STBC/SFBC OFDM with insufficient cyclic prefix 


Vol. 32,  No. 11, pp. 1154-1163, Nov.  2007


PDF
  Abstract

For orthogonal frequency division multiplexing (OFDM), cyclic prefix (CP) should be longer than the length of channel impulse response. In order to prevent a loss of bandwidth efficiency due to the use of a CP, residual intersymbol interference cancellation (RISIC) method has recently been developed. In this paper, we first apply the RISIC algorithm to the space-time block coded (STBC) OFDM and the space-frequency block coded (SFBC) OFDM with insufficient CP. It is shown that in the STBC OFDM, tail cancellation as well as cyclic restoration of the RISIC should be repeated. Second, we propose iterative channel estimation method for the RISIC in the STBC OFDM system with insufficient CP. Based on the expectation-maximization (EM) algorithm, the proposed estimation method exploits the extrinsic probabilities of the channel decoder iteratively. The performance of the proposed method is evaluated by computer simulation in a multipath fading environment.

  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. Won, "Residual ISI cancellation and EM-based channel estimation for STBC/SFBC OFDM with insufficient cyclic prefix," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 11, pp. 1154-1163, 2007. DOI: .

[ACM Style]

Hui-Chul Won. 2007. Residual ISI cancellation and EM-based channel estimation for STBC/SFBC OFDM with insufficient cyclic prefix. The Journal of Korean Institute of Communications and Information Sciences, 32, 11, (2007), 1154-1163. DOI: .

[KICS Style]

Hui-Chul Won, "Residual ISI cancellation and EM-based channel estimation for STBC/SFBC OFDM with insufficient cyclic prefix," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 11, pp. 1154-1163, 11. 2007.