【摘要】 针对传统PTS方法计算复杂度高的缺点,提出一种低计算复杂度PTS(LCC-PTS)方法。将2n点信号的快速傅里叶逆变换(IFFT)分成2个部分,输入信号序列通过前l个IFFT产生中间信号序列,把中间信号序列分成若干中间子序列,将剩下的n l个IFFT应用于每个中间子序列,分别对每个中间子序列进行相位加权,得到经相位加权后的中间子序列,再将各个子块序列求和,选择峰均功率比(PAPR)最小的加权序列用来传输。性能分析结果表明,该方法能降低计算复杂度,且系统的PAPR性能基本保持不变。更多还原

【Abstract】 Concerning that the main drawback of Partial Transmit Sequence(PTS) is the large computational complexity,a new computational complexity PTS(LCC-PTS) scheme is proposed.2n-point Inverse Fast Fourier transform(IFFT) is divided into two parts.An input symbol sequence is partially transformed using the first l stages of IFFT to generate an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences.The remaining n l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by rotating vector.The one with the lowest Peak-to-Average Power Ratio(PAPR) among these Orthogonal Frequency Division Multiplexing(OFDM) signal sequences is selected for transmission.Performance analysis shows that the proposed LCC-PTS scheme can be implemented with lower computational complexity while approximately keeping the PAPR performance of the system.更多还原