Soft decoding for vector quantization over noisy channels with memory

DOI10.1109/18.761288MaRDI QIDQ4701388zbMATH OpenOpenAlexFDO

Authors Mikael Skoglund

Publication date 21 November 1999

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

Full work available at URL https://semanticscholar.org/paper/5a70af319989806fbd08bd01535746eefa720b70

zbMATH Keywords

combined encoder-decoder designcombined source-channel codingequalizationindex assignmentintersymbol interferencenoisy channels with finite memoryoptimal soft decodingvector quantization

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Hadamard-based soft decoding for vector quantization over noisy channels
• Optimal soft decoding for combined trellis-coded quantization/modulation
• On the performance and complexity of channel-optimized vector quantizers
• Soft maximum likelihood decoding of partial unit memory codes
• Robust vector quantization by a linear mapping of a block code

Cited in

(10)

• Discrete denoising for channels with memory
• Quantization issues for soft-decision decoding of linear block codes
• Optimal soft decoding for combined trellis-coded quantization/modulation
• Symbol-by-symbol decoding as an approximation of word-by-word decoding
• On the performance and complexity of channel-optimized vector quantizers
• Channel-matched hierarchical table-lookup vector quantization
• Robust vector quantization by a linear mapping of a block code
• Hadamard-based soft decoding for vector quantization over noisy channels
• scientific article; zbMATH DE number 2115921 (Why is no real title available?)
• Memory efficient adaptation of vector quantizers to time-varying channels

This page was built for publication: Soft decoding for vector quantization over noisy channels with memory

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