A Novel PTS with Low Complexity

Acta Scientiarum Naturalium Universitatis Pekinensis

Previous Articles Next Articles

A Novel PTS with Low Complexity

JIAO Yuzhong¹, WANG Xin’an^1，2, NI Xuewen², XU Ying¹, LIU Xuejiao¹

1. Key Lab of Integrated MicrosystemScience and Engineering Applications, Shenzhen Graduate School of Peking University, Shenzhen 518055; 2. Department of Microelectronics, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871;

Received:2009-01-15 Online:2009-11-20 Published:2009-11-20

一种低复杂度的PTS优化方法

焦玉中¹,王新安^1,2,倪学文²,许应¹,刘雪娇¹

1. 北京大学深圳研究生院集成微系统科学工程与应用重点实验室, 深圳518055; 2. 科学技术学院微电子学系, 北京100871;

Abstract

Abstract: The authors present a new scheme to optimize PTS (partial transmit sequence technique) in the aspect of complexity. The new method searches for proper partial transmit sequence and phase factor to reduce the peak of OFDM sequence in each iterative process, thus get an OFDMsequence with low PAPR. Due to its fast convergence, it has low complexity. Simulation result shows that the new PTS has not only lower complexity but also better PAPRreduction performance, which is over 0.28 dB more than iterative PTSin V≥16 when CCDF (complementary cumulative distribution function) is 10 - 4.

Key words: OFDM, PTS, PAPRreduction, complexity

摘要： 提出一种新的优化策略, 即在迭代处理过程中根据正交频分复用序列峰值点样值的幅度削减效果来选择合适的部分传输序列并确定其相位旋转因子。该PTS方法(部分传输序列法)具有较高的算法收敛速率, 因此复杂度非常低。仿真结果显示, 与迭代PTS 方法相比, 在V≥16时, 新的PTS方法具有更低的算法复杂度, 同时PAPR 抑制性能在互补累积分布函数(CCDF)为10 -4时提高超过0.28dB。

关键词: 正交频分复用, 部分传输序列, PAPR抑制, 复杂度

CLC Number:

TN919

JIAO Yuzhong,WANG Xin’an,NI Xuewen,XU Ying,LIU Xuejiao. A Novel PTS with Low Complexity[J]. Acta Scientiarum Naturalium Universitatis Pekinensis.

焦玉中,王新安,倪学文,许应,刘雪娇. 一种低复杂度的PTS优化方法[J]. 北京大学学报（自然科学版）.

[1]	WANG Jing, GE Zengxi. Study on Rupture Spatial Complexity of Global Large Earthquakes [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2022, 58(4): 635-643.
[2]	WANG Huilan. Construction of Chinese Sentence-Category Dependency Treebank [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2013, 49(1): 25-30.
[3]	LI Shangyao,LIU Zhimin. A Half Distributed Resource Allocation Strategy for Multi-Cell OFDM System Downlink Channel [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2012, 48(4): 553-558.
[4]	GUO Junqi,SHANG Yong,REN Shubo,XIANG Haige. STBC-OFDMA Uplink Transmission Based on Combination of User Grouping and Frequency Reuse [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2010, 46(6): 882-892.
[5]	TAN Lin,QI Wenfeng. Element Distribution of Decimations and k-Error Linear Complxity of l-Sequences [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2010, 46(5): 715-719.
[6]	SHEN Jun,WU Bo,YI Na,JIANG Wei,XIANG Haige. A Greedy-Based Resource Allocation Algorithm for Multicast and Unicast Services in OFDM System [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2010, 46(2): 171-177.
[7]	REN Shubo,GUO Junqi,WU Jianjun,XIANG Haige. A PN-Based Carrier Frequency Offset Estimation Algorithmfor Multiuser OFDM Uplink [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2009, 45(6): 983-988.
[8]	MA Meng,YANG Yuli,JIAO Bingli. The Optimum Symbol Length Design for Wireless OFDM over Fast Fading Channels [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2006, 42(5): 658-661.
[9]	XUE Jinyin,JIAO Bingli. An Improved Bit and Power Allocation Algorithm for OFDM Systems [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2006, 42(1): 93-98.
[10]	LI Zhendong,SHI Shuangning,LIANG Qinglin. The Adaptive Algorithm Based on Minimum Average BER Criterion in OFDM System [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2005, 41(5): 780-785.
[11]	CHEN Yanguang,HOU Yixing. Modeling Self-Organized Network of Cities Based on the Urban Triangular Lattice Model [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2005, 41(2): 258-264.
[12]	LI Zhendong,PAN Shenfu,SHI Haiyang,LIANG Qinglin. Multi-Antenna Adaptive OFDM System [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2004, 40(5): 840-843.
[13]	LIU Tian. On Checking Complexity, Evaluating Complexity and Number of Values for Functions [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2000, 36(1): 109-116.
[14]	WANG Zhangxiong. The Construction of a Class of Bent Sequences [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 1999, 35(3): 311-316.
[15]	HUANG Xiong. The Approximability of NP Optimization Problems [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 1995, 31(5): 556-562.

A Novel PTS with Low Complexity

一种低复杂度的PTS优化方法

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics