CPM optimization for low-complexity serial concatenated CPM

Serial concatenated continuous phase modulation (SCCPM) combines the constant envelope and bandwidth efficiency of continuous phase modulation (CPM) with the performance of serially concatenated codes making it attractive for satellite communication links with saturated transmitter amplifiers. Iterative demodulation and decoding of SCCPM provides excellent performance with simple outer codes by combining the structures of the modulation and the code. Because of the large space of CPM parameters, finding good SCCPM schemes with desired bandwidth efficiency and reasonable complexity is challenging. We present a systematic, simulation-based approach to this optimization problem with special attention to the interesting trade-off between the CPM bandwidth efficiency and the outer code rate.

[1]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[2]  John G. Proakis,et al.  Digital Communications , 1983 .

[3]  Subbarayan Pasupathy,et al.  Optimization of coded GMSK systems , 2002, IEEE Trans. Inf. Theory.

[4]  Krishna R. Narayanan.  Iterative demodulation and decoding of trellis coded CPM , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

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

[6]  Tor Aulin,et al.  Power and bandwidth efficient serially concatenated CPM with iterative decoding , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).