Reduced complexity equalization schemes for zero padded OFDM systems

Three reduced complexity equalization schemes for Zero-padded OFDM systems are described. These schemes guarantee Zero-Forcing (ZF) equalization irrespective of the channel nulls. Two of these schemes implement the minimum-norm ZF equalizer efficiently using QR decomposition. In the third scheme, the channel zeros are grouped as being inside or outside or on the unit circle. These groups are then equalized sequentially in a manner so as to tackle excess noise amplification. The three schemes are compared for their computational complexity and Bit Error Rate (BER) performance. It is shown that the attractive scheme depends on the system specifications. The BERComputations trade off occurring in the choice of the right algorithm is also highlighted.