New Permutation Codes Using Hadamard Unscrambling
01 January 1987
A new class of codes for data compression is discribed 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 1/2 is considered: A 16-bit code for a block length of 32 samples. All coding and decoding steps are fast, so that real-time applications were cheap hardware can be anticipated.