Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Bandwidth-Efficient Constant-Energy Trellis-Coded Modulation Schemes with Prescribed Decoding Delay
 
research article

Bandwidth-Efficient Constant-Energy Trellis-Coded Modulation Schemes with Prescribed Decoding Delay

Li, Quinn
•
Rimoldi, Bixio  
•
Simon, Marvin
2002
IEEE Transactions on Information Theory

For a general class of constant-energy trellis-coded modulation schemes with $2^{\nu}$ states, necessary and sufficient conditions to guarantee that a maximum-likelihood sequence estimator can decode each symbol with a fixed delay of $\nu$ symbols are derived. Additive white Gaussian noise is assumed. {MSK} is a special case that belongs to the family of modulation schemes with $\nu=1$. It is shown that when these conditions are met, the minimum squared Euclidean distance is upper bounded by $4E_s$, where $E_s$ is the signal's energy per interval. Necessary and sufficient conditions to achieve the upper bound are given and it it shown that these conditions are met if and only if the trellis-coded modulation scheme can be implemented as pulse amplitude modulation using a pulse that extends over $\nu+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.

  • Details
  • Metrics
Type
research article
DOI
10.1109/18.995602
Author(s)
Li, Quinn
Rimoldi, Bixio  
Simon, Marvin
Date Issued

2002

Published in
IEEE Transactions on Information Theory
Volume

48

Issue

5

Start page

1150

End page

1161

Subjects

MSK

•

Viterbi decoder

•

modulation

•

coding

•

spectral shaping

•

PAM.

•

NCCR-MICS

•

NCCR-MICS/CL1

URL

URL

http://www.mics.org/ADM/getDoc.php?docid=182&docnum=1
Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LCM  
Available on Infoscience
November 29, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/236117
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés