Fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point discrete cosine transform (DCT) or discrete sine transform (DST) can be computed from two N/2-point DCTs or DSTs. Compared to the existing algorithms the algorithms have less multiplications by two, and add operations are better positioned, giving rise to faster computation and easier VLSI implementation
Published in:
Signal Processing, IEEE Transactions on
(Volume:40
,
Issue:
8
)
Date of Publication:
Aug 1992
- Page(s):
-
2083
-
2086
- ISSN :
-
1053-587X
- INSPEC Accession Number:
-
4273654
- Digital Object Identifier :
-
10.1109/78.150010
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Aug 1992
- Sponsored by :
-
IEEE Signal Processing Society