一种基于“相位距离”降低CPM解调复杂度的新算法

A Novel Algorithm for Reducing MLSE Complexity of  CPM Based on Phase Distance

  • 摘要: 连续相位调制(CPM)是一种恒包络的高效调制方式,由于其解调算法复杂度高,其应用长期以来受到限制。传统的CPM解调算法基本上是基于幅度信息而未考虑相位信息,因此复杂度较高。本文提出了一种依据CPM信号特征的相位距离的定义,利用2RC4CPM对该定义的有效性进行了验证,并将其应用于降低最大似然序列检测算法的路径数,从而大幅降低了最优接收机解调的复杂度。仿真表明,在选取适当门限值的情况下,基于“相位距离”的最大似然序列检测算法性能接近最优接收机。

     

    Abstract: Continuous Phase Modulation (CPM) is an efficient modulation scheme with constant envelop, however its applications have been constrained due to high complexity of the demodulation algorithms. Traditional demodulation algorithms are based on amplitude information rather than phase information,which results in its high complexity. A conception called Phase Distance based on the inherent characteristic of CPM signal is defined and verified based on the 2RC-4CPM. And a novel algorithm used to reduce the path number of MLSE algorithm based on this conception is presented. This algorithm can reduce the computation complexity of the optimum receiver considerably. Simulation results show that the degradation in error performance compared to the optimum receiver is less than 1dB with a proper threshold.

     

/

返回文章
返回