作者: Aleksandr Cariow , Łukasz Lesiecki
DOI: 10.3103/S0735272720090022
关键词: Multiplicative complexity 、 Set (abstract data type) 、 Matrix (mathematics) 、 SIGNAL (programming language) 、 Type (model theory) 、 Factorization 、 Algorithm 、 Discrete cosine transform 、 Computer science 、 Hardware complexity
摘要: Discrete cosine transforms are widely used in smart radioelectronic systems for processing and analysis of incoming information. The popularity using these transform is explained by the presence fast algorithms that minimize computational hardware complexity their implementation. Type-IV discrete occupies a special place list specified transformations. This article proposes several algorithmic solutions implementing type-IV transform. effectiveness proposed possibility factorization DCT-IV matrix, which leads to decrease implementation complexity. A set completely parallel DCT small lengths signal sequences (N = 2, 3, 4, 5, 6, 7, 8, 9) presented.