• DocumentCode
    1272341
  • Title

    Bandwidth-efficient constant-energy trellis-coded modulation schemes with prescribed decoding delay

  • Author

    Li, Quinn ; Rimoldi, Bixio ; Simon, Marvin K.

  • Author_Institution
    Broadcom Corp., Mountain Lakes, NJ, USA
  • Volume
    48
  • Issue
    5
  • fYear
    2002
  • fDate
    5/1/2002 12:00:00 AM
  • Firstpage
    1150
  • Lastpage
    1161
  • Abstract
    For a general class of constant-energy trellis-coded modulation (TCM) schemes with 2ν states, necessary and sufficient conditions to guarantee that a maximum-likelihood sequence estimator (MSLE) can decode each symbol with a fixed delay of ν symbols are derived. Additive white Gaussian noise (AWGN) is assumed. Minimum shift keying (MSK) is a special case that belongs to the family of modulation schemes with ν=1. It is shown that when these conditions are met, the minimum squared Euclidean distance is upper-bounded by 4Es, where Es is the signal´s energy per interval. Necessary and sufficient conditions to achieve the upper bound are given and it is shown that these conditions are met if and only if the TCM scheme can be implemented as pulse amplitude modulation (PAM) using a pulse that extends over ν+1 symbols. Signals that achieve this upper bound and maximize the power within a given bandwidth are found. The bandwidth efficiency of such schemes is significantly higher than that of MSK
  • Keywords
    AWGN; decoding; delays; maximum likelihood sequence estimation; minimum shift keying; pulse amplitude modulation; trellis coded modulation; AWGN; MSK; MSLE; PAM; TCM schemes; additive white Gaussian noise; bandwidth-efficient constant-energy trellis-coded modulation; decoding delay; maximum-likelihood sequence estimator; minimum shift keying; minimum squared Euclidean distance; necessary and sufficient conditions; pulse amplitude modulation; AWGN; Additive white noise; Bandwidth; Delay estimation; Maximum likelihood decoding; Maximum likelihood estimation; Pulse modulation; State estimation; Sufficient conditions; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.995602
  • Filename
    995602