Reduced-complexity detection and phase synchronization of CPM signals

Based on an extension of Laurent (1986) decomposition of continuous phase modulation (CPM) signals into a sum of linearly modulated components, we derive a class of reduced-complexity maximum-likelihood (ML) coherent detection and closed-loop phase synchronization schemes. The complexity of the resu...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 45; no. 9; pp. 1070 - 1079
Main Authors Colavolpe, G., Raheli, R.
Format Journal Article
LanguageEnglish
Published IEEE 01.09.1997
Subjects
Online AccessGet full text
ISSN0090-6778
DOI10.1109/26.623071

Cover

More Information
Summary:Based on an extension of Laurent (1986) decomposition of continuous phase modulation (CPM) signals into a sum of linearly modulated components, we derive a class of reduced-complexity maximum-likelihood (ML) coherent detection and closed-loop phase synchronization schemes. The complexity of the resulting detection schemes, expressed in terms of the number of matched filters and states of a Viterbi algorithm, is significantly reduced with respect to that of optimal coherent receivers with negligible performance loss. This result extends a known one valid for the binary case to multilevel CPM. The proposed synchronization schemes do not require an increased number of matched filters, and are perfectly suitable to be used in conjunction with these receivers. Based on the phase-locked loop (PLL) equivalent linear model, a method for optimizing the parameters of digital second-order PLL's is presented. Numerical examples, based on theoretical analysis and computer simulation, are provided for two specific formats in the CPM class: tamed frequency modulation (TFM) and a quaternary raised-cosine (RC) modulation.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
DOI:10.1109/26.623071