3GPP-LTE系统下行链路S-SCH检测算法的低复杂度实现  

Low Complexity Implementation of S-SCH Detection of 3GPP-LTE Downlink System

作　　者：王丰[1] 朱宇[1] 

机构地区：[1]复旦大学通信科学与工程系,上海200433

出　　处：《复旦学报（自然科学版）》2011年第4期492-500,共9页Journal of Fudan University：Natural Science

基　　金：国家自然科学基金(60802010);国家科技重大专项(2009ZX03002-003)资助项目

摘　　要：小区搜索是3GPP-LTE移动通信系统中的重要过程,研究了此过程中下行链路辅同步信道(S-SCH)的检测问题,指出了接收机在采用最大似然序列检测(MLSD)算法进行S-SCH检测时,具有较高的计算复杂度.给出了一种基于MLSD准则S-SCH检测算法的低复杂度实现方法,利用S-SCH序列的结构特点,缩小候选S-SCH序列的数目,从而降低了算法的计算复杂度.在计算接收序列与不同候选S-SCH序列的似然值时,通过对似然函数公式的推导整理,指出可以采用快速Hadamard变换来进一步降低计算复杂度.分析了该实现方法所涉及的乘法与加法次数.数值仿真结果表明,提出的S-SCH检测实现方法能实现良好的检测性能和计算复杂度之间的折中.The detection of the secondary synchronization channel（S-SCH） in the 3GPP（3rd generation partnership project） long term evolution（LTE） downlink system is investigated in this paper.In order to reduce the high computational complexity of the conventional maximum likelihood sequence detection（MLSD） algorithm,a scheme of low complexity is proposed.By utilizing special structures of the S-SCH sequence the number of the candidate S-SCH sequences is reduced.By applying fast Hadamard transformation,the computational complexity of calculation and comparison of the likelihood values between the received S-SCH sequence and different candidate sequences can be further reduced.It is shown that the proposed scheme has a significantly low complexity compared to the conventional MLSD algorithm.Simulation results show that the proposed implementation result in good tradeoff between detection performance and computational complexity.

关 键 词：3GPP-LTE S-SCH检测 最大似然序列检测 HADAMARD变换 计算复杂度 

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