Low-complexity linear frequency domain equalization for continuous phase modulation
IEEE Transactions on Wireless Communications
A space-time code design for CPM: diversity order and coding gain
IEEE Transactions on Information Theory
Complexity reduction for continuous phase modulation using basis functions
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Continuous phase modulation receivers based on frequency domain processing
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A novel graph-based suboptimal multiuser detector for FDM-CPM transmissions
IEEE Transactions on Wireless Communications
A system-theory approach to decompose CPM signals into PAM waveforms
IEEE Transactions on Communications
A new finite series representation for continuous phasemodulation
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 754.90 |
It is widely known that minimum shift keying (MSK) may be seen as a PAM signaling scheme and that the same is true, albeit approximately, with MSK-like modulations. It is also known (perhaps not so widely) that any binary continuous phase-modulated (CPM) signal may be exactly decomposed into the sum of a few PAM waveforms. In this paper we show that this property extends to multilevel CPM signaling. Features of a PAM decomposition are discussed as a function of the alphabet size, the modulation index, and the frequency response of the system. It is found that, especially with signaling schemes with a long memory, the decomposition has so many terms that it becomes unmanageable. For these cases an approximation is proposed with a limited number of terms