Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
1984
DOI: 10.1002/ecja.4400670406
|View full text |Cite
|
Sign up to set email alerts
|

A construction of vector quantizers for noisy channels

Abstract: Recently, vector quantization has become noted as a highly efficient coding method of image and voice data. So far, many of the highly efficient coding problems, or service coding problems, have been studied separately from channel coding problems. This paper reconsiders vector quantization jointly optimizing source coding and channel coding, and proposes a new vector quantizer for noisy channels. Vector quantizers for binary symmetric channels are designed for memoryless Gaussian source, Gauss‐Markov source a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
95
0
1

Year Published

1999
1999
2013
2013

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 123 publications
(98 citation statements)
references
References 9 publications
0
95
0
1
Order By: Relevance
“…2. We refer the reader to [1], [34] for a detailed description of the system as well as its design algorithm based on iteratively applying optimality encoder and decoder conditions [7]- [10]. Instead, we focus on illustrating the system's performance over the NBNDC-QB channel.…”
Section: B Channel Optimized Vector Quantization (Covq)mentioning
confidence: 99%
“…2. We refer the reader to [1], [34] for a detailed description of the system as well as its design algorithm based on iteratively applying optimality encoder and decoder conditions [7]- [10]. Instead, we focus on illustrating the system's performance over the NBNDC-QB channel.…”
Section: B Channel Optimized Vector Quantization (Covq)mentioning
confidence: 99%
“…Our focus here is to investigate the details of the calculation of the specific a posteriori probabilities required, so as to find more efficient solutions. optimum MMSE decoding of (8) are calculated recursively by (14) at the bottom of the page ( , see Appendix for proof), At each time instant the probabilities corresponding to each state are stored to be used in (14) at the next time instant. In addition to the computations required to do this task, the complexity of the AOMMSE decoder is comprised of the cost to perform the multiplications and normalization in (14), as well as the weighted average of the reconstruction rule in (8).…”
Section: ) a Basic Solutionmentioning
confidence: 99%
“…Two classic works in this area are those of Kurtenbach and Wintz [12] on scalar quantization over noisy channels and Chang and Donaldson [13] on the design of a DPCM system for transmission over a discrete memoryless channel. Other works on channel optimized quantization include the works of Kumazawa et al [14] and Farvardin and Vaishampayan [15] on vector quantization over noisy channels as well as the works of Dunham and Gray [16] and Ayanoglu and Gray [17] on joint source-channel trellis coding. Examples of more recent works in this class are present in [18]- [20].…”
Section: Introductionmentioning
confidence: 99%
“…We assume memoryless and Gauss-Markov sources and an additive white Gaussian noise (AWGN) channel. We demonstrate that within the VQ-based HDA framework, the system can be optimized using an iterative method similar to the traditional channel-optimized VQ (COVQ) design algorithm [4], [7]. Motivated by a broadcast scenario, we then present the performance of a fixed encoder, adaptive decoder system in which the encoder is optimized for a fixed-channel SNR while the decoder adapts to the changing channel SNR.…”
mentioning
confidence: 99%