应用科学学报 ›› 2013, Vol. 31 ›› Issue (3): 271-277.doi: 10.3969/j.issn.0255-8297.2013.03.009

• 信号与信息处理 • 上一篇    下一篇

对称双二叉树PTS相位搜索

何选森, 曾庆芳, 吴良敏   

  1. 湖南大学信息科学与工程学院,长沙410082
  • 收稿日期:2011-10-04 修回日期:2011-11-16 出版日期:2013-05-28 发布日期:2011-11-16
  • 通信作者: 何选森,副教授,研究方向:信号处理,E-mail: hxs2010@hnu.edu.cn,hxshf@vip.sina.com
  • 作者简介:何选森,副教授,研究方向:信号处理,E-mail: hxs2010@hnu.edu.cn,hxshf@vip.sina.com
  • 基金资助:

    国家自然科学基金(No. 61072122)资助

PTS Phase Search with Symmetrical Dual Binary Tree

HE Xuan-sen, ZENG Qing-fang, WU Liang-min   

  1. College of Information Science and Engineering, Hunan University, Changsha 410082, China
  • Received:2011-10-04 Revised:2011-11-16 Online:2013-05-28 Published:2011-11-16

摘要: 为降低OFDM系统中部分传输序列的计算复杂度,提出一种对称双二叉树的相位搜索方法,将最优相位因子的搜索映射为满二叉树中代价最小通路的搜索. 通过选择中间节点数量与二叉树的搜索深度,在有效抑制OFDM峰值平均功率比的同时大幅度降低了计算复杂度. 仿真结果表明,该方法能很好地协调OFDM系统性
能和计算复杂度.

关键词: 正交频分复用, 部分传输序列, 峰值平均功率比, 对称双二叉树

Abstract: To reduce computation complexity of the partial transmit sequence (PTS) for OFDM systems, a symmetrical dual binary tree search method is proposed, in which the search of the optimum phase factor is mapped to the search of a minimum cost path of a full binary tree. By selecting the number of intermediate
nodes and the search depth, the proposed method effectively reduce both peak-to-average power ratio (PAPR) and the computation complexity of PTS. Simulation results show that the method can make a good tradeoff between the computation complexity and the OFDM performance.

Key words:  orthogonal frequency division multiplexing (OFDM), partial transmit sequence (PTS), peak-toaverage power ratio (PAPR), symmetrical dual binary tree

中图分类号: