مقاله‌ی دسترسی آزاد

Inner Product Computation In-Memory Using Distributed Arithmetic

چکیده

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 signal processing (DSP) application and complexity of multipliers increases greatly with bit-width. Distributed arithmetic (DA) look-up tables adder-shifter module achieve multiplier-less efficient DSP architectures, particularly when one vectors constant known advance. Due memory wall, DA can be made furthermore latency energy-efficient implemented ‘in memory’. In this work, first time, we propose two design techniques compute completely DA. This accomplished by storing precomputed table contents ReRAM array implementing also same array. The majority gates which are turn realized READ operations Two methods mapping: latency-optimized area-optimized their comparison terms area presented. method-1 achieves $\approx 60$ % energy savings compared CMOS method-2 10.59 times higher throughput CMOS.

اسناد مشابه

  • 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

  • Improved Error Bounds for Inner Products in Floating-Point Arithmetic

    سند علمی۲۰۱۳SIAM J. Matrix Analysis ApplicationsClaude-Pierre Jeannerod, Siegfried M. Rump

    Given two floating-point vectors x, y of dimension n and assuming rounding to nearest, we show that if no underflow or overflow occurs, any evaluation order for inner product returns a floating-point number r̂ such that |r̂ − xT y| 6 nu|x|T |y| with u the unit roundoff. This resu

  • 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

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

    سند علمی۱۹۹۵ASAPWenzhe Luo, Graham A. Jullien, Neil M. Wigley, William C. Miller

    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