Quantization of memoryless and Gauss-Markov sources over binary Markov channels
It is shown that in some cases the analysis of the signal and the transmitting channel may not be made independently. The authors analyze the joint source-channel coding. They consider the stationary memoryless or Gauss-Markov source. The channel has a memory that is described by an additive noise being the \(M\)th order Markov process. Two joint source-channel coding schemes are considered. The first one is a channel-optimized vector quantizer; it is optimized for both source and channel. The second scheme consists of a scalar quantizer and a maximum a posteriori detector. In this scheme, it is assumed that the scalar quantizer output has residual redundancy that can be exploited by the maximum a posteriori detector to combat the correlated channel noise. These two schemes are compared against two other schemes which use the channel interleaving. Numerical results show that the proposed schemes outperform the interleaving schemes.
- Noiseless coding of binary finite-order Markov sources (Corresp.)
- Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
- Joint source-channel coding of discrete-time signals with continuous amplitudes.
- Detection of binary Markov sources over channels with additive Markov noise
- Joint source-channel coding via model predictive control
- Optimal sequential vector quantization of Markov sources
- Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models
- scientific article; zbMATH DE number 16047 (Why is no real title available?)
- Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
- On the cost of finite block length in quantizing unbounded memoryless sources
This page was built for publication: Quantization of memoryless and Gauss-Markov sources over binary Markov channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355498)