Quantization of Memoryless and Gauss-Markov Sources Over Binary Markov Channels
dc.contributor.author | Phamdo, N. | en_US |
dc.contributor.author | Alajaji, Fady | en_US |
dc.contributor.author | Farvardin, Nariman | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:57:15Z | |
dc.date.available | 2007-05-23T09:57:15Z | |
dc.date.issued | 1994 | en_US |
dc.description.abstract | Joint source-channel coding for stationary memoryless and Gauss- Markov sources and binary Markov channels is considered. The channel is an additive-noise channel where the noise process is an M-th order Markov chain. Two joint source-channel coding schemes are considered. The first is a channel-optimized vector quantizer - 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 then compared against two schemes which use channel interleaving. Numerical results show that the proposed schemes outperform the interleaving schemes. For very noisy channels with high noise correlation, gains of 4 to 5 dB in signal-to-noise ratio are possible. | en_US |
dc.format.extent | 959138 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/5549 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1994-79 | en_US |
dc.subject | data compression | en_US |
dc.subject | detection | en_US |
dc.subject | digital communications | en_US |
dc.subject | information theory | en_US |
dc.subject | Intelligent Signal Processing | en_US |
dc.subject | Communications Systems | en_US |
dc.title | Quantization of Memoryless and Gauss-Markov Sources Over Binary Markov Channels | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1