Papers
Topics
Authors
Recent
Search
2000 character limit reached

Capacity-achieving CPM schemes

Published 13 Jun 2008 in cs.IT and math.IT | (0806.2198v1)

Abstract: The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragmatic coded-modulation system. The resulting schemes exhibit performance very close to the CPM capacity without requiring iterations between the outer decoder and the CPM demodulator. As a result, the receiver exhibits reduced complexity and increased flexibility due to the separation of the demodulation and decoding functions.

Citations (38)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.