FPGA-based Accelerator for FFT-Processing in Edge Computing
Authors:
- 7 September 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 590-595
Abstract
Edge computing bridges the gap between end devices on the Internet of Things (IoT) and central, server-based IT services by accelerating tasks which otherwise could not be executed on the IoT device itself. The Fast Fourier Transformation (FFT) is used as an example for the arithmetic tasks to be supported. To support such specific applications, we envisage a concept for edge computing in which co-processing is implemented using Field Programmable Gate Arrays (FPGAs). This article first describes certain edge computing requirements using the example of moving drones. This involves the case-by-case reconfiguration of the computation hardware and a handover mechanism from one edge node to another. Then follows the description of an FPGA-based FFT accelerator unit and its extension to an FFT co-processor. The development took place under the proviso that, for example, drones can request different co-processors and that the drones can also change the edge node when changing a radio cell, which results in a handover of the co-processor context. Regarding the FPGA part this means that the co-processor is part of a partially reconfigurable environment, and the co-processor must support the handover mechanisms in terms of hardware. Finally, the need for FPGA resources is analyzed, also in comparison with alternative solutions.Keywords
This publication has 14 references indexed in Scilit:
- An FPGA implementation and performance analysis between Radix-2 and Radix-4 of 4096 point FFT2018
- FFT implementation and optimization on FPGA2018
- QoE-based node selection strategy for edge computing enabled Internet-of-Vehicles (EC-IoV)2017
- Efficient service handoff across edge servers via docker container migration2017
- Internet of Vehicles: Motivation, Layered Architecture, Network Model, Challenges, and Future AspectsIEEE Access, 2016
- A 4096-Point Radix-4 Memory-Based FFT Using DSP SlicesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2016
- A low power radix-2 FFT accelerator for FPGA2015
- Efficient hardware implementation of scalable FFT using configurable Radix-4/22014
- Accelerating 3D-FFT Using Hard Embedded Blocks in FPGAs2013
- Efficient multi-ported memories for FPGAs2010