Low complexity 16-point DCT approximation for image compression

This paper presents an orthogonal multiplier less 16-point DCT transform. The proposed transform was made to have low computational complexity for efficient image compression. The proposed fast transform algorithm has 38 additions and contains no multiplier or bit-shifting. Assessment of the proposed transform was made using computational complexity, and image coding performance measures. The proposed transform has to our best of knowledge the best cost-benefit ratio on comparing with other state of art transform present in literature. The efficiency of the proposed 16-point DCT approximation was evaluated using PSNR and SSIM measurement.