Wireless LAN White Papers
Comparison of Low Complexity Clipping Algorithms for OFDM
Overview This paper explores low complexity clipping of an Orthogonal Frequency Division Multiplexing (OFDM) transmit signal for critically sampled or oversampled complex data as a solution for the Peak to Average Power Reduction (PAPR) problem. Four existing clipping algorithms are compared to two new low complexity algorithms in an OFDM environment. Their performance is examined through mathematical analysis and simulation to find the effect of clipping on the Signal to Noise Ratio (SNR). The complexity of each algorithm is compared in terms of hardware operations. One solution is a variation of a recent Lucent patent called vector subtraction that avoids the division in the scaling operation for a minor reduction in the SNR (<0.5dB for 3 iterations).
| Publisher | Victoria University | File Format | |
|---|---|---|---|
| Date Published | June 2002 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
