Layout driven synthesis of multiple scan chains

Rahimi, Kambiz; Soma, M.

doi:10.1109/tcad.2002.807886

Cited by 8 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6] and [7] a method is proposed to introduce scan chains in two steps. In the first step the flip-flops are evenly partitioned based on their position relative to the position of the in and output pins of the scan chains.…”

Section: Solving a Balanced Mtsp By Partitioningmentioning

confidence: 99%

Automating Reconfiguration Chain Generation for SRL-Based Run-Time Reconfiguration

Heyse

Farisi

Bruneel

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Run-time reconfiguration (RTR) of FPGAs is mainly done using the configuration interface. However, for a certain group of designs, RTR using the shift register functionality of the LUTs is a much faster alternative than conventional RTR using the ICAP. This method requires the creation of reconfiguration chains connecting the run-time reconfigurable LUTs (SRL). In this paper, we develop and evaluate a method to generate these reconfiguration chains in an automated way so that their influence on the RTR design is minimised and the reconfiguration time is optimised. We do this by solving a constrained multiple travelling salesman problem (mTSP) based on the placement information of the run-time reconfigurable LUTs. An algorithm based on simulated annealing was developed to solve this new constrained mTSP. We show that using the proposed method, reconfiguration chains can be added with minimal influence on the clock frequency of the original design.

show abstract

Section: Solving a Balanced Mtsp By Partitioningmentioning

confidence: 99%