• DocumentCode
    3382716
  • Title

    On the AER convolution processors for FPGA

  • Author

    Linares-Barranco, A. ; Paz-Vicente, R. ; Gómez-Rodríguez, F. ; Jiménez, A. ; Rivas, M. ; Jiménez, G. ; Civit, A.

  • Author_Institution
    Robotic & Technol. of Comput. Group, Univ. of Seville, Sevilla, Spain
  • fYear
    2010
  • fDate
    May 30 2010-June 2 2010
  • Firstpage
    4237
  • Lastpage
    4240
  • Abstract
    Image convolution operations in digital computer systems are usually very expensive operations in terms of resource consumption (processor resources and processing time) for an efficient Real-Time application. In these scenarios the visual information is divided into frames and each one has to be completely processed before the next frame arrives in order to warranty the real-time. A spike-based philosophy for computing convolutions based on the neuro-inspired Address-Event-Representation (AER) is achieving high performances. In this paper we present two FPGA implementations of AER-based convolution processors for relatively small Xilinx FPGAs (Spartan-II 200 and Spartan-3 400), which process 64×64 images with 11×11 convolution kernels. The maximum equivalent operation rate that can be reached is 163.51 MOPS for 11×11 kernels, in a Xilinx Spartan 3 400 FPGA with a 50MHz clock. Formulations, hardware architecture, operation examples and performance comparison with frame-based convolution processors are presented and discussed.
  • Keywords
    convolution; field programmable gate arrays; image processing; AER convolution processors; FPGA; address-event-representation; convolution kernels; image convolution operations; resource consumption; Biological system modeling; Brain modeling; Circuits; Convolution; Field programmable gate arrays; Filters; Hardware; Kernel; Neurons; Real time systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems (ISCAS), Proceedings of 2010 IEEE International Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4244-5308-5
  • Electronic_ISBN
    978-1-4244-5309-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.2010.5537577
  • Filename
    5537577