Binary Toeplitz-Kronecker Transforms and their Applications
P.S. Moharir · IETE Journal of Research · 1974
Two binary orthonormal Toeplitz kernels of order two and four binary orthonormal Toeplitz kernels of order four exist. Their inverses also belong to these groups of two and four kernels respectively. A large number of binary orthonormal transforms can be formed by Kronecker products of these Toeplitz kernels. Fast computational algorithms exist for all these transforms based on the fact that they are derived by Kronecker products of Toeplitz kernels. These algorithms lend easily to hardware implementation with the feature of modular assembly such that when one module is replaced by another, a different Toeplitz-Kronecker transform is obtained This feature is exploited for the programmed transform domain secrecy coding schemes.