Title :
Fast transform algorithms representation by Kronecker product
Author_Institution :
Autom. Control Dept., Polytech. Inst., Iasi, Romania
Abstract :
The Kronecker products decomposition of discrete unitary transforms and a class of fast nonlinear transforms is presented. A useful formalism for fast transform representation that can be generated by using a single recursion formula based on Kronecker notation is described
Keywords :
transforms; Kronecker notation; Kronecker product; decomposition; discrete unitary transforms; fast nonlinear transforms; recursion formula; Automatic control; Discrete transforms; Fast Fourier transforms; Filtering; Image processing; Matrix decomposition; Pattern recognition; Signal processing algorithms; Sparse matrices; Speech processing;
Conference_Titel :
Electrotechnical Conference, 1991. Proceedings., 6th Mediterranean
Conference_Location :
LJubljana
Print_ISBN :
0-87942-655-1
DOI :
10.1109/MELCON.1991.161858
