A low power and memory efficient distributed arithmetic design and its DCT application
Run-Chen Chen, Tian‐Sheuan Chang, Chein-Wei Jen · 2005
This paper presents a low power Distributed Arithmetic (DA) realization of cyclic convolution and its application to discrete cosine transform (DCT). We exploit DA technique, and the redundancy appeared in the rotated input data of cyclic convolution to realize the cyclic convolution by using the scheme of address morphing that converts the distribution of DA input address into a subset of it with minimal transition probability such that the memory sue and transition activity in the DA design can be minimized to achieve memory efficient as well as low power consumption. Regarding the DCT design, we exploit the symmetry property of DCT coefficients to reformulate the 1D DCT to two smaller perfect cyclic forms with difference and sum of the input samples, and then apply the proposed DA design to facilitate an efficient realization of I-D DCT. Furthermore, according to the property of signal correlation, we combine the MSB rejection technique with the proposed GDA design to further reduce the cycles of DA computation for the DCT outputs with the difference of input samples. As shown in the simulation result, the design with the proposed approach facilitates not only reducing the memory size, but also improving the power consumption significantly than the conventional one.