Low Complexity CPM Detection Algorithm With the g-th Power Based on the LD-RD

Abstract

Based on the Laurent decomposition (LD) and the Rimoldi decomposition (RD) with the reduced-search technique, we propose a low-complexity continuous phase modulation (CPM) detection algorithm through the operation of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$g$ </tex-math></inline-formula> -th power. In this way, the denominator of the modulation index is effectively equivalent to a smaller value, achieving the usage of much fewer trellis states in the Viterbi algorithm (VA). Finally, simulation results show that, compared to the optimal detection method, the proposed algorithms significantly reduce the complexity with negligible bit error rate (BER) loss.