Role of Cyclic Prefix in OFDM
The simple frequency-domain equalizer is possible only if the channel performs circular convolution. However, in practice, all wireless channels perform linear convolution.
This linear convolution is converted into circular convolution by adding a cyclic prefix (CP) in the OFDM architecture. The cyclic prefix makes the linear convolution imparted by the channel appear as circular convolution to the DFT process at the receiver.
Demonstration Concept
To demonstrate this, consider an OFDM signal s[n] of length 8 and a channel
impulse response h[n] of length 3. When s[n] is convolved with
h[n]:
- Linear convolution and circular convolution give different results.
- This mismatch causes interference in OFDM systems.
Adding Cyclic Prefix
A cyclic prefix is added by copying the last NCP samples of the OFDM
symbol and appending them to the beginning. If the cyclic prefix length is at
least equal to the channel delay spread, the following occurs:
- Inter-symbol interference is confined to the cyclic prefix.
- The useful received signal behaves as circular convolution.
Receiver Processing
At the receiver, the cyclic prefix samples are removed. The remaining samples correspond exactly to the circular convolution of the transmitted signal and the channel impulse response.
DFT Property
After removing the cyclic prefix, the received signal satisfies:
r[n] = IDFT { H[k] · S[k] }
This confirms that circular convolution in time domain corresponds to simple multiplication in the frequency domain.
Why OFDM needs circular convolution
In OFDM:
- Each OFDM symbol is processed using an N-point DFT
- DFT diagonalizes circular convolution, not linear convolution
So without CP:
DFT{x[n] * h[n]} ≠ X[k] H[k]
Subcarriers interfere → ICI + ISI
What the cyclic prefix actually does
The cyclic prefix:
- Copies the last L samples of the OFDM symbol
- Appends them to the front of the symbol
Original OFDM symbol: [x0 x1 x2 ... x(N−1)] After CP: [x(N−L) ... x(N−1) | x0 x1 ... x(N−1)]
Where L ≥ channel delay spread
Mathematical proof
Let:
- x[n] be an N-sample OFDM symbol
- CP length L ≥ Lh - 1
Then after CP removal:
y[n] = x[n] ⊛ h[n]
Taking DFT:
Y[k] = X[k] H[k]
Equalization becomes:
ฤคX[k] = Y[k] / H[k]
One complex multiplication per subcarrier
Practical example (LTE / Wi-Fi numbers)
- FFT size = 2048
- CP ≈ 4.7 ยตs
- Channel delay spread ≈ 1–3 ยตs
Because CP length > delay spread:
- No ISI
- No ICI
- Simple frequency-domain equalizer works
Without CP:
- Symbols overlap
- Subcarriers mix
- Equalizer becomes very complex
Physical interpretation
Think of CP as a guard interval in time, not frequency:
- Absorbs multipath echoes
- Makes each OFDM symbol appear periodic
- DFT “sees” a periodic extension → circular convolution
What happens if CP is too short?
If CP length < channel delay spread:
- Linear convolution leaks into FFT window
- Circularity breaks
- ISI + ICI appear
- Orthogonality is lost
Summary
By adding a cyclic prefix, OFDM systems convert linear channel convolution into circular convolution, enabling low-complexity frequency-domain equalization and eliminating inter-symbol interference.
Cyclic prefix converts linear convolution into circular convolution, so that the FFT sees a diagonal frequency response, allowing simple frequency-domain equalization.
The Trade-off: Spectral Efficiency vs. Robustness
While the Cyclic Prefix solves the problem of ISI, it comes at a cost: Bandwidth Overhead. Since the CP carries redundant data, it reduces the effective data rate.
The efficiency (ฮท) of an OFDM symbol is calculated as:
Efficiency (ฮท) = T_useful / (T_useful + T_CP)
- Longer CP: Better protection against large multipath delays (ideal for rural/large cells) but lower data rate.
- Shorter CP: Higher spectral efficiency but prone to interference in complex environments.
Cyclic Prefix in Modern Wireless Standards
| Standard | CP Type | Duration | Use Case |
|---|---|---|---|
| 4G LTE | Normal CP | 4.7 ยตs | Standard Urban Cells |
| 4G LTE | Extended CP | 16.7 ยตs | Large Cells / MBMS |
| 5G NR | Flexible CP | Scalable | Sub-6GHz & mmWave |
| Wi-Fi 6 | HE-GI | 0.8 - 3.2 ยตs | Outdoor Wi-Fi Networks |
Frequently Asked Questions (FAQ)
1. Why not just use a gap (Zero Padding) instead of CP?
While Zero Padding (ZP) prevents ISI, it does not create the circularity needed for the DFT. Without the Cyclic Prefix, you lose the ability to use a simple one-tap frequency domain equalizer.
2. Does CP prevent Inter-Carrier Interference (ICI)?
Yes. By maintaining the periodicity of the signal within the FFT window, CP ensures that subcarriers remain orthogonal, effectively eliminating ICI caused by multipath.
3. What is the difference between Guard Interval and Cyclic Prefix?
Guard Interval is the generic term for the space between symbols. Cyclic Prefix is a specific type of guard interval where the end of the symbol is copied to the beginning.
Further Reading
Interactive OFDM: The "CP" Effect
Compare how Cyclic Prefix converts linear convolution into circular convolution for perfect channel estimation.