Title :
Convergence analysis of SCCPM with iterative decoding
Author :
Moqvist, P. ; Aulin, T.
Author_Institution :
Dept. of Comp. Eng., Telecomm. Theor., Chalmers Univ. of Technol., Goteborg, Sweden
Abstract :
A convergence analysis of serially concatenated continuous phase modulation (SCCPM) with iterative decoding is presented, based on extrinsic information density evolution. Earlier conclusions from union bounds to maximum likelihood decoding that could not be verified by simulations can now be explained. This includes the effect of more complex outer codes and of inner CPM systems with input weight 1 error events. Due to their trivial feed-forward polynomial, all CPM systems provide good initial decoder convergence. Still the role of the CPM state complexity is not well explained. Finally, bit error rate performance per iteration is estimated from the diagrams, showing good coherence with simulation results
Keywords :
approximation theory; computational complexity; concatenated codes; continuous phase modulation; convergence of numerical methods; error statistics; interleaved codes; iterative decoding; maximum likelihood decoding; modulation coding; BER approximation; BER performance; CPM state complexity; bit error rate performance; coded CPM; coherence; convergence analysis; decoder convergence; extrinsic information density evolution; feed-forward polynomial; inner CPM systems; input weight 1 error events; interleaved CPM; iterative decoding; maximum likelihood decoding; outer codes; serially concatenated continuous phase modulation; simulation results; simulations; union bounds; Bit error rate; Concatenated codes; Continuous phase modulation; Convergence; Feeds; Information analysis; Iterative decoding; Maximum likelihood decoding; Signal to noise ratio; Telecommunications;
Conference_Titel :
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-7206-9
DOI :
10.1109/GLOCOM.2001.965630
