• DocumentCode
    1550061
  • Title

    Serially concatenated continuous phase modulation with iterative decoding

  • Author

    Moqvist, Pär ; Aulin, Tor M.

  • Author_Institution
    Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
  • Volume
    49
  • Issue
    11
  • fYear
    2001
  • fDate
    11/1/2001 12:00:00 AM
  • Firstpage
    1901
  • Lastpage
    1915
  • Abstract
    Serially concatenated and interleaved continuous phase modulation (CPM) with iterative decoding is investigated. An a posteriori probability (APP) algorithm for CPM is developed based on the classic APP algorithm for channel codes. The system is analyzed through upper bounds on the average bit error probability. For coded and interleaved minimum shift keying, the weight spectrum is computed, resulting in a transfer function bound. This is cumbersome for a general CPM system; instead, only the most significant error events contributing to the weight spectrum are identified. Simulations show that, firstly, these events give a satisfactory view of system performance when equal outer codes are used, and secondly, that remarkably good performance can be obtained for some simple systems. Finally, power spectral densities and bandwidths are computed, allowing for a bandwidth/performanee comparison of different combinations
  • Keywords
    concatenated codes; continuous phase modulation; error statistics; interleaved codes; iterative decoding; minimum shift keying; transfer functions; APP algorithm; a posteriori probability algorithm; average bit error probability; bandwidth; channel codes; concatenated convolutional codes; error events; interleaved continuous phase modulation; iterative decoding; minimum shift keying; outer codes; pseudorandom bit interleaver; serially concatenated CPM; serially concatenated continuous phase modulation; simulations; system performance; transfer function bound; turbo codes; upper bounds; weight spectrum; Bandwidth; Computational modeling; Concatenated codes; Continuous phase modulation; Discrete event simulation; Error probability; Iterative algorithms; Iterative decoding; Transfer functions; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.966054
  • Filename
    966054