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, multiplier 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 using fast Hartley transform (FHT). Next, the redundancy of the structure is eliminated by using several characteristics of rotation matrix. Then, multiplierless DCT is obtained by approximating rotation matrices to multiplierless lifting structures with adders and bit-shifters. Finally, the proposed DCT is validated by comparing with the conventional DCTs in image coding.