检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张慧[1] 颜彪[1] 刘敏[1] 杨娜[1] 杨银霞[1]
出 处:《电讯技术》2008年第10期27-30,共4页Telecommunication Engineering
基 金:江苏省高校自然科学基础研究项目(07KJD510247)
摘 要:天线旋转取反算法(CARI)是降低MIMO-OFDM系统峰平功率比(PAPR)的一种性能较优的算法,不足之处是其迭代次数很大。CARI的次最优算法逐次次最优天线旋转取反(SS-CARI)算法虽然可以减小迭代次数,但性能损失又比较大。针对这一问题,提出了一种用滑动窗搜索旋转取反组合的次最优CARI方法,利用滑动窗搜索局部最优的旋转取反组合,既可以避免整体的遍历搜索大大减小CARI算法的计算复杂度,又可以改善SS-CARI的PAPR减小性能。仿真结果表明,该方法能够在系统复杂度与PAPR降低性能上取得很好的折衷。The cross -antenna rotation and inversion (CARI) algorithm, which is used to reduce the peak to average power ratio (PAPR) in MIMO - OFDM systems, has better performance but a large number of iteration. Although the suboptimal scheme of CARI, successive suboptimal CARI (SS-CARI),can reduce the number of iteration, the performance of PAPR reduction is lost largely. For this problem, a suboptimal rotation and inversion combination searching method based on sliding window is proposed. By utilizing sliding windows to search for the local optimal rotation and inversion combinations, not only the whole traversal search can be avoided to reduce the complexity of CARI greatly, but also the performance of PAPR reduction based on SS -CARI can be improved. Simulation result shows that a good tradeoff between the complexity of the system and the capability of PAPR reduction can be obtained through using the presented scheme.
关 键 词:MIMO—OFDM系统 峰平功率比 天线旋转取反法(CARI) 滑动窗
分 类 号:TN914.4[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112