Capacity-achieving CPM schemes

Preprint English OPEN
Perotti, Alberto ; Tarable, Alberto ; Benedetto, Sergio ; Montorsi, Guido (2008)

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.
  • References (19)
    19 references, page 1 of 2

    [1] J. B. Anderson, T. Aulin, and C.-E. Sundberg, Digital Phase Modulation. New York, London: Plenum Press, 1986.

    [2] B. E. Rimoldi, “A decomposition approach to CPM,” IEEE Transactions on Information Theory, vol. 34, pp. 260-270, March 1988.

    [3] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: Performance analysis, design adn iterative decoding,” IEEE Transactions on Information Theory, vol. 44, pp. 909- 926, May 1998.

    [4] P. Moqvist and T. M. Aulin, “Serially concatenated continuous phase modulation with iterative decoding,” IEEE Transactions on Communications, vol. 49, pp. 1901-1915, November 2001.

    [5] K. R. Narayanan and G. L. Stu¨ber, “Performance of trellis-coded CPM with iterative demodulation and decoding,” IEEE Transactions on Communications, vol. 49, pp. 676-687, April 2001.

    [6] K. R. Narayanan, I. Altunbas, and R. S. Narayanaswami, “Design of serial concatenated MSK schemes based on density evolution,” IEEE Transactions on Communications, vol. 51, pp. 1283-1295, August 2003.

    [7] D. Arnold, H.-A. Loeliger, P. A. Vontobel, A. Kavcˇic´, and W. Zeng, “Simulation-based computation of information rates for channels with memory,” IEEE Transactions on Information Theory, vol. 52, pp. 3498- 3508, August 2006.

    [8] K. Padmanabhan, S. Ranganathan, S. P. Sundaravaradhan, and O. M. Collins, “General CPM and its capacity,” in Proceedings of the International Symposium on Information Theory, Adelaide, AU, September 2005, pp. 750-754.

    [9] A. J. Viterbi, J. K. Wolf, E. Zehavi, and R. Padovani, “A pragmatic approach to trellis-coded modulation,” IEEE Communications Magazine, vol. 27, no. 7, pp. 11-19, July 1989.

    [10] E. Zehavi, “8-psk trellis codes ofr a rayleight channel,” IEEE Transactions on Communications, vol. 40, no. 5, pp. 873-884, May 1992.

  • Similar Research Results (1)
  • Metrics
    No metrics available
Share - Bookmark