• DocumentCode
    2254083
  • Title

    A novel general approach to the optimal synthesis of trellis-codes for arbitrary noisy discrete memoryless channels

  • Author

    Baccarelli, E. ; Cusani, R. ; Piazzo, L.

  • Author_Institution
    INFOCOM Dept., Rome Univ., Italy
  • fYear
    1995
  • fDate
    17-22 Sep 1995
  • Firstpage
    68
  • Abstract
    A new general criterion for the optimal design of (possibly) time-varying and nonlinear trellis-codes for reliable transmission of digital information sequences over arbitrary (possibly) time-varying discrete memoryless channels (DMCs) is presented. The criterion is derived on the basis of new tight generally time-varying analytical upper bounds developed for the performance evaluation of MAP decoders with finite decoding constraint-lengths which minimise the symbol-error probability. New procedures related to the proposed criterion are also presented, allowing a direct construction of good trellis-codes for any arbitrary DMC and for any assigned value of the decoding constraint-length
  • Keywords
    digital communication; maximum likelihood decoding; noise; optimisation; probability; time-varying channels; trellis coded modulation; trellis codes; MAP decoders; decoding constraint length; decoding constraint lengths; digital information sequences; noisy discrete memoryless channels; nonlinear trellis codes; optimal design; optimal synthesis; performance evaluation; reliable digital transmission; symbol error probability; time varying analytical upper bounds; time varying discrete memoryless channels; time varying trellis codes; Convolutional codes; Hamming distance; Maximum likelihood decoding; Maximum likelihood estimation; Memoryless systems; Monte Carlo methods; Performance analysis; Riccati equations; Upper bound; Working environment noise;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
  • Conference_Location
    Whistler, BC
  • Print_ISBN
    0-7803-2453-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1995.531170
  • Filename
    531170