论文信息 - Iterative decoding of serially concatenated convolutional codes and MSK

Iterative decoding of serially concatenated convolutional codes and MSK

The performance of iterative decoding and demodulation of serially concatenated convolutional codes and minimum shift keying (MSK) is studied. It is shown that by appropriately combining the trellises of MSK and the inner code, a high performance coded modulation system can be achieved. Simulation results also confirms that recursive inner codes are essential for a serially concatenated system.

Subbarayan Pasupathy | Victor F. Szeto | S. Pasupathy

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

[2] H. Leib,et al. Error-control properties of minimum shift keying , 1993, IEEE Communications Magazine.

[3] N. A. Ugrelidze,et al. Simulated error performance of encoded MSK signals in Gaussian and Rician fading channels , 1994 .

[4] Subbarayan Pasupathy,et al. Structure, optimization, and realization of FFSK trellis codes , 1988, IEEE Trans. Inf. Theory.

[5] Sergio Benedetto,et al. A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes , 1996 .

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

[7] F. Pollara,et al. Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.