Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms
Open Access
- 14 October 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 141181-141198
Abstract
This paper presents factorizations of each discrete sine transform (DST) matrix of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices. Based on the proposed matrix factorization formulas, reduced multiplication complexity, recursive, and radix-2 DST I-IV algorithms are presented. We will present the lowest multiplication complexity DST-IV algorithm in the literature. The paper fills a gap in the self-recursive, exact, and radix-2 DST I-IIII algorithms executed via diagonal, bidiagonal, scaled orthogonal, and simple matrix factors for any input $n=2^{t} \; (t \geq 1)$ . The paper establishes a novel relationship between DST-II and DST-IV matrices using diagonal and bidiagonal matrices. Similarly, a novel relationship between DST-I and DST-III matrices is proposed using sparse and diagonal matrices. These interweaving relationships among DST matrices enable us to bridge the existing factorizations of the DST matrices with the proposed factorization formulas. We present signal flow graphs to provide a layout for realizing the proposed algorithms in DST-based integrated circuit designs. Additionally, we describe an implementation of algorithms based on the proposed DST-II and DST-III factorizations within a double random phase encoding (DRPE) image encryption scheme.Keywords
Funding Information
- Faculty Innovative Research in Science and Technology
- Embry-Riddle Aeronautical University, USA (13238)
This publication has 57 references indexed in Scilit:
- Discrete sine transform and its inverse—realization through recursive algorithmsInternational Journal of Circuit Theory and Applications, 2007
- The discrete fractional cosine and sine transformsIEEE Transactions on Signal Processing, 2001
- Restructured recursive DCT and DST algorithmsIEEE Transactions on Signal Processing, 1994
- New fast recursive algorithms for the computation of discrete cosine and sine transformsIEEE Transactions on Signal Processing, 1992
- Direct methods for computing discrete sinusoidal transformsIEE Proceedings F Radar and Signal Processing, 1990
- A fast algorithm for the discrete sine transform implemented by the fast cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A Fast Computational Algorithm for the Discrete Sine TransformIEEE Transactions on Communications, 1980
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965