Title: Relationship between two algorithms for discrete cosine transform
Abstract:Two contributions are made to the implementation of fast discrete cosine transform algorithms. The first uses Hadamard ordering to improve the regularity of the Lee fast cosine transform (FCT) algorit...Two contributions are made to the implementation of fast discrete cosine transform algorithms. The first uses Hadamard ordering to improve the regularity of the Lee fast cosine transform (FCT) algorithm for the discrete cosine transform (DCT). The second derives a close relationship between the Lee FCT and the recursive algorithm for the DCT.Read More
Publication Year: 1991
Publication Date: 1991-06-20
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot