Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

IEEE Access

卷:9

Levi E. Lingsch¹  Sirani M. Perera² 

[1] Department of Aerospace Engineering, Embry-Riddle Aeronautical University, Daytona Beach, FL, USA;

[2] Department of Mathematics, Embry-Riddle Aeronautical University, Daytona Beach, FL, USA;

关键词: Discrete sine transforms;    self/completely recursive and radix-2 algorithms;    complexity and performance of algorithms;    sparse and orthogonal matrices;    signal flow graphs;   

DOI  :  10.1109/ACCESS.2021.3120051

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown