| 对称双二叉树PTS相位搜索 |
| |
| 引用本文： | 何选森,曾庆芳,吴良敏.对称双二叉树PTS相位搜索[J].应用科学学报,2013,31(3):271-277. |
| |
| 作者姓名： | 何选森 曾庆芳 吴良敏 |
| |
| 作者单位： | 湖南大学信息科学与工程学院，长沙410082 |
| |
| 基金项目： | 国家自然科学基金(No. 61072122)资助 |
| |
| 摘 要： | 为降低OFDM系统中部分传输序列的计算复杂度，提出一种对称双二叉树的相位搜索方法，将最优相位因子的搜索映射为满二叉树中代价最小通路的搜索. 通过选择中间节点数量与二叉树的搜索深度，在有效抑制OFDM峰值平均功率比的同时大幅度降低了计算复杂度. 仿真结果表明，该方法能很好地协调OFDM系统性
能和计算复杂度.
|
| 关 键 词： | 正交频分复用 部分传输序列 峰值平均功率比 对称双二叉树 |
| 收稿时间： | 2011-10-04 |
| 修稿时间： | 2011-11-16 |
PTS Phase Search with Symmetrical Dual Binary Tree |
| |
| HE Xuan-sen,ZENG Qing-fang,WU Liang-min.PTS Phase Search with Symmetrical Dual Binary Tree[J].Journal of Applied Sciences,2013,31(3):271-277. |
| |
| Authors: | HE Xuan-sen ZENG Qing-fang WU Liang-min |
| |
| Institution: | College of Information Science and Engineering, Hunan University, Changsha 410082, China |
| |
| 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. |
| |
| Keywords: | orthogonal frequency division multiplexing (OFDM) partial transmit sequence (PTS) peak-toaverage power ratio (PAPR) symmetrical dual binary tree |
|
| 点击此处可从《应用科学学报》浏览原始摘要信息 |
| 点击此处可从《应用科学学报》下载免费的PDF全文 |
