Computing upper bounds to error probability of coded modulation schemes

DOI10.1109/26.508297MaRDI QIDQ4337930zbMATHOpenAlexFDO

Authors Ezio Biglieri, Andrea Sandri, Arnaldo Spalvieri

Publication date 24 August 1997

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.508297

zbMATH Keywords

convolutional codeserror probabilitiessignal constellationsadditive white Gaussian noise channelAWGN

Mathematics Subject Classification ID

Error probability in coding theory (94B70) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Techniques of bounding the probability of decoding error for block coded modulation structures
• Performance evaluation of coded modulation schemes based on binary lattices
• On the probability of error of convolutional codes
• Tighter bounds on the error probability of fixed convolutional codes

Cited in

(10)

• Techniques of bounding the probability of decoding error for block coded modulation structures
• Exact calculation of the union bound on performance of trellis-coded modulation in fading channels
• Bounds on the a priori index crossover probabilities for trellis-based channel codes
• Multidimensional lattices and limit efficiency of modulation and coding
• scientific article; zbMATH DE number 68004 (Why is no real title available?)
• Moderate Deviations in Channel Coding
• On the probability of error for triangular quadrature amplitude modulation
• Error probability analysis of bit-interleaved coded modulation
• Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and Its Application to Adaptive Modulation
• Tight error bounds for nonuniform signaling over AWGN channels

This page was built for publication: Computing upper bounds to error probability of coded modulation schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337930)