Simplified Viterbi decoding of geometrically uniform TCM codes

DOI10.1109/26.535433MaRDI QIDQ4340401zbMATH OpenOpenAlexFDO

Authors Fred Daneshgaran, Marina Mondin

Publication date 26 August 1997

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

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

zbMATH Keywords

geometrically uniform trellis coded modulation codesGUTCM codesmaximum likelihood decodersViterbi decoderVLSI implementation

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• Simplified trellis decoder
• Efficient maximum likelihood decoding of linear block codes using a trellis
• A parallel Viterbi decoder for block cyclic and convolution codes
• Decoding of convolutional codes using a syndrome trellis
• Analysis of convolutional encoders and synthesis of rate-2/n Viterbi decoders

Cited in

(4)

• Simplified trellis decoder
• scientific article; zbMATH DE number 1135090 (Why is no real title available?)
• scientific article; zbMATH DE number 1486636 (Why is no real title available?)
• A two-stage decoder for pragmatic trellis-coded M-PSK modulation using a symbol transformation

This page was built for publication: Simplified Viterbi decoding of geometrically uniform TCM codes

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