An Efficient Algorithm for the VLSI Implementation of Inverse DCT Based on Quasi-Circular Correlation Structures

Abstract

This paper proposes a new VLSI algorithm for a inverse discrete cosine transform (IDCT) designed for an efficient implementation of the obfuscation technique. The proposed algorithm is using quasi-circular correlation structures and is highly regular and modular. The method presents a low hardware complexity, a high throughput and it can be mapped using a low number of I/O channels which in turn translates to a low bandwidth on linear systolic arrays. Additionally, most of the parts of the architecture are working at a significantly lower frequency than the main systolic array. Using the time-varying obfuscation method, the proposed algorithm presents the additional advantage in the field of hardware security and it can be efficiently implemented on a VLSI chip with a low power consumption due to its low hardware complexity.