This directory contains the following: [fajd.m] The FAJD algorithm for finding the approximate general (non-orthogonal) joint diagonalizer of a set of matrices. [test.m] A routine to demonstrates the way to call FAJD after generating a set of

Compression speed ~= Decompression speed. (around 200-300 MB/s) CPU notes: LZZQ uses 32KB dictionary, reduce to 16KB (change HASH_SIZE to 4*1024) for good L1 cache access (with little reduction in ratio).

Abstract— We propose a simple speech compression algorithm using subband division and ADPCM (Adaptive Differential Pulse Code Modulation) algorithm. Although speech data are stored in a semiconductor memory device, its capacity and the availa