Abstract
This chapter discusses author’s own research related to fast computation using the univariate plug-in algorithm, a type of a bandwidth selection algorithm. In contrast to the results presented in Chapter 5, this chapter describes a hardware-based method, which relies on utilizing the so-called field-programmable gate arrays (FPGA). FPGA devices are not often used for purposes of implementing purely numerical algorithms. The proposed implementation can be seen as a preliminary assessment of practical usability of such FPGA-based applications. We describe the notion of a high level synthesis (HLS) approach and then, move on to rewrite the plug-in algorithm in a way ready for a direct FPGA/HLS implementation. This is followed by a description of implementation preliminaries with certain concepts then being described in more detail. The final part of this chapter describes the results confirming the practical usability of FPGA chips for fast implementations of complex numerical algorithms
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Gramacki, A. (2018). FPGA-Based Implementation of a Bandwidth Selection Algorithm. In: Nonparametric Kernel Density Estimation and Its Computational Aspects. Studies in Big Data, vol 37. Springer, Cham. https://doi.org/10.1007/978-3-319-71688-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-71688-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71687-9
Online ISBN: 978-3-319-71688-6
eBook Packages: EngineeringEngineering (R0)