On the computation and the effectiveness of discrete sine transform

DOI10.1016/0045-7906(80)90018-XzbMath0456.65079OpenAlexW1965251847MaRDI QIDQ1151013

S. H. Smith

Publication date: 1980

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7906(80)90018-x

zbMATH Keywords

discrete Fourier transformdiscrete cosine transformWalsh-Hadamard transformdiscrete sine transformsparse-matrix factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40) Communication theory (94A05)

Related Items (2)

Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms

This page was built for publication: On the computation and the effectiveness of discrete sine transform