Leveraging FPGA for k-Nearest Neighbours Classifier: Design and Performance Study
In the era of big data, real-time processing and fast decision-making are essential. The k-Nearest Neighbors (k-NN) algorithm, though effective, becomes computationally expensive on traditional CPUs, especially with large or high-dimensional datasets. Implementing k-NN on Field-Programmable Gate Arrays (FPGAs) offers a solution by leveraging parallel processing for accelerated computation. This work presents an in-depth analysis of FPGA-based k-NN implementation using HDL, comparing its performance with CPUs and GPUs. The results demonstrate significant improvements in speed and efficiency, highlighting the potential of FPGA-based acceleration in machine learning applications. This approach paves the way for scalable, high-performance classification in domains such as healthcare, finance, and e-commerce.
Authors
- Hardik Joshi (ORCID: https://orcid.org/0000-0002-5431-0173)
- Manish I. Patel (ORCID: https://orcid.org/0000-0003-2948-9770)
- D. K. Jain (ORCID: https://orcid.org/0000-0001-6151-816X)
- D. Parikh
Institutions
- Nirma University (IN)
Publication Details
- Published
- 2025-04-05
- DOI
- https://doi.org/10.1109/devic63749.2025.11012434
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00