Discrete sine transform and its inverse - realization through recursive algorithms

DOI10.1002/CTA.447MaRDI QIDQ3563527zbMATH OpenOpenAlexFDO

Authors Priyanka Jain, Balbir Kumar, S. B. Jain

Publication date 31 May 2010

Published in International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cta.447

zbMATH Keywords

recursive structuresDiscrete Fourier Transform (DFT)Discrete Sine Transform (DST)Inverse Discrete Sine Transform (IDST)

Mathematics Subject Classification ID

Design techniques (robust design, computer-aided design, etc.) (93B51)

Recommendations

• A fast recursive algorithm for the discrete sine transform
• Fast discrete sine transform algorithms
• New fast recursive algorithms for the computation of discrete cosine and sine transforms
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• A fast algorithm for the discrete sine transform implemented by the fast cosine transform

Cited in

(2)

• Signal flow graph approach to efficient and forward stable DST algorithms
• Fast computation of the discrete Hartley transform

This page was built for publication: Discrete sine transform and its inverse - realization through recursive algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563527)