An Exact Approach for GPC-Based Compressor Tree Synthesis

スポンサーリンク

概要

• 論文の詳細を見る

• Multi-operand adders that calculate the summation of more than two operands usually consist of compressor trees, which reduce the number of operands to two without any carry propagation, and carry-propagate adders for the two operands in the ASIC implementation. Compressor trees that consist of full adders and half adders cannot be implemented efficiently on LUT-based FPGAs, and carry-chains or dedicated structures have been utilized to produce multi-operand adders on FPGAs. Recent studies indicate that compressor trees can be implemented efficiently on LUTs using Generalized Parallel Counters (GPCs) as the building blocks of compressor trees. This paper addresses the problem of synthesizing compressor trees based on GPCs. Based on the observation that characteristics such as the area, power, and delay correlate roughly to the total number and the maximum level of GPCs, the target problem can be regarded as a minimization problem for the total number of GPCs and the maximum levels of the GPCs, for which an ILP-based approach is proposed. The key point of our formulation is not to model the problem based on the structures of compressor trees like the existing approach, but instead the compression process itself is used to reduce the number of variables and constraints in the ILP formulation. The experimental results demonstrate the advantage of our formulation in terms of the quality and runtime.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Kimura Shinji

  Graduate School Of Engineering Nagoya University

• Matsunaga Yusuke

  Department Of Advanced Information Technology Faculty Of Information Science And Electrical Engineering Kyushu University

• MATSUNAGA Yusuke

  Department of Advanced Information Technology, Faculty of Information Science and Electrical engineering, Kyushu University

• MATSUNAGA Taeko

  Department of Electrical Engineering and Information Technology, Faculty of Engineering, Kyushu Sangyo University

関連論文

• Exact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization (Special Section on VLSI Design and CAD Algorithms)
• Hardware Synthesis from C Programs with Estimation of Bit Length of Variables (Special Section on VLSI Design and CAD Algorithms)
• Selective Low-Care Coding : A Means for Test Data Compression in Circuits with Multiple Scan Chains(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
• The Optimal Architecture Design of Two-Dimension Matrix Multiplication Jumping Systolic Array
• Fine-Grained Power Gating Based on the Controlling Value of Logic Elements
• Fine-grained power gating based on the controlling value of logic gates (VLSI設計技術)
• Fine-grained power gating based on the controlling value of logic gates (システムLSI設計技術)
• Finite Input-Memory Automaton Based Checker Synthesis of System Verilog Assertions for FPGA Prototyping
• _
• Issue Mechanism for Embedded Simultaneous Multithreading Processor
• Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis(Logic and High Synthesis)(VLSI Design and CAD Algorithms)
• Character Projection Mask Set Optimization for Enhancing Throughput of MCC Projection Systems
• Special Section on VLSI Design and CAD Algorithms
• RAY-SPACE CODING USING SINUSOIDAL STRUCTURE IN CIRCULAR CAMERA ARRANGEMENT(International Workshop on Advanced Image Technology 2006)
• Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique(System Level Design,VLSI Design and CAD Algorithms)
• A Selective Scan Chain Reconfiguration through Run-Length Coding for Test Data Compression and Scan Power Reduction(Test)(VLSI Design and CAD Algorithms)
• A Hybrid Dictionary Test Data Compression for Multiscan-Based Designs(Test)(VLSI Design and CAD Algorithms)
• Optimizing Controlling-Value-Based Power Gating with Gate Count and Switching Activity
• Pluripotent stem cells as source of dendritic cells for immune therapy
• Coverage Estimation Using Transition Perturbation for Symbolic Model Checking in Hardware Verification(Simulation and Verification,VLSI Design and CAD Algorithms)
• Structural Coverage of Traversed Transitions for Symbolic Model Checking
• Structural Coverage of Traversed Transitions for Symbolic Model Checking
• Structural Coverage of Traversed Transitions for Symbolic Model Checking
• Structural Coverage of Traversed Transitions for Symbolic Model Checking
• Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating
• A Simultaneous Module Selection, Scheduling, and Allocation Method Considering Operation Chaining with Multi-Functional Units(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
• Timing-Constrained Area Minimization Algorithm for Parallel Prefix Adders(Logic Synthesis and Verification,VLSI Design and CAD Algorithms)
• Checker circuit generation for System Verilog Assertions in prototyping verification (システムLSI設計技術)
• A Behavioral Synthesis Method with Special Functional Units
• Efficient Hybrid Grid Synthesis Method Based on Genetic Algorithm for Power/Ground Network Optimization with Dynamic Signal Consideration
• Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation
• Multi-Operand Adder Synthesis Targeting FPGAs
• On Gate Level Power Optimization of Combinational Circuits Using Pseudo Power Gating
• Write Control Method for Nonvolatile Flip-Flops Based on State Transition Analysis
• Efficient Fault Simulation Algorithms for Analyzing Soft Error Propagation in Sequential Circuits
• An Exact Approach for GPC-Based Compressor Tree Synthesis
• Dual-Stage Pseudo Power Gating with Advanced Clustering Algorithm for Gate Level Power Optimization

もっと見る 閉じる

スポンサーリンク