A low multiplicative complexity fast recursive DCT-2 algorithm

Details A low multiplicative complexity fast recursive DCT-2 algorithm A low multiplicative complexity fast recursive DCT-2 algorithm

2012-03-15

arxiv.org/abs/1203.3442v1

Computer Science

Information Theory

4 pages, 2 figures

Scientific paper

A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, the rest 15 are scaling factors that can be compensated in the post-processing. The derivation of the algorithm is based on the algebraic signal processing theory (ASP).

Affiliated with

Also associated with

No associations

Rating

A low multiplicative complexity fast recursive DCT-2 algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A low multiplicative complexity fast recursive DCT-2 algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A low multiplicative complexity fast recursive DCT-2 algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31949