Backward-Data-Direction Clocking and Relevant Optimal Register Assignment in Datapath Synthesis
スポンサーリンク
概要
- 論文の詳細を見る
For recent and future nanometer-technology VLSIs, static and dynamic delay variations become a serious problem. In many cases, the hold timing constraint, as well as the setup timing constraint, becomes critical for latching a correct signal under delay variations. While the timing violation due to the fail of the setup timing constraint can be fixed by tuning a clock frequency or using a delayed latch, the timing violation due to the fail of the hold timing constraint cannot be fixed by those methods in general. Our approach to delay variations (in particular, the hold timing constraint) proposed in this paper is a novel register assignment strategy in high-level synthesis, which guarantees safe clocking by Backward-Data-Direction (BDD) clocking. One of the drawbacks of the proposed register assignment is the increase in the number of required registers. After the formulation of this new register minimization problem, we prove NP-hardness of the problem, and then derive an integer linear programming formulation for the problem. The proposed method receives a scheduled data flow graph, and generates a datapath having (1) robustness against delay variations, which is ensured by BDD-based register assignment, and (2) the minimum possible number of registers. Experimental results show the effectiveness of the proposed method for some benchmark circuits.
- (社)電子情報通信学会の論文
- 2011-04-01
著者
-
INOUE Keisuke
School of Information Science, Japan Advanced Institute of Science and Technology
-
IWAGAKI Tsuyoshi
School of Information Science, Japan Advanced Institute of Science and Technology
-
Kaneko Mineo
Japan Advanced Inst. Of Sci. And Technol. Ishikawa Jpn
-
Kaneko Mineo
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Inoue Keisuke
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Iwagaki Tsuyoshi
School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- Optimal Register Assignment with Minimum-Path Delay Compensation for Variation-Aware Datapaths
- Novel Register Sharing in Datapath for Structural Robustness against Delay Variation
- Novel Register Sharing in Datapath for Structural Robustness against Delay Variation
- Simultaneous Optimization of Skew and Control Step Assignments in RT-Datapath Synthesis
- Optimal Register Assignment with Minimum-Path Delay Compensation for Variation-Aware Datapaths
- A Test Generation Framework using Checker Circuits and its Application to Path Delay Test Generation
- A Broadside Test Generation Method for Transition Faults in Partial Scan Circuits
- A Broadside Test Generation Method for Transition Faults in Partial Scan Circuits
- A Broadside Test Generation Method for Transition Faults in Partial Scan Circuits
- A Broadside Test Generation Method for Transition Faults in Partial Scan Circuits
- Equivalence of Sequential Transition Test Generation and Constrained Combinational Stuck-at Test Generation
- A Design Scheme for Delay Testing of Controllers Using State Transition Information
- LMS-Based Algorithms with Multi-Band Decomposition of the Estimation Error Applied to System Identification (Special Section on Digital Signal Processing)
- Multi-Band Decomposition of the Linear Prediction Error Applied to Adaptive AR Spectral Estimation
- Adaptive AR Spectral Estimation Based on Wavelet Decomposition of the Linear Prediction Error
- An integer programming formulation for generating high quality transition tests (システムLSI設計技術・デザインガイア2008--VLSI設計の新しい大地)
- Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis
- An integer programming formulation for generating high quality transition tests (ディペンダブルコンピューティング・デザインガイア2008--VLSI設計の新しい大地)
- An integer programming formulation for generating high quality transition tests (VLSI設計技術・デザインガイア2008--VLSI設計の新しい大地)
- A Systematic Design of Fault Tolerant Systolic Arrays Based on Triple Modular Redundancy in Time-Processor Space
- Statistical Analysis Driven Synthesis of Application Specific Asynchronous Systems
- A-3-5 A Heuristic Approach to Detecting Transition Faults at All Circuit Outputs
- Characterization and Computation of Steiner Routing Based on Elmore's Delay Model
- A-1-15 On the NP-Hardness of Minimum-Period Register Binding
- A-3-9 Analysis of Fault Coverage under a Power Budget in Scan Testing
- Backward-Data-Direction Clocking and Relevant Optimal Register Assignment in Datapath Synthesis
- Flexible Test Scheduling for an Asynchronous On-Chip Interconnect through Special Data Transfer
- A Formal Approach to Optimal Register Binding with Ordered Clocking for Clock-Skew Tolerant Datapaths
- Dual-Edge-Triggered Flip-Flop-Based High-Level Synthesis with Programmable Duty Cycle
- Framework for Latch-based High-level Synthesis Using Minimum-delay Compensation