New permutation codes using Hadamard unscrambling (Corresp.)
- 1 January 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (1), 144-146
- https://doi.org/10.1109/tit.1987.1057260
Abstract
A new class of codes for data compression is described that combines permutations with the fast Hadamard transform (FHT). It was invented for digital speech compression based on linear predictive coding (LPC), but may be useful for other data compression applications. One particular code with rate\frac{1}{2}is considered: a16-bit code for a block length of32samples. All coding and decoding steps are fast, so that real-time applications with cheap hardware can be anticipated.Keywords
This publication has 8 references indexed in Scilit:
- Rate distortion theory and predictive codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Improved quantizer for adaptive predictive coding of speech signals at low bit ratesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Voronoi regions of lattices, second moments of polytopes, and quantizationIEEE Transactions on Information Theory, 1982
- Optimizing digital speech coders by exploiting masking properties of the human earThe Journal of the Acoustical Society of America, 1979
- Permutation codes for sourcesIEEE Transactions on Information Theory, 1972
- Some Mathematical Properties of a Scheme for Reducing the Bandwidth of Motion Pictures by Hadamard SmearingBell System Technical Journal, 1970
- Codes for Multiplex SpectrometryApplied Optics, 1969
- Permutation modulationProceedings of the IEEE, 1965