A performance and complexity comparison of auto-correlation and cross-correlation for OFDM burst synchronization

A symbol timing synchronization scheme is critical in the design of an OFDM receiver. Large timing errors can result in a loss of orthogonality between subcarriers, ISI and severe bit error degradation. To minimize this degradation, standards incorporate preambles suitable for two kinds of synchroni...

Full description

Saved in:
Bibliographic Details
Published in2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03) Vol. 2; pp. II - 341
Main Authors Fort, A., Weijers, J.-W., Derudder, V., Eberle, W., Bourdoux, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A symbol timing synchronization scheme is critical in the design of an OFDM receiver. Large timing errors can result in a loss of orthogonality between subcarriers, ISI and severe bit error degradation. To minimize this degradation, standards incorporate preambles suitable for two kinds of synchronization algorithms: auto-correlation and crosscorrelation. Unfortunately, the performance and complexity tradeoffs between these algorithms have not been well explored. To address this problem, we have built an FPGA implementation of a synchronization system using both autocorrelation and cross-correlation. Based on our results, in this paper we propose a novel cross-correlation synchronizer and hardware architecture. We then compare its performance and complexity to auto-correlation algorithms for HiperLAN/2 and IEEE 802.11a preambles.
ISBN:9780780376632
0780376633
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.2003.1202364