Efficient performance computations for trellis-coded modulation

DOI10.1109/26.771329MaRDI QIDQ2732739zbMATH OpenOpenAlexFDO

Authors Hassan Abou Rajab, Melek D. Yücel

Publication date 4 September 2001

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

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

zbMATH Keywords

distance spectrumset partitioningsubset selector distance polynomialstrellis-coded modulation schemes

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• An algorithm for computing the distance spectrum of trellis codes
• Distance spectrum analysis of space-time trellis-coded modulations in quasi-static rayleigh-fading channels
• scientific article; zbMATH DE number 1123085
• Distance spectra and upper bounds on error probability for trellis codes
• scientific article; zbMATH DE number 1116615

Cited in

(7)

• Performance evaluation of coded modulation schemes based on binary lattices
• An algorithm for computing the distance spectrum of trellis codes
• Distance spectrum analysis of space-time trellis-coded modulations in quasi-static rayleigh-fading channels
• scientific article; zbMATH DE number 1116615 (Why is no real title available?)
• scientific article; zbMATH DE number 1482965 (Why is no real title available?)
• A recursive algorithm for the exact BER computation of generalized hierarchical QAM constellations
• Distance spectra and upper bounds on error probability for trellis codes

This page was built for publication: Efficient performance computations for trellis-coded modulation

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