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

Fast and small area associative memories with minimum distance search capability

Research Project

Project/Area Number 12838009
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 複合化集積システム
Research InstitutionHIROSHIMA UNIVERSITY

Principal Investigator

J Mattausch H  Research Center for Nanodevices and Systems, HIROSHIMA UNIVERSITY, Professor, ナノデバイス研究センター, 教授 (20291487)

Co-Investigator(Kenkyū-buntansha) IWATA Atsushi  Graduate School of Advanced Sciences of Matter, HIROSHIMA UNIVERSITY, Professor, 大学院・先端物質科学研究科, 教授 (30263734)
KOIDE Tetsushi  Research Center for Nanodevices and Systems, HIROSHIMA UNIVERSITY, Associate Professor, ナノデバイス研究センター, 助教授 (30243596)
Project Period (FY) 2000 – 2001
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 2001: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2000: ¥2,100,000 (Direct Cost: ¥2,100,000)
KeywordsAssociative Memory / Hamming distance / Manhattan distance / CMOS technology / Recognition / Learning / CMOS集積回路 / 最小距離検索機能 / マンハタン距離
Research Abstract

The purpose of this research project was to find a new architecture for integrating associative memories with short minimum-distance-search time and small area consumption in CMOS technology.
The target distance measures were the Hamming and the Manhattan distance.
Key result for achieving our objectives is the invention of a fully-parallel, combined digital/analog realization of the search function, whose complexity increases only linear with the number of reference pattern. In this way nearest-match-times < 100 ns have been realized for a reference-data base up to 128 pattern, each containing up to 768 equivalent bit. These high performance data, corresponding to a processing power of about 1 TOPS (Tera Operations Per Second), are achieved with a low power dissipation of only about 1-2 mW per reference pattern. The necessary silicon area is as small as < 10 mm^2 , even in a rather coarse 0.6 μm CMOS technology.
Implementation of the Hamming-distance search needs only 2 additional transistors to implement the EXNOR function for bit comparison between each bit of input pattern and stored reference pattern. Two alternative methods have been devised to realize the more complicated Manhattan distance search. The first method exploits the Hamming-distance-search hardware and implements the Manhattan distance by an encoding algorithm. The second method implements the necessary subtraction and absolute-value circuitry directly in the memory field for each binary of the reference pattern.
The research results achieved in this project have opened a new possibility for implementing the knowledge base of an intelligent system with recognition and learning capability, which has the potential of being superior to neural networks, because there is no restriction on the stored pattern type and new pattern learning can be realized by a simple write operation.

Report

(3 results)
  • 2001 Annual Research Report   Final Research Report Summary
  • 2000 Annual Research Report
  • Research Products

    (14 results)

All Other

All Publications (14 results)

  • [Publications] Mattausch, Hans Jurgen: "Compact Associative-Memory Architecture with Fully-Parallel Search Capability for the Minimum Hamming Distance"IEEE Journal of Solid-State Circuits. 37. 218-227 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "An Architecture for Compact Associative Memories with Deca-ns Nearest-Match Capability up to Large Distances"IEEE International Solid-State Circuits Conference Digest of Tech. Papers. 170-171 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 矢野 祐二: "Fully Parallel Nearest Manhattan-Distance-Search Memory with Large Reference-Pattern Number"Extended Abstracts of the 2002 International Conference on Solid State Devices and Materials(SSDM'2002). 245-255 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "Fully-Parallel Pattern Matching Engine with Dynamic Adaptability to Hamming or Manhattan Distance"2002 Symposium on VLSI Circuits Digest of Technical Papers. 252-255 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 小出 哲士: "A Nearest-Hamming-Distance Search Memory with Fully Parallel Mixed Digital-Analog Match Circuitry"Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'2003). 591-592 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "Copmpact Associative-Memory Architecture with Fully-Parallel Search Capability for the Minimum Hamming Distance"IEEE Journal of Solid-State Circuits. 37. 218-227 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "An Architecture for Compact Associative Memories with Deca-ns Nearest-Match Capability up to Large Distances"Circuits Conference Digest of Tech. Papers (ISSCC'2001). 170-171 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Y. Yano: "Fully Parallel Nearest Manhattan-Distance-Search Memory with Large Reference-Pattern Number"Extended Abstracts of the 2002 International Conference on Solid State Devices and Materials (SSDM'2002). 254-2555 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "Fully-Parallel Pattern-Matching Engine with Dynamic Adaptability to Hamming or Manhattan Distance"2002 Symposium on VLSI Circuits Digest of Technical Papers. 252-255 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T. Koide: "A Nearest-Hamming-Distance Search Memory with Fully Parallel Mixed Digita-Analog Match Circuitry"Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'2003). 591-592 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Mattausch, Hans Jurgen: "Compact Associative-Memory Architecture with Fully-Parallel Search Capability for the Minimum Hamming Distance"IEEE Journal of Solid-State Circuits. 36・2(印刷中). (2002)

    • Related Report
      2001 Annual Research Report
  • [Publications] Mattausch, Hans Jurgen: "Fully-Parallel Pattern-Matching Engine with Dynamic Adaptability to Hamming or Manhattan Distance"2002 Symposium on VLSI Circuits Digest of Technical Papers. (印刷中). (2002)

    • Related Report
      2001 Annual Research Report
  • [Publications] Mattausch,Hans Jurgen: "An architecture for compact associative memories with deca-ns nearest-match capability up to large distances"IEEE International Solid-State Circuits Conference. 44. 170-171 (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] 行天隆幸: "最小ハミング距離検索機能を有する小面積・高速連想メモリの開発"電子情報通信学会、エレクトロニクス講演論文集2. (印刷中). (2001)

    • Related Report
      2000 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi