| Paper: | SPCOM-P3.4 | ||
| Session: | OFDM: PA & PAPR Issues | ||
| Time: | Tuesday, May 16, 14:00 - 16:00 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communication: Multi-carrier, OFDM, and DMT communication | ||
| Title: | A Low Complexity Tree Algorithm for PTS-Based PAPR Reduction in Wireless OFDM | ||
| Authors: | Byung Moo Lee, Rui de Figueiredo, University of California, Irvine, United States | ||
| Abstract: | Orthogonal Frequency Division Multiplexing (OFDM) has several attributes which make it a preferred modulation scheme for high speed wireless communications. However, its high Peak-to-Average-Power Ratio (PAPR) causes nonlinear distortion thus limiting the efficiency of the transmitter's High Power Amplifier. Among the approaches proposed for PAPR mitigation, the Partial Transmit Sequence (PTS) technique is very promising since it does not generate any signal distortion. However, its high complexity makes it difficult for use in high speed communication systems. We present a new low-complexity tree algorithm to implement the PTS approach, which seeks the best trade-off between performance and complexity. Simulation results show that this new technique's performance is similar to that of the optimum case, however with significantly lower complexity. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012