A fast recursive algorithm for the discrete sine transform

1990/03/01 by A. Gupta, Aditi Gupta, K.R. Rao · 2 citations
Computer Science · Engineering · #Digital Filter Design and Implementation #Numerical Methods and Algorithms #Analog and Mixed-Signal Circuit Design

paper · doi:10.1109/29.106875

Abstract

A fast recursive algorithm for the discrete sine transform (DST) is developed. An N-point DST can be generated from two identical N/2-point DSTs. Besides being recursive, this algorithm requires fewer multipliers and adders than other DST algorithms. It can be considered as a generalization of the Cooley-Tukey FFT (fast Fourier transform) algorithm. The structure of the algorithm is suitable for VLSI implementation.>

Cited by

• PAGen: Phase-guided Amplitude Generation for Domain-adaptive Object Detection
• Trainable Time Warping: Aligning Time-Series in the Continuous-Time\n Domain

Related

• Signal Flow Graph Approach to Efficient DST I-IV Algorithms
• A low multiplicative complexity fast recursive DCT-2 algorithm
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• New Algorithms for Computing a Single Component of the Discrete Fourier Transform
• An algorithm for fast computation of the multiresolution discrete Fourier transform