Please use this identifier to cite or link to this item:
|Title:||Sliding transforms for efficient implementation of transform domain adaptive filters||Authors:||Farhang-Boroujeny, B.
|Issue Date:||Jul-1996||Citation:||Farhang-Boroujeny, B., Lee, Y., Ko, C.C. (1996-07). Sliding transforms for efficient implementation of transform domain adaptive filters. Signal Processing 52 (1) : 83-96. ScholarBank@NUS Repository. https://doi.org/10.1016/0165-1684(96)00064-3||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.||Source Title:||Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/81198||ISSN:||01651684||DOI:||10.1016/0165-1684(96)00064-3|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 31, 2020
WEB OF SCIENCETM
checked on Mar 23, 2020
checked on Mar 29, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.