DocumentCode :
942432
Title :
New permutation codes using Hadamard unscrambling (Corresp.)
Author :
Schroeder, M.R. ; Sloane, N. A J
Volume :
33
Issue :
1
fYear :
1987
fDate :
1/1/1987 12:00:00 AM
Firstpage :
144
Lastpage :
146
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 
is considered: a 
-bit code for a block length of 
samples. All coding and decoding steps are fast, so that real-time applications with cheap hardware can be anticipated.
is considered: a -bit code for a block length of samples. All coding and decoding steps are fast, so that real-time applications with cheap hardware can be anticipated.Keywords :
Hadamard transforms; Permutation coding; Source coding; Speech coding; Bit rate; Data compression; Decoding; Error correction; Error correction codes; Frequency; Humans; Linear predictive coding; Rate-distortion; Speech coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1987.1057260
Filename :
1057260
Link To Document :
