• DocumentCode
    2041705
  • Title

    An FPGA implementation for a high throughput adaptive filter using distributed arithmetic

  • Author

    Allred, Daniel J. ; Huang, Walter ; Krishnan, Venkatesh ; Yoo, Heejong ; Anderson, David V.

  • Author_Institution
    Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    2004
  • fDate
    20-23 April 2004
  • Firstpage
    324
  • Lastpage
    325
  • Abstract
    In this paper, an FIR adaptive filter implementation using a multiplier-free architecture is presented. The implementation is based on distributed arithmetic (DA) which substitutes multiply-and-accumulate operations with a series of look-up-table (LUT) accesses. This can be achieved at the cost of a moderate increase in memory usage. The proposed design performs an LMS-type adaptation on a sample-by-sample basis. This is accomplished by an innovative LUT update using a matched auxiliary LUT. The system is implemented on an FPGA that enables rapid prototyping of digital circuits. Implementation results are provided to demonstrate that a high-speed LMS adaptive filter can be realized employing the proposed architecture.
  • Keywords
    FIR filters; adaptive filters; digital filters; distributed arithmetic; field programmable gate arrays; least mean squares methods; table lookup; FIR adaptive filter; FPGA implementation; digital circuits; distributed arithmetic; high throughput adaptive filter; least mean squares methods; lookup table; multiplier free architecture; rapid prototyping; sample-by-sample adaptation; Adaptive filters; Arithmetic; Costs; Digital circuits; Field programmable gate arrays; Finite impulse response filter; Least squares approximation; Prototypes; Table lookup; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field-Programmable Custom Computing Machines, 2004. FCCM 2004. 12th Annual IEEE Symposium on
  • Print_ISBN
    0-7695-2230-0
  • Type

    conf

  • DOI
    10.1109/FCCM.2004.15
  • Filename
    1364660