基于CHU序列的低复杂度OFDMA小区搜索  

CHU sequence-based low complexity cell search in OFDMA

作　　者：李力[1,2] 周平 陈霞 胡宏林 

机构地区：[1]浙江大学国际电磁科学院浙大分院,杭州310058 [2]上海无线通信研究中心,上海200050

出　　处：《高技术通讯》2008年第11期1135-1140,共6页Chinese High Technology Letters

基　　金：863计划(2005AA123510)

摘　　要：提出了正交频分多址接入(OFDMA)下行链路中的一种基于 CHU 序列的小区搜索发送结构和检测算法。与传统的小区搜索方法相比,这种新型方案在保证性能的前提下,能够有效降低计算复杂度和提高检测效率。从仿真结果可以发现,这种优化的小区搜索发送结构和检测算法有效增强了用户的小区搜索性能,特别是当用户处于小区边缘时,性能提升更为明显。并提出了两种基于新型小区搜索方案的大范围小区搜索方式,其中的级联搜索方法不但在小区各个位置上体现了鲁棒性,并能够在较低的复杂度下有效扩展小区的搜索范围。This paper proposes a novel cell search structure based on the CHU sequence in orthogonal frequency division multiple access （OFDMA） downlink. Compared with the conventional method, this proposed scheme has much lower computational complexity while keeping the efficient system performance. It can be found from the simulation result that this modified algorithm effectively enhances users＇ capability of cell identification, especially for the users at the cell boundary. Based on the novel technique, this paper also introduce two different schemes for large area cell search scenario, in which the cascade scheme not only proves robustness at any location of one cell, but also enlarges the search area with low computational complexity.

关 键 词：正交频分多址接入(OFDMA) 小区搜索 恒模零自相关(CAZAC) 离散傅立叶变换(DFT)/逆傅立叶变换(IDFT) 

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