Low-complexity decoding of partial unit memory codes on precoded partial-response channels

DOI10.1109/18.568719MaRDI QIDQ4361475zbMATH OpenOpenAlexFDO

Authors Marianne Fjelltveit Hole, Kjell Jørgen Hole

Publication date 14 January 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

cosets of convolutional codescosets of partial unit memory convolutional codespartial-response channelPRCPUMsoft-decision decodingtrellis structure

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Two-step trellis decoding of partial unit memory convolutional codes
• Improved coding techniques for preceded partial-response channels
• Soft maximum likelihood decoding of partial unit memory codes
• Good convolutional codes for the precoded (1-D)(1+D)/sup n/ partial-response channels

Cited in

(4)

• A new construction of partial unit memory codes based on Reed-Solomon codes
• Soft maximum likelihood decoding of partial unit memory codes
• Improved coding techniques for preceded partial-response channels
• Two-step trellis decoding of partial unit memory convolutional codes

This page was built for publication: Low-complexity decoding of partial unit memory codes on precoded partial-response channels

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