MULTIPLIERLESS FAST ALGORITHM FOR DCT VIA FAST HARTLEY TRANSFORM

Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multi-plier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by us-ing fast Hartley transform (FHT). Next, the redundancy of the struc-ture is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation ma-trices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the con-ventional DCTs in image coding. Index Terms — Discrete cosine transform (DCT), fast Hartley transform (FHT), multiplierless lifting structur