Finite-State Vector Quantization for Noisy Channels
| dc.contributor.author | Hussain, Yunus | en_US |
| dc.contributor.author | Farvardin, Nariman | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:51:03Z | |
| dc.date.available | 2007-05-23T09:51:03Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | Under noiseless channel conditions and for sources with memory, finite-state vector quantizers (FSVQs) exhibit improvements over memoryless vector quantizers. It is shown, however, that in the presence of channel noise, the performance of the FSVQ degrades significantly. This suggests that for noisy channels, the FSVQ design problem needs to be reformulated by taking into account the channel noise. Using some of the developments in joint source-channel trellis coding, we describe two different methods leading to two types of noisy channel FSVQs. We show by means of simulations on the Gauss-Markov source and speech LSP parameters and for a binary symmetric channel that both schemes are fairly robust to channel noise. For the Gauss-Markov source, the proposed noisy channel FSVQs perform at least as well as or better than the channel-optimized VQ, while for speech LSP parameters, they lead to saving of 1.5-4 bits/frame over the channel-optimized VQ depending on the level of noise in the channel. | en_US |
| dc.format.extent | 1513134 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5250 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1992-69 | en_US |
| dc.subject | data compression | en_US |
| dc.subject | data communications | en_US |
| dc.subject | information theory | en_US |
| dc.subject | speech processing | en_US |
| dc.subject | Communication | en_US |
| dc.subject | Signal Processing Systems | en_US |
| dc.title | Finite-State Vector Quantization for Noisy Channels | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1