The Development of Fast DST-I Algorithms for Short-Length Input Sequences

The subject of this paper is the development of rationalized algorithms of discrete sinusoidal transform of type I for short sequences of length N = 2, 3, 4, 5, 6, 7, and 8. Here, by the word “rationalization”, we mean the reduction of the number of arithmetic operations required to implement the al...

Full description

Saved in:
Bibliographic Details
Published inElectronics (Basel) Vol. 13; no. 24; p. 5056
Main Authors Raciborski, Mateusz, Cariow, Aleksandr, Bandach, Jakub
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.12.2024
Subjects
Algorithms
Arithmetic
Flow graphs
Sequences
Signal processing
United States
New Jersey
Online AccessGet full text

Cover

More Information
Summary:The subject of this paper is the development of rationalized algorithms of discrete sinusoidal transform of type I for short sequences of length N = 2, 3, 4, 5, 6, 7, and 8. Here, by the word “rationalization”, we mean the reduction of the number of arithmetic operations required to implement the algorithms. The arithmetic complexity of the developed algorithms is presented in the final table. For each algorithm, we also provide data flow graphs demonstrating the space–time structure of the computational processes. The algorithms were tested to verify their validity using MATLAB software (version R2023).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics13245056