Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis(Logic and High Synthesis)(<Special Section>VLSI Design and CAD Algorithms)

スポンサーリンク

概要

• 論文の詳細を見る

• In the hardware synthesis from a high-level language such as C, the bit length of variables is one of the key issues for the area and speed optimization. Usually, designers are required to optimize the bit-length of each variable manually using the time-consuming simulation on huge-data. In this paper, we propose an optimization method of the fractional bit length in the conversion from floating-point variables to fixed-point variables. The method is based on error propagation and the backward propagation of the accuracy limitation. The method is fully analytical and fast compared to simulation based methods.

• 社団法人電子情報通信学会の論文
• 2003-12-01

著者

• 堀山 貴史

  埼玉大学情報システム工学科

• KIMURA Shinji

  Graduate School of Information Science, Nara Institute of Science and Technology

• WATANABE Katsumasa

  Graduate School of Information Science, Nara Institute of Science and Technology

• Kimura Shinji

  Graduate School Of Information Production And Systems Waseda University

• Kimura S

  Waseda Univ. Kitakyushu‐shi Jpn

• WATANABE Kaoru

  The author is with Osaka Electro-Communication University

• HORIYAMA Takashi

  Graduate School of Science and Engineering, Saitama University

• NAKANISHI MASAKI

  Graduate School of Information Science, NAIST

• Horiyama Takashi

  Graduate School Of Engineering Kyoto University

• Watanabe Katsumasa

  Graduate School Of Information Science Nara Institute Of Science And Technology

• Watanabe K

  Graduate School Of Information Science Nara Institute Of Science And Technology

• DOI Nobuhiro

  Graduate School of Information, Production and Systems, Waseda University

• Doi Nobuhiro

  Graduate School Of Information Production And Systems Waseda University

• Doi Naoshi

  Graduate School Of Information Production And Systems Waseda University

• Nakanishi Masaki

  The Graduate School Of Information Science Nara Institute Of Science And Technology

• Nakanishi Masaki

  Graduate School Of Information Science Nara Institute Of Science And Technology

• Nakanishi Masaki

  Nara Inst. Sci. And Technol. Ikoma‐shi Jpn

• Kohara Shunitsu

  Department Of Computer Science Waseda University

• NAKANISHI Masaki

  Yamagata University

• Kimura Shinji

  Graduate School Of Engineering Nagoya University

関連論文

• DS-1-14 飛び道具を考慮した逆算法に基づく詰将棋列挙技術(DS-1. COMP-NHC学生シンポジウム,シンポジウムセッション)
• 逆算法に基づく詰将棋の列挙
• D-1-7 逆算法に基づく詰将棋の列挙(D-1. コンピュテーション)
• Automatic clock gating generation through power-optimal control signal selection (VLSI設計技術)
• 正4面体と他の正多面体との共通の辺展開図に関する研究
• 自動クロックゲーティング生成における電力最適化制御信号選択手法
• 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)
• Timing Verification of Sequential Logic Circuits Based on Controlled Multi-Clock Path Analysis (Special Section on VLSI Design and CAD Algorithms)
• 秘密分散を用いた安全なVickreyオークション
• 論理関数の畳み込み機構を導入した省面積FPGAの実現と評価
• 8C45 ことばによる手話単語の記述と三次元表現
• 非線形方程式と整数解の探索に基づく高位合成向けビット長最適化(検証・理論, 組込技術とネットワークに関するワークショップ)
• 非線形方程式と整数解の探索に基づく高位合成向けビット長最適化
• 非線形方程式と整数解の探索に基づく高位合成向けビット長最適化(検証・理論, 組込技術とネットワークに関するワークショップ)
• C言語を用いた音声認識・学習LSIの設計と実現について
• C言語を用いた音声認識・学習LSIの設計と実現について
• C言語を用いた音声認識・学習LSIの設計と実現について
• A-3-13 学習回路インターフェースを持ち不特定話者に対応できる音声認識回路
• マルチステージクロックゲーテイングにおけるクロック制御回路の共有について(低電力設計,デザインガイア2010-VLSI設計の新しい大地-)
• マルチステージクロックゲーティングにおけるクロック制御回路の共有について(低電力設計,デザインガイア2010-VLSI設計の新しい大地-)
• 1-D-5 最長路問題と最大経路差問題 : その解法とJR大都市近郊区間大回りへの応用(離散・組合せ最適化(2))
• 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)
• A Scheduling Problem in Multihop Networks
• The p-Collection Problem in a Flow Network with Lower Bounds (Special Section on Discrete Mathematics and Its Applications)
• New Graph Calculi for Planar Non-3-Colorable Graphs
• オンライン問題の競合比解析の自動化について
• Average/Worst-Case Gap of Quantum Query Complexities
• Enhancement of Mutation Frequency with Nucleotide Triphosphate Analogs in PCR Random Mutagenesis
• The Optimal Architecture Design of Two-Dimension Matrix Multiplication Jumping Systolic Array
• オンライン問題の競合比解析の自動化について (計算機科学基礎理論の新展開)
• 平面グラフにおけるHajos Calculusの複雑さについて
• 二段組合せ回路の最大動作率について(計算理論とアルゴリズムの新展開)
• 入札額の範囲が制限された正直なオークション
• 入札額の範囲が制限された正直なオークション
• Hajos Calculus on Planar Graphs (Theoretical Computer Science and its Applications)
• 論理式の解密度の濃縮
• 守備特訓に喘ぐ外野手のための捕球経路問題 (計算機科学基礎理論の新展開)
• 抽象解釈手法に基づく変数の相互関係解析とそのデータパス最適化への応用(システム設計及び一般)
• 抽象解釈手法に基づく変数の相互関係解析とそのデータパス最適化への応用(システム設計および一般)
• 論理関数の畳み込み機構を導入した省面積FPGAの実現と評価
• 論理関数の畳み込み機構を導入した省面積FPGAの実現と評価(FPGAとその応用及び一般)
• A-3-25 論理関数の重ね合わせに基づく加減算向きLUT
• A-3-4 リング発振器を用いたオンチップ高速シリアル通信方式
• A-3-11 冗長2進CORDIC演算器を有する16ビットパイプラインプロセッサ
• 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設計技術)
• Covering Problems in the p-Collection Problems
• The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach
• Realization Problems of a Tree with a Transmission Number Sequence (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)
• Issue Mechanism for Embedded Simultaneous Multithreading Processor
• Multi-Cycle Path Detection Based on Propositional Satisfiability with CNF Simplification Using Adaptive Variable Insertion (Special Section on VLSI Design and CAD Algorithms)
• 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)
• A CMOS Rail-to-Rail Current Conveyer and Its Applications to Current-Mode Filters(Special Section on Papers Selected from ITC-CSCC 2002)
• A CMOS Rail-to-Rail Current Conveyor
• Look Up Table Compaction Based on Folding of Logic Functions(Special Section on VLSI Design and CAD Algorithms)
• Class A CMOS Current Conveyors
• A Clock-Feedthrough Compensated Switched-Current Memory Cell
• Robust Quantum Algorithms Computing OR with ε-Biased Oracles(Quantum Computing,Foundations of Computer Science)
• A Built-in Reseeding Technique for LFSR-Based Test Pattern Generation(Timing Verification and Test Generation)(VLSI Design and CAD Algorithms)
• A Built-in Reseeding Technique for LFSR-Based Test Pattern Generation
• RAY-SPACE CODING USING SINUSOIDAL STRUCTURE IN CIRCULAR CAMERA ARRANGEMENT(International Workshop on Advanced Image Technology 2006)
• A Study on Mouth Shape Features Suitable for HMM Speech Recognition Using Fusion of Visual and Auditory Information
• 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)
• DS-1-7 いかなる辺展開でも正多面体は重ならない(DS-1.COMP学生シンポジウム,シンポジウムセッション)
• いかなる辺展開でも正多面体は重なりを持たない (計算機科学とアルゴリズムの数理的基礎とその応用)
• 正4面体と正6面体との共通の展開図の構成に関する研究
• Unified Dual-Radix Architecture for Scalable Montgomery Multiplications in GF(P) and GF(2^n)
• Optimizing Controlling-Value-Based Power Gating with Gate Count and Switching Activity
• An Isolated Word Speech Recognition Using Fusion of Auditory and Visual Information (Special Section of Papers Selected from JTC-CSCC'95)
• 正多面体の展開図における最小/最大の直径、幅および包囲長方形について
• 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
• An Efficient and Effective Algorithm for Online Task Placement with I/O Communications in Partially Reconfigurable FPGAs(System Level Design,VLSI Design and CAD Algorithms)
• Quantum versus Classical Pushdown Automata in Exact Computation (特集:量子計算と量子情報)
• Power Optimization of Sequential Circuits Using Switching Activity Based Clock Gating
• Exponential Lower Bounds on the Size of Variants of OBDD Representing Integer Division
• Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition(Computation and Computational Models)
• On the Power of Non-deterministic Quantum Finite Automata(Special Issue on Selected Papers from LA Symposium)
• いかなる辺展開でも正多面体は重なりを持たない
• Automatic Generation of Java-Based, Database-Independent Query API
• Automatic Generation of Java-Based, Database-Independent Query API
• Checker circuit generation for System Verilog Assertions in prototyping verification (システムLSI設計技術)
• Efficient Hybrid Grid Synthesis Method Based on Genetic Algorithm for Power/Ground Network Optimization with Dynamic Signal Consideration
• 正多面体の展開図における最小/最大の直径、幅および包囲長方形について
• 任意の凸多面体は重なりのない展開図に展開できるだろうか?
• 2-K-10 p6タイリング可能なポリアモンドの生成(ワークショップ「娯楽のOR-エンターテイメントの数理」)
• On the base-line location problem for the maximum weight region decomposable into base-monotone shapes (New Trends in Algorithms and Theory of Computation)
• アスペクト比を固定した最小の周囲長方形について (アルゴリズムと計算理論の新展開)
• Automatic Multi-Stage Clock Gating Optimization Using ILP Formulation
• 多面体の非同型な展開図の個数について
• 基単調図形に分割可能な最大重み領域を得る基線の配置問題
• トロミノ詰込問題の計算複雑さについて
• pmg タイリング可能なポリオミノの列挙

もっと見る 閉じる

スポンサーリンク