Derpich et al., 2012 - Google Patents
Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sourcesDerpich et al., 2012
View PDF- Document ID
- 9090226897333043100
- Author
- Derpich M
- Ostergaard J
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
We improve the existing achievable rate regions for causal and for zero-delay source coding of stationary Gaussian sources under an average mean squared error distortion measure. To begin with, we find a closed-form expression for the information-theoretic causal rate …
- 230000001364 causal effect 0 title abstract description 95
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/146—Data rate or code amount at the encoder output
- H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
- H04N19/635—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets characterised by filter definition or implementation details
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Derpich et al. | Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sources | |
Woods | Subband image coding | |
Dragotti et al. | Distributed source coding: theory, algorithms and applications | |
Zamir et al. | Multiterminal source coding with high resolution | |
Baron et al. | Distributed compressive sensing | |
Servetto | Lattice quantization with side information | |
Ordentlich et al. | Integer-forcing source coding | |
Shuval et al. | Fast polarization for processes with memory | |
Tanaka et al. | Rate of prefix-free codes in LQG control systems | |
Whang et al. | Neural distributed source coding | |
Nagahara et al. | Packetized predictive control for rate-limited networks via sparse representation | |
Op't Veld et al. | Caching gaussians: Minimizing total correlation on the gray-wyner network | |
Kipnis et al. | The distortion-rate function of sampled Wiener processes | |
Akyol et al. | On constrained randomized quantization | |
US20140191888A1 (en) | Estimator for estimating a probability distribution of a quantization index | |
Ozyilkan et al. | Neural distributed compressor discovers binning | |
Leinonen et al. | Rate-distortion performance of lossy compressed sensing of sparse sources | |
Shirazinia et al. | Distributed quantization for measurement of correlated sparse sources over noisy channels | |
Shirazinia et al. | Channel-optimized vector quantizer design for compressed sensing measurements | |
Dupraz et al. | Rate-storage regions for massive random access | |
Stavrou et al. | Fixed-rate zero-delay source coding for stationary vector-valued Gauss-Markov sources | |
Natarajan et al. | Occam filters for stochastic sources with application to digital images | |
Dupraz et al. | Transmission and storage rates for sequential massive random access | |
Burich et al. | A simple family of non-linear analog codes | |
Ramaswamy et al. | Towards large scale distributed coding |