Abstract

A computational and hardware-efficient second-order infinite impulse response filter structure is proposed in this paper. It can compute discrete cosine transform (DCT) with improved processing speed and is valid for N = 2r, where N is the length of the input sequence and r > 1. A new algorithm is also proposed in this paper which is an improvement over previously reported algorithms in the literature. The proposed algorithm reduces the total number of real multiplications and additions in comparison with the existing algorithms. Using the suggested algorithm, computational cycles required to compute a DCT coefficient are less which further reduces the truncation error while processing a long length of input data.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call