High‐Level Synthesis of In‐Circuit Assertions for Verification, Debugging, and Timing Analysis
J Curreri, G Stitt, AD George - International Journal of …, 2011 - Wiley Online Library
J Curreri, G Stitt, AD George
International Journal of Reconfigurable Computing, 2011•Wiley Online LibraryDespite significant performance and power advantages compared to microprocessors,
widespread usage of FPGAs has been limited by increased design complexity. High‐level
synthesis (HLS) tools have reduced design complexity but provide limited support for
verification, debugging, and timing analysis. Such tools generally rely on inaccurate
software simulation or lengthy register‐transfer‐level simulations, which are unattractive to
software developers. In this paper, we introduce HLS techniques that allow application …
widespread usage of FPGAs has been limited by increased design complexity. High‐level
synthesis (HLS) tools have reduced design complexity but provide limited support for
verification, debugging, and timing analysis. Such tools generally rely on inaccurate
software simulation or lengthy register‐transfer‐level simulations, which are unattractive to
software developers. In this paper, we introduce HLS techniques that allow application …
Despite significant performance and power advantages compared to microprocessors, widespread usage of FPGAs has been limited by increased design complexity. High‐level synthesis (HLS) tools have reduced design complexity but provide limited support for verification, debugging, and timing analysis. Such tools generally rely on inaccurate software simulation or lengthy register‐transfer‐level simulations, which are unattractive to software developers. In this paper, we introduce HLS techniques that allow application designers to efficiently synthesize commonly used ANSI‐C assertions into FPGA circuits, enabling verification and debugging of circuits generated from HLS tools, while executing in the actual FPGA environment. To verify that HLS‐generated circuits meet execution timing constraints, we extend the in‐circuit assertion support for testing of elapsed time for arbitrary regions of code. Furthermore, we generalize timing assertions to transparently provide hang detection that back annotates hang occurrences to source code. The presented techniques enable software developers to rapidly verify, debug, and analyze timing for FPGA applications, while reducing frequency by less than 3% and increasing FPGA resource utilization by 0.7% or less for several application case studies on the Altera Stratix‐II EP2S180 and Stratix‐III EP3SE260 using Impulse‐C. The presented techniques reduced area overhead by as much as 3x and improved assertion performance by as much as 100% compared to unoptimized in‐circuit assertions.
Wiley Online Library
Showing the best result for this search. See all results