Fast Algorithms and Architectures for 8-Point DST-II/DST-VII Approximations

Renato J. Cintra, Fábio M. Bayer, Arjuna Madanayake, Uma Potluri, Amila Edirisuriya · Journal of Circuits Systems and Computers · 2016

Multiplier-free fast algorithms are derived and analyzed for realizing the 8-point discrete sine transform of type II and type VII (DST-II and DST-VII) transforms with applications in image and video compression. A new fast algorithm is identified using numerical search methods for approximating DST-VII without employing multipliers. In addition, recently proposed fast algorithms for approximating the 8-point DCT-II are now extended to approximate DST-II. All proposed approximations for DST-II and DST-VII are compared with ideal transforms, and circuit complexity is measured using FPGA-based rapid prototypes on a 90[Formula: see text]nm Xilinx Virtex-4 device. The proposed architectures find applications in emerging video processing standards such as H.265/HEVC.

Read the paper · More papers on PaperTik