ScholarLens Back to search
2002•Unpublished venueRequires access

Recursive algorithm for the discrete cosine transform with regular structure

Zhongde Wang, G.A. Jullien, William C. Miller

Open publisher page 2 citations

Abstract

In this paper we derive a new recursive algorithm for the discrete cosine transform (RDCT) which differs from the existing RDCT in the following aspects: (1) No shifts of data are required within our algorithm; (2) only regular Cooley-Tukey type butterfly structures are involved; (3) the multiplication coefficients in our algorithm can be generated by a simple recursion without a requirement for trigonometric functions. The structure of the new algorithm is almost identical to that of Lee's FCT, which is widely thought to be the simplest.>

About this research paper

What this paper is about

In this paper we derive a new recursive algorithm for the discrete cosine transform (RDCT) which differs from the existing RDCT in the following aspects: (1) No shifts of data are required within our algorithm; (2) only regular Cooley-Tukey type butterfly structures are involved; (3) the multiplication coefficients in our algorithm can be generated by a simple recursion without a requirement for trigonometric functions. The structure of the new algorithm is almost identical to that of Lee's FCT, which is widely thought to be the simplest.>

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper we derive a new recursive algorithm for the discrete cosine transform (RDCT) which differs from the existing RDCT in the following aspects: (1) No shifts of data are required within our algorithm; (2) only regular Cooley-Tukey type butterfly structures are involved; (3) the multiplication coefficients in our algorithm can be generated by a simple recursion without a requirement for trigonometric functions. The structure of the new algorithm is almost identical to that of Lee's FCT, which is widely thought to be the simplest.>

Key concepts: Recursion (computer science), Trigonometric functions, Trigonometry, Discrete cosine transform, Algorithm, Modified discrete cosine transform, Simple (philosophy), Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Recursive algorithm for the discrete cosine transform with regular structure — Research Paper | ScholarLens