A low complexity 2-power transform for video compression

Video applications in mobile devices call for low complexity video compression algorithms. This paper presents a low complexity 2-power transform for video compression. The elements of the transform matrix are all in 2's low-order power. The transform computation requires only 28 additions and 10 binary shifts. Computational complexity analysis, coding gains and RD curve comparison show that our 2-power transform is simpler than IntDCT and ICT, while its compression efficiency is similar to that of IntDCT, higher than that of ICT and much higher than that of DT and WHT. The low magnitude of the elements also avoids large memory consumption, a problem of many integer transforms.