基于FFT特性增加相位序列的变换选择性映射方法  

Transformation SLM methods of increasing phase sequences based on FFT properties

作　　者：黎锁平[1] 巩朋成[2] 王克融[2] 侯尚林[1] 

机构地区：[1]兰州理工大学理学院,甘肃兰州730050 [2]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《电路与系统学报》2011年第1期40-46,共7页Journal of Circuits and Systems

基　　金：教育部"春晖计划"基金(Z2006-1-62006);甘肃省自然科学基金(0809RJZA019);甘肃省高校研究生导师科研资助基金(0703-10)

摘　　要：本文提出了基于傅立叶变换(FFT)特性的变换选择性映射(T-SLM)方法。该方法利用已产生的相位序列和FFT的频域循环移位特性、线性特性及其联合特性构造出了T1、T2和T21三种变换以产生新的相位序列,增加更多交替的OFDM信号序列,而不是通过增加IFFT运算产生更多的备选信号序列;同时分析给出了反映文中各种SLM和T-SLM方法运算复杂度的解析式。理论分析表明本文提出的T-SLM方法有效降低了得到备选信号的计算复杂度,但并没有减少备选信号的数量,因而也没有减少PAPR降低的性能。仿真显示,在相同的子序列时,T-SLM方法的性能胜过SLM方法;在相同的备选信号时,T-SLM方法(T21)能很好地接近SLM方法的性能,但减少了计算复杂度;在相同的子序列数时,本文提出的T-SLM方法使用T21变换要优于使用T1和T2变换。We propose novel Transformation Selected Mapping schemes （T-SLM）, which are based on the properties of Fast Fourier Transform （FFT）. The T-SLM schemes make use of generated phase sequences and the circular shift property, the linear property of FFT and combination of the two properties to construct T1, T2 and T21 transformations for generating more alternative candidate OFDM signals without increasing IFFT operations. We also deduce the analytical formula of complexity for SLM and T-SLM schemes. Theoretical analysis indicates that the proposed T-SLM scheme can remarkably reduce the computational complexity of obtaining the candidate signals without decreasing the PAPR reduction performance compared with the conventional SLM. The simulation results also show that T-SLM schemes outperform conventional SLM in the case of the same number of sub-blocks; and both schemes almost have the same performance for the same candidate number. However, T-SLM has less computational complex. In T-SLM with the same number of sub-blocks, T21 is prior to T1 and T2 for PAPR reduction performance.

关 键 词：峰均比 变换选择性映射 傅立叶变换 

分 类 号：TN925.5[电子电信—通信与信息系统]