基于Laurent分解Multi-h CPM低复杂度解调方法  

A Low-Complexity Sequence Detection Algorithm Based on Laurent Decomposition for Multi-h Continuous Phase Modulation

作　　者：崔中普 窦高奇[1] 高俊[1] 何铭嘉 CUI Zhong-pu, DOU Gao-qi, GAO Jun, HE Ming-jia(College of Electronic Engineering,Naval University of Engineering,Wuhan 430033 ,Chin)

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《重庆工商大学学报（自然科学版）》2018年第1期59-63,共5页Journal of Chongqing Technology and Business University:Natural Science Edition

基　　金：湖北省自然科学基金(2015CFB174)

摘　　要：多指数连续相位调制(Multi-h CPM)因具有相位连续、包络恒定、高带宽及频率利用率等优点而备受关注,但其解调需要大量的匹配滤波器和网格状态,限制了其在工程实际中的应用;通过对Multi-h CPM信号进行Laurent分解近似处理方法来有效减少解调中所使用的匹配滤波器个数以及维特比译码过程中的网格状态数,从而降低其解调复杂度;与最大似然序列检测方法相比,采用Laurent分解可以大大减少匹配滤波器个数和网格状态数;仿真结果表明:在性能损失很少的情况下解调复杂度明显降低。Multi index continuous phase modulation（Multi-h CPM） has attracted attention for its continuous phase,constant envelope,high frequency and bandwidth utilization rate,but its demodulation requires a large number of matched filters and grid state,which limits its application in engineering. Therefore,we can reduce the use of the number of matched filters and grid state in Viterbi decoding,by using Laurent decomposition and approximate process. Compared with the maximum likelihood sequence detection method,Laurent decomposition can greatly reduce the number of matched filters and grid states. The simulation results show that the complexity of the demodulation is obviously reduced in the case of little performance loss.

关 键 词：多指数连续相位调制 LAURENT分解 分量近似处理 低复杂度解调 

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