Fast algorithms for the DFT and other sinusoidal transforms | IEEE Journals & Magazine | IEEE Xplore

Fast algorithms for the DFT and other sinusoidal transforms


Abstract:

A new matrix factorization is proposed for DCT-IV, which is the basis of fast algorithms for many sinusoidal transforms. The new fast algorithm for DFT, based on the new ...Show More

Abstract:

A new matrix factorization is proposed for DCT-IV, which is the basis of fast algorithms for many sinusoidal transforms. The new fast algorithm for DFT, based on the new factorization, requires the same number of multiplications and far fewer additions than the Preuss algorithm.
Page(s): 642 - 644
Date of Publication: 29 January 2003
Print ISSN: 0096-3518

Contact IEEE to Subscribe

References

References is not available for this document.