NDLI: Efficient algorithms for fixed-rate entropy-coded vector quantization

Content Provider	IEEE Xplore Digital Library
Author	Khandani, A.K. Kabal, P. Dubois, E.
Copyright Year	1994
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada (Khandani, A.K.)
Abstract	In the quantization of any source with a nonuniform probability density function, the entropy coding of the quantizer output can result in a substantial decrease in bit rate. A straightforward entropy coding scheme presents us with the problem of the variable data rate. A solution in a space of dimensionality N is to select of subset of elements in the N-fold cartesian product of a scaler quantizer and represent them with code-words of the same length. A reasonable rule is to select the N-fold symbols of the highest probability. For a memoryless source, this is equivalent to selecting the N-fold symbols with the lowest additive self-information. The search/addressing of this scheme can no longer be achieved independently along the one-dimensional subspaces. In the case of a memoryless source, the selected subset has a high degree of structure which can be used to substantially decrease the complexity. A dynamic programming approach is used to exploit this structure. We build our recursive structure required for the dynamic programming in a hierarchy of stages. This results in several benefits over the conventional trellis-based approaches. Using this structure, we develop efficient rules (based on aggregating the states) to substantially reduce the search/addressing complexities while keeping the degradation negligible.<>
Starting Page	240
Ending Page	244
File Size	483837
Page Count	5
File Format	PDF
ISBN	0780318250
DOI	10.1109/ICC.1994.369052
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-05-01
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vector quantization Lattices Entropy coding Dynamic programming Bit rate Source coding Additives Business Density functional theory Degradation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient methods for the addressing/decoding of a lattice-based fixed-rate, entropy-coded vector quantizer

A hierarchical dynamic programming approach to fixed-rate, entropy-coded quantization

Efficient algorithms for fixed-rate entropy-coded vector quantization.

Entropy-constrained trellis coded quantization

Efficient Algorithms for Fixed-Rate Entropy-Coded Vector Quantization (1994)

A low-complexity method for fixed-rate entropy-constrained vector quantization

Fixed-rate entropy-coded vector quantization using linear (zero-one) programming

Rate-distortion models for entropy constrained lattice quantization

Towards entropy constrained lattice vector quantization

Efficient algorithms for fixed-rate entropy-coded vector quantization

Similar Documents

Efficient methods for the addressing/decoding of a lattice-based fixed-rate, entropy-coded vector quantizer

A hierarchical dynamic programming approach to fixed-rate, entropy-coded quantization

Efficient algorithms for fixed-rate entropy-coded vector quantization.

Entropy-constrained trellis coded quantization

Efficient Algorithms for Fixed-Rate Entropy-Coded Vector Quantization (1994)

A low-complexity method for fixed-rate entropy-constrained vector quantization

Fixed-rate entropy-coded vector quantization using linear (zero-one) programming

Rate-distortion models for entropy constrained lattice quantization

Towards entropy constrained lattice vector quantization

Efficient algorithms for fixed-rate entropy-coded vector quantization