Fast Computation Of Orthogonal Transforms Using Sparse Mixed Kernels


A two-stage computation of orthogonal transforms that leads to faster algorithms with reduced numbers of multiplications is the subject of this paper. The first stage (a mixed transform) preprocesses the transform using a mixed transform mauix. while stage two is a correction which. in this case is given a a WalshHadamard transform (WHT). Application to… (More)
DOI: 10.1109/ISSPA.1996.615132


3 Figures and Tables