Inner product is an important operation in image processing applications dealing with discrete orthogonal transforms (DOTs). In this paper, a novel power efficient architecture for the computation of inner product is proposed, along with an analysis of the dynamic power consumption of the proposed algorithm. A comparison is made with the conventional distributed arithmetic (DA) approach for computing the inner product. The proposed architecture has been tested and implemented on the Xilinx Virtex-E FPGA. Results obtained have shown that, the total power consumption and the number of LUT required to implement the design of the proposed algorithm is reduced by 51% and 77% respectively in comparison with the conventional DA approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An area efficient low power inner product computation for discrete orthogonal transforms


    Contributors:


    Publication date :

    2005-01-01


    Size :

    161558 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Area Efficient Low Power Inner Product Computation for Discrete Orthogonal Transforms

    Chandrasekaran, S. / Amira, A. | British Library Conference Proceedings | 2005



    Generating Pseudostochastic Basis Functions for Discrete Orthogonal Transforms

    Dmitriev, A. G. / Chernov, V. M. | British Library Online Contents | 2001


    Arithmetic methods in the theory of discrete orthogonal transforms

    Chernov, V. M. / Russian Academy of Sciences / Samara State Aerospace University et al. | British Library Conference Proceedings | 1994


    On the Parametrization of Fast Algorithms of Discrete Orthogonal Transforms

    Chernov, V. M. | British Library Online Contents | 1996