Low computational complexity PTS scheme for PAPR reduction in OFDM system
|更新时间:2024-10-14
|
Low computational complexity PTS scheme for PAPR reduction in OFDM system
Vol. 30, Issue 10, Pages: 51-57(2009)
作者机构:
山东大学信息科学与工程学院
作者简介:
基金信息:
DOI:
CLC:TN919.3
Published:2009
稿件说明:
移动端阅览
WANG Ling-yin, CAO Ye-wen. Low computational complexity PTS scheme for PAPR reduction in OFDM system[J]. 2009, 30(10): 51-57.
DOI:
WANG Ling-yin, CAO Ye-wen. Low computational complexity PTS scheme for PAPR reduction in OFDM system[J]. 2009, 30(10): 51-57.DOI:
Low computational complexity PTS scheme for PAPR reduction in OFDM system
摘要
针对传统PTS方法计算复杂度大的缺点
提出了一种新的低计算复杂度PTS(LCC-PTS)方法。该方法利用相位加权序列之间的关系
简化了产生部分候选序列的运算过程
从而达到降低计算复杂度的目的。性能分析结果表明
与传统PTS方法相比
LCC-PTS方法在大大降低计算复杂度的同时
系统的PAPR性能完全没有损失。
Abstract
Concerning that the main drawback of conventional PTS was the large computational complexity
a new low computational complexity PTS (LCC-PTS) scheme was proposed. In LCC-PTS
the computation for candidate signals was simplified by making use of the relation between phase weighting sequences
which resulted in reducing computational complexity dramatically. Performance analysis show that
compared with conventional PTS
the proposed LCC-PTS scheme can be implemented with lower computational complexity while at no loss of PAPR(peak-to-average power radio) performance of the system.