首页 | 官方网站   微博 | 高级检索  
     

基于迭代的部分传输序列备选信号相关性降低峰均功率比算法
引用本文:胡敏,郭亚南,甘俊娜.基于迭代的部分传输序列备选信号相关性降低峰均功率比算法[J].计算机应用,2011,31(12):3223-3225.
作者姓名:胡敏  郭亚南  甘俊娜
作者单位:重庆邮电大学 软件技术中心,重庆 400065
基金项目:重庆市教委科技计划项目
摘    要:部分传输序列(PTS)算法能够有效降低正交频分复用(OFDM)系统中高峰均功率比(PAPR)问题,并且不会引入失真,但PTS算法具有较高的复杂度。针对该问题,提出一种称为相关循环迭代的PTS(CC-IPTS)新算法。该算法利用迭代PTS在搜索最优相位因子时相邻相位因子间的关系以及迭代PTS(IPTS)中备选信号间相关性的特点,进行循环迭代。仿真结果表明,所提算法不但取得了较低的算法复杂度,还有效降低了峰均功率比。

关 键 词:正交频分复用    峰均比    相关性    部分传说序列    循环迭代
收稿时间:2011-06-07
修稿时间:2011-08-01

Peak-to-average power ratio reduction algorithm based on correlation between candidates of iteration partial transmitted sequence
HU Min,GUO Ya-nan,GAN Jun-na.Peak-to-average power ratio reduction algorithm based on correlation between candidates of iteration partial transmitted sequence[J].journal of Computer Applications,2011,31(12):3223-3225.
Authors:HU Min  GUO Ya-nan  GAN Jun-na
Affiliation:Center of Software Technology, Chongqing University of Posts and Telecommunications,Chongqing 400065,China
Abstract:The Partial Transmitted Sequence (PTS) is an efficient algorithm to solve the problem of high Peak-to-Average Power Ratio (PAPR) in Orthogonal Frequency Division Multiplexing (OFDM),but the basic algorithm of PTS has higher computational complexity. A new algorithm based on Cyclic Iteration PTS (C-IPTS) which is called Correlational Cyclic Iteration PTS(CC-IPTS) was proposed to solve this problem. The proposed algorithm reduced computational complexity by using the relation between adjacent phase factors in Iteration PTS (IPTS), and the correlation of two candidate signals in PTS and cyclic iteration. The simulation shows that CC IPTS can not only improve the PAPR performance,but also reduce computational complexity.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号