The Development of Fast DST-I Algorithms for Short-Length Input Sequences
Open Access
- 23 December 2024
- journal article
- research article
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 5056
Abstract
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).Keywords
This publication has 37 references indexed in Scilit:
- Design of the Processors for Fast Cosine and Sine Fourier TransformsCircuits, Systems, and Signal Processing, 2022
- New single‐carrier transceiver scheme based on the discrete sine transformThe Journal of Engineering, 2014
- Fast Algorithms for Signal Processing2010
- An Adaptive Interface for the Efficient Computation of the Discrete Sine Transform2008
- Discrete cosine and sine transforms—regular algorithms and pipeline architecturesSignal Processing, 2006
- Interpolation using the discrete sine transform with increased accuracyElectronics Letters, 1993
- Interpolation using the fast discrete sine transformSignal Processing, 1992
- A prime-factor decomposed algorithm for the discrete sine transformComputers and Electrical Engineering, 1990
- Fast discrete sine transform algorithmsSignal Processing, 1990
- On the computation and the effectiveness of discrete sine transformComputers and Electrical Engineering, 1980