• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research on synthesis of easily-testable arithmetic circuits

Research Project

Project/Area Number 20300016
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Computer system/Network
Research InstitutionNagoya University

Principal Investigator

TAKAGI Naofumi  Nagoya University, 大学院・情報学研究科, 教授 (10171422)

Co-Investigator(Kenkyū-buntansha) TAKAGI Kazuyoshi  名古屋大学, 大学院・情報科学研究科, 准教授 (70273844)
Co-Investigator(Renkei-kenkyūsha) NAKAMURA Kazuhiro  名古屋大学, 大学院・情報科学研究科, 助教 (90335076)
Project Period (FY) 2008 – 2010
Project Status Completed (Fiscal Year 2010)
Budget Amount *help
¥11,570,000 (Direct Cost: ¥8,900,000、Indirect Cost: ¥2,670,000)
Fiscal Year 2010: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2009: ¥5,330,000 (Direct Cost: ¥4,100,000、Indirect Cost: ¥1,230,000)
Fiscal Year 2008: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
KeywordsVLSIのテスト / 算術演算回路 / 乗算器 / 加算器 / テスト容易化設計
Research Abstract

We have developed a carry select adder which can be tested by a test set whose cardinality is independent of the operand size, and a parallel prefix adder which can be tested by a test set whose cardinality is proportional to the depth of the circuit. For multiplier design, we have developed a 4-2 adder tree, as well as other adder trees, which can be tested by a test set whose cardinality is independent of the operand size, and also shown that any partial product compressor consisting of carry save adders can be tested by a test set whose cardinality is proportional to the depth of the circuit. We have also developed a prototype tool for synthesizing easily testable parallel prefix adders and 4-2 adder trees.

Report

(4 results)
  • 2010 Annual Research Report   Final Research Report ( PDF )
  • 2009 Annual Research Report
  • 2008 Annual Research Report
  • Research Products

    (22 results)

All 2011 2010 2009 2008 Other

All Journal Article (6 results) (of which Peer Reviewed: 6 results) Presentation (14 results) Remarks (2 results)

  • [Journal Article] A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier2010

    • Author(s)
      Nobutaka Kito、Kensuke Hanai、Naofumi Takagi
    • Journal Title

      IEICE Transactions on Information and Systems vol.E93-D、no.10

      Pages: 2783-2791

    • NAID

      10027641210

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier2010

    • Author(s)
      Nobutaka Kito, Kensuke Hanai, Naofumi Takagi
    • Journal Title

      IEICE Trans.on Information and Systems

      Volume: E93-D Pages: 2783-2791

    • NAID

      10027641210

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] けた上げ保存加算器で構成された部分積加算部をもつ乗算器のテスト2009

    • Author(s)
      鬼頭信貴、高木直史
    • Journal Title

      電子情報通信学会論文誌D J92-D巻、7号

      Pages: 994-1002

    • NAID

      110007331954

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] けた上げ保存加算器で構成された部分積加算部をもつ乗算器のテスト2009

    • Author(s)
      鬼頭信貴
    • Journal Title

      電子情報通信学会論文誌 J92-D

      Pages: 994-1002

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 種々の部分積加算構造をもつテスト容易な乗算器の設計手法2008

    • Author(s)
      鬼頭信貴、高木直史
    • Journal Title

      電子情報通信学会論文誌D J91-D巻、10号

      Pages: 2478-2486

    • NAID

      110007380919

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] 種々の部分積加算構造をもっテスト容易な乗算器の設計手法2008

    • Author(s)
      鬼頭信貴, 高木直史
    • Journal Title

      電子情報通信学会論文誌D J91-D, No. 10

      Pages: 2478-2486

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Presentation] 遅延制約下におけるテスト容易な並列加算器の設計手法2011

    • Author(s)
      藤井真一
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      宮古島マリンターミナル(宮古島市)
    • Year and Date
      2011-03-18
    • Related Report
      2010 Annual Research Report 2010 Final Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の自動合成手法の検討2010

    • Author(s)
      藤井真一
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      八丈シーパークリゾート(東京都八丈島町)
    • Year and Date
      2010-03-28
    • Related Report
      2010 Final Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の自動合成手法の検討2010

    • Author(s)
      藤井真一
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      八丈シーパークリゾート (東京都)
    • Year and Date
      2010-03-28
    • Related Report
      2009 Annual Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の設計2009

    • Author(s)
      鈴木秀俊
    • Organizer
      2009年電子情報通信学会基礎・境界ソサイエティ大会
    • Place of Presentation
      新潟大学(新潟市)
    • Year and Date
      2009-09-17
    • Related Report
      2010 Final Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の設計2009

    • Author(s)
      鈴木秀俊
    • Organizer
      2009年電子情報通信学会基礎・境界ソサイエティ大会
    • Place of Presentation
      新潟大学 (新潟県)
    • Year and Date
      2009-09-17
    • Related Report
      2009 Annual Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器2009

    • Author(s)
      鈴木秀俊
    • Organizer
      第61回FTC研究会
    • Place of Presentation
      フォレストピア奥伊勢(三重県大台町)
    • Year and Date
      2009-07-17
    • Related Report
      2010 Final Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器2009

    • Author(s)
      鈴木秀俊
    • Organizer
      第61回FTC研究会
    • Place of Presentation
      フォレストピア奥伊勢 (三重県)
    • Year and Date
      2009-07-17
    • Related Report
      2009 Annual Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の設計手法2009

    • Author(s)
      鈴木秀俊
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      機械振興会館(東京都港区)
    • Year and Date
      2009-06-19
    • Related Report
      2010 Final Research Report
  • [Presentation] テスト容易な並列プレフィクス加算器の設計手法2009

    • Author(s)
      鈴木秀俊
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      機械振興会館 (東京都)
    • Year and Date
      2009-06-19
    • Related Report
      2009 Annual Research Report
  • [Presentation] 乗算器の種々の部分積加算部の順序故障テスト2009

    • Author(s)
      鬼頭信貴
    • Organizer
      電子情報通信学会2009年総合大会
    • Place of Presentation
      愛媛大学(松山市)
    • Year and Date
      2009-03-17
    • Related Report
      2010 Final Research Report 2008 Annual Research Report
  • [Presentation] Level-testability ofmulti-operand adders2008

    • Author(s)
      鬼頭信貴
    • Organizer
      17th IEEE Asia Test Symposium
    • Place of Presentation
      京王プラザホテル札幌(札幌市)
    • Year and Date
      2008-11-26
    • Related Report
      2010 Final Research Report
  • [Presentation] Level-testability of multi-operand adders2008

    • Author(s)
      Nobutaka Kito, Naofumi Takagi
    • Organizer
      17th Asia Test Symposium
    • Place of Presentation
      京王プラザホテル札幌(札幌市)
    • Year and Date
      2008-11-26
    • Related Report
      2008 Annual Research Report
  • [Presentation] Testgeneration for multi-operand adders consisting of full adders2008

    • Author(s)
      鬼頭信貴
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      機械振興会館(東京都港区)
    • Year and Date
      2008-06-20
    • Related Report
      2010 Final Research Report
  • [Presentation] Test generation for multi-operand adders consisting of full adders2008

    • Author(s)
      鬼頭信貴, 高木直史
    • Organizer
      電子情報通信学会ディペンダブルコンピューティング研究会
    • Place of Presentation
      機械振興会館(東京都港区)
    • Year and Date
      2008-06-20
    • Related Report
      2008 Annual Research Report
  • [Remarks] ホームページ等

    • URL

      http://www.lab3.kuis.kyoto-u.ac.jp/research/easytest.html

    • Related Report
      2010 Final Research Report
  • [Remarks]

    • URL

      http://www.lab3.kuis.kyoto-u.ac.jp/research/easytest.html

    • Related Report
      2010 Annual Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi