Conventional symbol time (ST) synchronization algorithms for orthogonal frequency-division multiplexing (OFDM) systems are mostly based on the maximum correlation result of the cyclic prefix. Due to the channel effect, the estimated ST is not accurate enough. Hence, one needs to further identify the channel impulse response (CIR) so as to obtain a better ST estimation. Overall, the required computational complexity is high because it involves time-domain (TD) correlation operations, as well as the fast Fourier transform (FFT) and inverse FFT (IFFT) operations. In this work, without the FFT/IFFT operations and the knowledge of CIR, a low-complexity TD ST estimation is proposed. We first characterize the frequency-domain (FD) interference effect. Based on the derivation, the new method locates the symbol boundary at the sampling point with the minimum interference in the FD (instead of the conventional maximum TD correlation result). Moreover, to reduce the computational complexity, the proposed FD minimum-interference (MI) metric is converted to a low-complexity TD metric by utilizing Parseval's theorem and the sampling theory. Simulation results exhibit good performance for the proposed algorithm in multipath fading channels.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Wen-Long CHIN, Sau-Gee CHEN, "A Low-Complexity Minimum-Interference Symbol Time Estimation for OFDM Systems" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 5, pp. 1828-1833, May 2009, doi: 10.1587/transcom.E92.B.1828.
Abstract: Conventional symbol time (ST) synchronization algorithms for orthogonal frequency-division multiplexing (OFDM) systems are mostly based on the maximum correlation result of the cyclic prefix. Due to the channel effect, the estimated ST is not accurate enough. Hence, one needs to further identify the channel impulse response (CIR) so as to obtain a better ST estimation. Overall, the required computational complexity is high because it involves time-domain (TD) correlation operations, as well as the fast Fourier transform (FFT) and inverse FFT (IFFT) operations. In this work, without the FFT/IFFT operations and the knowledge of CIR, a low-complexity TD ST estimation is proposed. We first characterize the frequency-domain (FD) interference effect. Based on the derivation, the new method locates the symbol boundary at the sampling point with the minimum interference in the FD (instead of the conventional maximum TD correlation result). Moreover, to reduce the computational complexity, the proposed FD minimum-interference (MI) metric is converted to a low-complexity TD metric by utilizing Parseval's theorem and the sampling theory. Simulation results exhibit good performance for the proposed algorithm in multipath fading channels.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.1828/_p
Copy
@ARTICLE{e92-b_5_1828,
author={Wen-Long CHIN, Sau-Gee CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={A Low-Complexity Minimum-Interference Symbol Time Estimation for OFDM Systems},
year={2009},
volume={E92-B},
number={5},
pages={1828-1833},
abstract={Conventional symbol time (ST) synchronization algorithms for orthogonal frequency-division multiplexing (OFDM) systems are mostly based on the maximum correlation result of the cyclic prefix. Due to the channel effect, the estimated ST is not accurate enough. Hence, one needs to further identify the channel impulse response (CIR) so as to obtain a better ST estimation. Overall, the required computational complexity is high because it involves time-domain (TD) correlation operations, as well as the fast Fourier transform (FFT) and inverse FFT (IFFT) operations. In this work, without the FFT/IFFT operations and the knowledge of CIR, a low-complexity TD ST estimation is proposed. We first characterize the frequency-domain (FD) interference effect. Based on the derivation, the new method locates the symbol boundary at the sampling point with the minimum interference in the FD (instead of the conventional maximum TD correlation result). Moreover, to reduce the computational complexity, the proposed FD minimum-interference (MI) metric is converted to a low-complexity TD metric by utilizing Parseval's theorem and the sampling theory. Simulation results exhibit good performance for the proposed algorithm in multipath fading channels.},
keywords={},
doi={10.1587/transcom.E92.B.1828},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - A Low-Complexity Minimum-Interference Symbol Time Estimation for OFDM Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 1828
EP - 1833
AU - Wen-Long CHIN
AU - Sau-Gee CHEN
PY - 2009
DO - 10.1587/transcom.E92.B.1828
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2009
AB - Conventional symbol time (ST) synchronization algorithms for orthogonal frequency-division multiplexing (OFDM) systems are mostly based on the maximum correlation result of the cyclic prefix. Due to the channel effect, the estimated ST is not accurate enough. Hence, one needs to further identify the channel impulse response (CIR) so as to obtain a better ST estimation. Overall, the required computational complexity is high because it involves time-domain (TD) correlation operations, as well as the fast Fourier transform (FFT) and inverse FFT (IFFT) operations. In this work, without the FFT/IFFT operations and the knowledge of CIR, a low-complexity TD ST estimation is proposed. We first characterize the frequency-domain (FD) interference effect. Based on the derivation, the new method locates the symbol boundary at the sampling point with the minimum interference in the FD (instead of the conventional maximum TD correlation result). Moreover, to reduce the computational complexity, the proposed FD minimum-interference (MI) metric is converted to a low-complexity TD metric by utilizing Parseval's theorem and the sampling theory. Simulation results exhibit good performance for the proposed algorithm in multipath fading channels.
ER -