Kronecker Products, Unitary Matrices and Signal Processing Applications
- 1 December 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 31 (4) , 586-613
- https://doi.org/10.1137/1031127
Abstract
Discrete unitary transforms are extensively used in many signal processing appli- cations, and in the developmefit of fast algorithms Kronecker products have proved quite useful. In this semitutorial paper, we briefly review properties of Kronecker products and direct sums of matrices, which provide a compact notation in treating patterned matrices. A generalized matrix product, which inherits some useful algebraic properties from the standard Kronecker product and allows a large class of discrete unitary transforms to be generated from a single recursion formula, is then introduced. The notation is intimately related to sparse matrix factorizations, and exa.mples are included illustrating the utility of the new notation in signal processing applications. Finally, some novel characteristics of Hadamard transforms and polyadic permutations are derived in the framework of Kronecker products.Keywords
This publication has 28 references indexed in Scilit:
- The Fast Hartley Transform AlgorithmIEEE Transactions on Computers, 1987
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- m-adic (polyadic) invariance and its applicationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Optimal Dyadic Models of Time-Invariant SystemsIEEE Transactions on Computers, 1975
- Orthogonal Transforms for Digital Signal ProcessingPublished by Springer Nature ,1975
- Slant Transform Image CodingIEEE Transactions on Communications, 1974
- Fast Complex BIFORE Transform by Matrix PartitioningIEEE Transactions on Computers, 1971
- On Matrix Partitioning and a Class of AlgorithmsIEEE Transactions on Education, 1970
- Kronecker Matrices, Computer Implementation, and Generalized SpectraJournal of the ACM, 1970
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965