检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学移动通信国家重点实验室,南京210096
出 处:《Journal of Southeast University(English Edition)》2005年第2期123-126,共4页东南大学学报(英文版)
基 金:TheNationalHighTechnologyResearchandDevelop mentProgramofChina(863Program)(No.2002AA123031)
摘 要:To obtain good trade-offs between complexity and performance onpeak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM)using partial transmitting sequence (PTS) schemes, a trellis structure based PTS factor searchmethod is proposed. The trellis search is with a variant constraint length L_C, 1 ≤ L_C ≤ V-1,where V is the number of PTS subblocks. The method is to decide a PTS factor by searching all thepossible paths obtained by varying L_C consecutive factors. The trellis search can be viewed as ageneral PTS factor search model. If L_C = V-1, it is a full search, and if L_C = 1, it is aniterative search. Using different constraint lengths, trellis factor search PTS exhibits differentPAPR reduction performances. A larger L_C results in a better performance and L_C = V-1 results inthe optimum. However, a larger L_C requires more computation. This helps to choose a good trade-offbetween complexity and performance.为了得到部分传输序列降低OFDM信号峰均比方案中复杂度和性能之间的良好折衷,提出了一种基于格形结构的部分传输序列因子的搜索方法.这种格形搜索有一个可变的约束长度LC, 1≤LC≤V-1,V为部分传输序列子块的数目.该方法通过搜寻格形结构中可能的路径来决定部分传输序列的因子,而这些路径通过改变LC个相邻因子的值得到.格形搜索可看作一个统一的传输序列因子搜索模型,当LC=V-1,为全局搜索;当LC=1,为单步迭代搜索.采用不同的约束长度,格形搜索在抑制峰均比方面呈现出不同的性能,LC越大其性能越好,而LC=V-1对应最优的结果.同时较大的LC需要更多的计算.这些结论有助于在复杂度和性能之间找到一个好的折衷.
关 键 词:peak-to-average power ratio (PAPR) partial transmitting sequence (PTS) trellis search
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249