Open Access
Optimizing Dynamic Logic Realizations For Partial Reconfiguration Of Field Programmable Gate Arrays
Matthew Parris
- 01 Jan 2008
8
TL;DR: A case-study application is developed that implements one partial reconfiguration module to demonstrate the functionality and benefits of time multiplexing and reveal the improved efficiencies of the latest large-capacity FPGA architectures.
read more
Abstract: Many digital logic applications can take advantage of the reconfiguration capability of Field Programmable Gate Arrays (FPGAs) to dynamically patch design flaws, recover from faults, or time-multiplex between functions. Partial reconfiguration is the process by which a user modifies one or more modules residing on the FPGA device independently of the others. Partial Reconfiguration reduces the granularity of reconfiguration to be a set of columns or rectangular region of the device. Decreasing the granularity of reconfiguration results in reduced configuration filesizes and, thus, reduced configuration times. When compared to one bitstream of a non-partial reconfiguration implementation, smaller modules resulting in smaller bitstream filesizes allow an FPGA to implement many more hardware configurations with greater speed under similar storage requirements. To realize the benefits of partial reconfiguration in a wider range of applications, this thesis begins with a survey of FPGA fault-handling methods, which are compared using performance-based metrics. Performance analysis of the Genetic Algorithm (GA) Offline Recovery method is investigated and candidate solutions provided by the GA are partitioned by age to improve its efficiency. Parameters of this aging technique are optimized to increase the occurrence rate of complete repairs. Continuing the discussion of partial reconfiguration, the thesis develops a case-study application that implements one partial reconfiguration module to demonstrate the functionality and benefits of time multiplexing and reveal the improved efficiencies of the latest large-capacity FPGA architectures. The number of active partial reconfiguration modules implemented on a single FPGA device is increased from one to eight to implement a dynamic video-processing architecture for Discrete Cosine Transform and Motion Estimation functions to demonstrate a 55-fold reduction in bitstream storage requirements thus improving partial reconfiguration capability.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Dynamic Partial Reconfiguration in FPGAs
Wang Lie,Wu Feng-yan +1 more
- 21 Nov 2009
TL;DR: A simple reconfigurable system that helps to reduce the configuration time and save memory as the partial reconfiguration files (bitstreams) are smaller than full ones.
Progress in autonomous fault recovery of field programmable gate arrays
TL;DR: Fault-handling methods not requiring modification of the FPGA device architecture or user intervention to recover from faults are examined and evaluated against overhead-based and sustainability-based performance metrics such as additional resource requirements, throughput reduction, fault capacity, and fault coverage.
50
A Scalable and Dynamically Reconfigurable FPGA-Based Embedded System for Real-Time Hyperspectral Unmixing
T. Cervero,Julian Caba,Sebastian Lopez,Julio Dondo,Roberto Sarmiento,Fernando Rincón,Juan Carlos López +6 more
TL;DR: The authors present a flexible and adaptable Field-Programmable Gate Array (FPGA)-based solution for extracting the endmembers of a hyperspectral image according to the Modified Vertex Component Analysis (MVCA) algorithm, capable of adapting its parallelization execution by scaling the execution in hardware.
18
Dynamic Partial Reconfiguration Implementation of AES Algorithm
Snehal Wankhade,Rashmi Mahajan +1 more
TL;DR: Partial Reconfiguration by which selected areas of an FPGA can be reconfigured during runtime could be a good solution to preserve confidentiality and convenience to the information in the numeric communication.
FPGA Based Scalable Fixed Point QRD Core Using Dynamic Partial Reconfiguration
Gayathri R. Prabhu,Bibin Johnson,J. Sheeba Rani +2 more
- 01 Jan 2015
TL;DR: An FPGA based scalable fixed point QRD architecture based on Givens Rotation algorithm using an efficient pipelined and unfolded 2D MAC based systolic array architecture with dynamic partial reconfiguration(DPR) capability is presented.
11
References
ALPS: the age-layered population structure for reducing the problem of premature convergence
Gregory S. Hornby
- 08 Jul 2006
TL;DR: The Age-Layered Population Structure (ALPS) as mentioned in this paper was proposed to reduce the problem of premature convergence by introducing new, randomly generated individuals in the youngest layer at regular intervals, which results in an EA that is always exploring new parts of the fitness landscape.
264
•Proceedings Article
A parallel genetic algorithm
Chrisila B. Pettey,Michael R. Leuze,John J. Grefenstette +2 more
- 01 Oct 1987
200
ALPS: The Age-Layered Population Structure for Reducing the Problem of Premature Convergence (Genetic Programming Track)
Gregory S. Hornby
- 01 Jan 2006
TL;DR: Analysis of the search behavior of ALPS finds that the offspring of individuals that are randomly generated mid-way through a run are able to move the population out of mediocre local-optima to better parts of the fitness landscape.
196
Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study
Julian F. Miller
- 01 Jan 2007
TL;DR: A Genetic Algorithm is presented which is capable of evolving 100% functional arithmetic circuits, based on evolving the functionality and connectivity of a rectangular array of logic cells and is modelled on the resources available on the Xilinx 6216 FPGA device.
139