ویراساینس.
سند علمی

An array processor for inner product computations using a Fermat number ALU

Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, William C. Miller, Zhongde Wang

چکیده

Computing over cross product rings has several advantages for VLSI signal processing [1]. These include the reduction of clock skew problems, natural fault tolerance [2], and ease of testing [3]. More traditional advantages include the promise of high speed arithmetic because of the removal of the carry, but the former advantages, we feel, are the most important. Although application areas are quite limited, applications to high throughput DSP are prime targets. The usual finite ring mapping strategy is based on the Residue Number System [5], in which data and coefficients are mapped via the modulo reduction operator . Calculations are component wise (over the cross product ring) and

اسناد مشابه

  • Inner product computation for sparse iterative solvers on distributed supercomputer

    سند علمی۲۰۱۲Sheng-Xin Zhu, Tong-Xiang Gu, Xing-Ping Liu

    Recent years have witnessed that iterative Krylov methods without re-designing are not suitable for distribute supercomputers because of intensive global communications. It is well accepted that re-engineering Krylov methods for prescribed computer architecture is necessary and i

  • Verifying Outsourced Inner Product Computation via Vector Aggregation in Cloud Computing

    سند علمی۲۰۱۴Qin ZHANG, Yan XIONG, Qiwei LU

    Outsourced computation has been extensively studied in a number of computer application fields with the increasing prevalence of cloud computing. As the basis and the fundamental operation, inner product computation of vectors, has also been put forwarded. As the service provider

  • Initialization and inner product computations of wavelet transform by interpolatory subdivision scheme

    سند علمی۱۹۹۹IEEE Trans. Signal ProcessingYu-Ping Wang, Ruibin Qu

    1 Interpolatory basis function 2 (t) and its rst and second derivatives 0 2 (t) and 00 2 (t). 11 2 Interpolation of the function f(t) = e t sin(t); t = 0; 0:125; 0:25; :::; 10 (solid line) using the interpolatory subdivision scheme (dotted line) and the Shannon bases sinc(t) (sho

  • Fast Inner Product Computation on Short Buses

    سند علمی۲۰۰۲VLSI DesignRong Lin, Stephan Olariu

    This Article is brought to you for free and open access by the Computer Science at ODU Digital Commons. It has been accepted for inclusion in Computer Science Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact digitalc

  • Inner Product Computation In-Memory Using Distributed Arithmetic

    مقاله‌ی دسترسی آزاد۲۰۲۲IEEE Transactions on Circuits and Systems I-regular Papers['Vijaya Lakshmi', 'Vikramkumar Pudi', 'John Reuben', '']

    In-memory computing using emerging technologies such as Resistive Random-Access Memory (ReRAM) has been proposed a promising substitute for future applications to address the ‘von Neumann bottleneck’. Multiplication is key component inner product computation in every digital sign

  • Superscalar pipelined inner product computation unit for signed unsigned number

    مقاله‌ی دسترسی آزاد۲۰۱۶Perspectives in ScienceRavindra P.Rajput, M.N. ShanmukhaSwamy