Abstract: Frame and frequency synchronization are essential for orthogonal frequency division multiplexing (OFDM) systems. The frame offset owing to incorrect start point position of the fast Fourier transform (FFT) window, and the carrier frequency offset (CFO) due to Doppler frequency shift or the frequency mismatch between the transmitter and receiver oscillators, can bring severe intersymbol interference (ISI) and inter-carrier interference (ICI) for the OFDM system. Relying on the relatively good correlation characteristic of the pseudo-noise (PN) sequence, a joint frame offset and normalized CFO estimation algorithm based on PN preamble in time domain is developed to realize the frame and frequency synchronization in the OFDM system. By comparison, the performances of the traditional algorithm and the improved algorithm are simulated under different conditions. The results indicate that the PN preamble based algorithm both in frame offset estimation and CFO estimation is more accurate, resource-saving and robust even under poor channel condition, such as low signal-to-noise ratio (SNR) and large normalized CFO.
Introduction
Orthogonal Frequency Division Multiplexing (OFDM) is a cornerstone of modern wireless communication, powering technologies like Wi-Fi, LTE, and WiMAX. However, its performance is highly sensitive to synchronization errors. Specifically, Frame Offset leads to incorrect Fast Fourier Transform (FFT) windowing and Intersymbol Interference (ISI), while Carrier Frequency Offset (CFO) destroys subcarrier orthogonality, causing Inter-carrier Interference (ICI).
Traditional synchronization methods often rely on the Cyclic Prefix (CP). While convenient, CP-based methods struggle in low Signal-to-Noise Ratio (SNR) environments or when frequency offsets are large. This paper proposes a joint algorithm using a Pseudo-Noise (PN) sequence preamble to provide robust synchronization with minimal overhead.
Methodology
The proposed system integrates a PN preamble into the time-domain signal before the OFDM symbols. PN sequences are deterministic binary sequences with mathematical properties resembling noise, most notably a very sharp auto-correlation peak.
As shown in the system model above, the receiver performs joint synchronization:
- Frame Synchronization: The receiver slides a window across the incoming signal and calculates the correlation with the known PN sequence. The exact start of the frame is identified by the maximum correlation peak.
- Frequency Synchronization: The algorithm splits the PN preamble into two halves. By comparing the phase difference between these halves, the system estimates the normalized CFO.
This joint approach is highly efficient, performing both critical tasks using a single short preamble, which saves bandwidth compared to traditional methods that might require multiple full OFDM symbols.
Key Results and Discussion
Numerical simulations modeled after mobile WiMAX standards ($N_{FFT}=128$, QPSK/16QAM) were conducted to evaluate performance against traditional algorithms like Maximum Likelihood Estimation (MLE) and the "Difference" algorithm.
As illustrated in Figure 4, the PN preamble method maintains a near-zero error rate for frame synchronization across all tested SNR levels (0 to 20 dB). Crucially, it remains accurate even when a significant frequency offset ($\epsilon = 0.5$) is present, whereas the traditional Difference algorithm fails completely in such scenarios.
Furthermore, the PN-based method is remarkably resource-efficient. It achieves superior accuracy with a sequence length as short as $0.25 N_{FFT}$, significantly reducing the communication overhead compared to CP-based or Moose algorithms.
Conclusion
The PN preamble-based joint algorithm offers a robust, accurate, and resource-saving solution for OFDM synchronization. Its immunity to large frequency offsets and high performance in low-SNR environments make it a superior alternative to traditional CP-based methods. Future research will focus on validating these results in complex multi-path fading environments and exploring hardware implementation efficiencies on FPGAs.
Summary updated