Implementation of quasi-Newton algorithm on FPGA for IoT endpoint devices

被引:0
|
作者
Huang S. [1 ]
Guo A. [1 ]
Su K. [1 ]
Chen S. [2 ]
Chen R. [2 ]
机构
[1] College of Physics and Information Engineering, Fuzhou University, Fuzhou
[2] VeriMake Innovation Lab, Nanjing Renmian Integrated Circuit Co., Ltd., Nanjing
关键词
BFGS-QN; edge computing; field-programmable gate array; FPGA; internet of things; IoT; machine learning; nonlinear optimisation;
D O I
10.1504/IJSN.2022.123300
中图分类号
学科分类号
摘要
With the recent developments in the internet of things (IoT), there has been a significant rapid generation of data. Theoretically, machine learning can help edge devices by providing a better analysis and processing of data near the data source. However, solving the nonlinear optimisation problem is time-consuming for IoT edge devices. A standard method for solving the nonlinear optimisation problems in machine learning models is the Broyden-Fletcher-Goldfarb-Shanno (BFGS-QN) method. Since the field-programmable gate arrays (FPGAs) are customisable, reconfigurable, highly parallel and cost-effective, the present study envisaged the implementation of the BFGS-QN algorithm on an FPGA platform. The use of half-precision floating-point numbers and single-precision floating-point numbers to save the FPGA resources were adopted to implement the BFGS-QN algorithm on an FPGA platform. The results indicate that compared to the single-precision floating-point numbers, the implementation of the mixed-precision BFGS-QN algorithm reduced 27.1% look-up tables, 18.2% flip-flops and 17.9% distributed random memory. Copyright © 2022 Inderscience Enterprises Ltd.
引用
收藏
页码:124 / 134
页数:10
相关论文
共 50 条
  • [21] A new regularized quasi-Newton algorithm for unconstrained optimization
    Zhang, Hao
    Ni, Qin
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 259 : 460 - 469
  • [22] Acceleration of the EM algorithm by using quasi-Newton methods
    Jamshidian, M
    Jennrich, RI
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1997, 59 (03): : 569 - 587
  • [23] A block Quasi-Newton algorithm implemented in the frequency domain
    Berberidis, K
    Palicot, J
    1996 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, CONFERENCE PROCEEDINGS, VOLS 1-6, 1996, : 1731 - 1734
  • [24] ANALYSIS OF A FAST QUASI-NEWTON ADAPTIVE FILTERING ALGORITHM
    MARSHALL, DF
    JENKINS, WK
    ADVANCES IN COMMUNICATIONS AND SIGNAL PROCESSING, 1989, 129 : 251 - 262
  • [25] Quasi-Newton Iterative Projection Algorithm for Sparse Recovery
    Jing, Mingli
    Zhou, Xueqin
    Qi, Chun
    NEUROCOMPUTING, 2014, 144 : 169 - 173
  • [26] Fast adaptive LDA using quasi-Newton algorithm
    Moghaddam, H. Abrishami
    Matinfar, M.
    PATTERN RECOGNITION LETTERS, 2007, 28 (05) : 613 - 621
  • [27] Joint Independent Subspace Analysis: A Quasi-Newton Algorithm
    Lahat, Dana
    Jutten, Christian
    LATENT VARIABLE ANALYSIS AND SIGNAL SEPARATION, LVA/ICA 2015, 2015, 9237 : 111 - 118
  • [28] Improved Quasi-Newton Adaptive-Filtering Algorithm
    Ali, Md Zulfiquar
    Antoniou, Andreas
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2010, 57 (08) : 2109 - 2118
  • [29] HPC compact quasi-Newton algorithm for interface problems
    Santiago, Alfonso
    Zavala-Ake, Miguel
    Borrell, Ricard
    Houzeaux, Guillaume
    Vazquez, Mariano
    JOURNAL OF FLUIDS AND STRUCTURES, 2020, 96
  • [30] ANALYSIS OF A FAST QUASI-NEWTON ADAPTIVE FILTERING ALGORITHM
    MARSHALL, DF
    JENKINS, WK
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1989, 129 : 251 - 262