50 search results - page 5 / 10 » Deriving the Fast Fourier Algorithm by Calculation |
ICESS
2004
Springer
15 years 5 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
135
click to vote
QCQC
1998
Springer
15 years 3 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
CSDA
2007
14 years 11 months ago
2007
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
93
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...