减少OFDM中的PTS方案复杂性的新算法

A New Algorithm to Reduce the Complexity of PTS in OFDM

ＯＦＤＭ的一个主要缺点是信号的峰值功率与均值功率比（ＰＡＰＲ）很高，部分发送序列（ＰＴＳ）是一种能够大大降低 ＯＦＤＭ信号的 ＰＡＰＲ，同时保持信号无失真的方法，但是 ＰＴＳ实现起来很复杂，需要从大量信号序列中寻找 ＰＡＰＲ最小的序列。提出了一种新的算法，可以快速求出各个信号序列的峰值功率，从而能够快速找到ＰＡＰＲ最小的序列，降低了实现的复杂性。

One of major drawbacks of OFDM is on its large Peak-to-Average power ratio(PAPR) of transmitted signal, P1’S technique is one of solutions to reduce the PAPR without distorting the transmit-ted signal, but computational complexity is large for P1’S, the signal sequence which has the minimum PA-PR must be found from a number of signal sequences. In this paper, a new algorithm is proposed, which can compute the peak power of a signal sequence effectively, so the total complexity of P1’S is reduced.