SLIDING TRANSFORMS FOR EFFICIENT IMPLEMENTATION OF TRANSFORM DOMAIN ADAPTIVE FILTERS

An efficient technique for the implementation of the widely used ortho gonal transforms when their input samples are originating from a tap d elay line (TDL), and the transformation has to be performed after each new sample enters the TDL, is addressed. The redundancy in the input data samples is used to reduce the computational complexity of these t ransforms from order of N log N to order of N, where N is the length o f transform. The term sliding is used to refer to such transforms. We use the Bruun's (1978) technique, to propose a number of sliding imple mentations for the most commonly used transforms. Our emphasis is on t he transform domain adaptive filters which employ such transforms for decorrelating their input data.