General CPM and its capacity

This paper calculates the capacity of continuous phase modulation (CPM) schemes, modeling CPM as a finite state machine. The novel capacity-calculation algorithm gives a reliable estimate of the capacity using minimal computer time. This algorithm allows the production of a more generalized class of modulation schemes called generalized CPM, which have a higher capacity than traditional CPM schemes of comparable bandwidth

[1]  Daniel J. Costello,et al.  Turbo Codes with Non-Systematic Constituent Codes ∗ , 2001 .

[2]  Jim Law Selected papers on analysis of algorithms , 2001, SOEN.

[3]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[4]  Bixio Rimoldi,et al.  A decomposition approach to CPM , 1988, IEEE Trans. Inf. Theory.

[5]  Tor Aulin,et al.  Digital Phase Modulation , 1986, Applications of Communications Theory.

[6]  Oliver M. Collins Coding for the variably coherent channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[7]  Andrea J. Goldsmith,et al.  Linear models and capacity bounds for continuous phase modulation , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[9]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .