Abstract

Kernel affine projection algorithm (KAPA) is an efficient online kernel learning method, because it not only inherits the advantages of other kernel adaptive filtering (KAF) algorithms, but also reduces the gradient noise significantly. More importantly, it provides a unifying framework for many KAF algorithms. However, suffering from huge computational load, especially when network size is large, it is not suitable for real-time applications. In order to extend its availability, we design a reconfigurable parallel FPGA accelerator for it. The generally used Gaussian kernel is chosen. Moreover, a novel quantization method is adopted to constrain the network size, so as to further reduce computational load and storage overhead. The proposed accelerator allows multiple input data to be processed simultaneously, accelerating the execution rate. Shift registers are used to record the results of different input data. The codebook and coefficients are updated for each input in sequential order along with the shifting of registers constantly. Finally, the FPGA accelerator with eight datapaths, which works at 100MHz, achieves an average speedup of 404.47 versus C code running on a 3GHz Intel(R) Core(TM) i5-2320 CPU.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.