# Can We Do Without a Cyclic Prefix

Have you ever thought that Cyclic Prefix in OFDM is just a gimmick and we could do equally well by using a guard period i.e. a period of no transmission between two OFDM symbols. Well, one way to find out if this is true is by running a bit error rate simulation with and without a cyclic prefix (only a vacant guard period). We use the 64-QAM OFDM simulation that we developed previously. The channel is modeled as 7-tap FIR filter with each tap having a Rayleigh distribution.

BER with and without Cyclic Prefix

We simulate the case of a vacant guard period by inserting zeros in the time slot dedicated for the CP (32 samples). It is observed that there is a vast difference in the bit error rate (BER) for the two cases. In fact in the case of no CP the BER hits an error floor at around 20 dB. Increasing the signal to noise ratio does not improve the BER performance any further.

Now to answer the question “why does the CP work” we have to revisit the concept of circular convolution from our DSP course. It is well known that performing circular convolution of two sequences in the time domain is equivalent to multiplication of their DFT’s in the frequency domain. So if a wireless channel performed circular convolution we could do simple division to recover the signal after the FFT operation in the receiver.

Y(k)=X(k)*H(k) Effect of Wireless Channel

X(k)=Y(k)/H(k) Recovery of the Signal

But the wireless channel does not perform circular convolution, it performs linear convolution. So the trick is to make this linear convolution appear as circular convolution by appending a cyclic prefix. The result is that equalization can be performed at the receiver by simple division.

For a more elaborate discussion on this you may visit CP-1 or for a mathematical description you may visit CP-2.

Note: In a actual system there would be AWGN noise added to the received signal as well. Giving us the following relationships.

Y(k)=X(k)*H(k)+W(k) Effect of Wireless Channel

X(k)’=Y(k)/H(k)=X(k)+W(k)/H(k) Recovery of the Signal

#### Author: John (YA)

John has over 15 years of Research and Development experience in the field of Wireless Communications. He has worked for a number of companies around the world including Qualcomm Inc. USA. He has an MS in Electrical Engineering from Virginia Tech USA and has published his work in international journals and conferences.

0.00 avg. rating (0% score) - 0 votes

## 5 thoughts on “Can We Do Without a Cyclic Prefix”

1. Gert says:

It is also possible to ‘mimic’ a circular convolution by taking doing a “prefix-like” operation at the receiver side. Take the received samples corresponding to the guard period -containing some information about the end of the signal- and add these to the samples corresponding to the beginning of the symbol. In the absence of noise, the results are identical. Also inthe presence of noise, the performance would not be very different. Maybe doing this step at the receiver would make for a fairer comparison.
Kudos for these nonetheless very informative pages!

1. Gert,

This is a very innovative idea…would look into this further. Thanks for sharing!

John

2. John says:

Peter,
Yes you can simulate different CP lengths. My simulation actually penalizes you for the longer CP since you are transmitting more energy per “useful bit”. So you may see a degradation in performance. But also remember that I am using a 7-tap FIR filter to model the channel. A longer CP would become really useful when the channel length is longer.
Hope this helps…

John

3. Peter says:

Hello.

From your code, is it possible to simulate the result with different CP length ?
The results shows that when increasing the CP length, the BER performance actually degrades.
Is it correct?

Thank you very much.