Name
Abstract | ||
|---|---|---|
An efficient technique for the implementation of the widely used orthogonal transforms when their input samples are originating from a tap delay 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 transforms from order of N log N to order of N, where N is the length of transform. The term sliding is used to refer to such transforms. We use the Bruun's (1978) technique, to propose a number of sliding implementations for the most commonly used transforms. Our emphasis is on the transform domain adaptive filters which employ such transforms for decorrelating their input data. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0165-1684(96)00064-3 | Signal Processing |
Keywords | Field | DocType |
orthogonal transform, DFT, DHT, DCT, DST, adaptive filter | Control theory,Computer science,Discrete cosine transform,Algorithm,Implementation,Theoretical computer science,Redundancy (engineering),Adaptive filter,Time complexity,Computational complexity theory | Journal |
Volume | Issue | ISSN |
52 | 1 | 0165-1684 |
Citations | PageRank | References |
4 | 0.62 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Farhang-Boroujeny | 1 | 553 | 46.61 |
| Y. Lee | 2 | 142 | 21.99 |
| C. C. Ko | 3 | 169 | 29.60 |