Mixed digital-analog associative memory enabling fully-parallel nearest Euclidean distance search

被引:23
作者
Abedin, Md. Anwarul [1 ]
Tanaka, Yuki [1 ]
Ahmadi, Ali [1 ]
Koide, Tetsushi [1 ]
Mattausch, Hans Juergen [1 ]
机构
[1] Hiroshima Univ, Res Ctr Nanodevices & Syst, Hiroshima 7398527, Japan
来源
JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS BRIEF COMMUNICATIONS & REVIEW PAPERS | 2007年 / 46卷 / 4B期
关键词
associative memory; pattern matching; fully-parallel search; Euclidean distance; mixed digital/analog circuit;
D O I
10.1143/JJAP.46.2231
中图分类号
O59 [应用物理学];
学科分类号
摘要
In this paper, an associative memory architecture with mixed digital-analog search circuitry is proposed, which enables a fully-parallel nearest match-data search based on the Euclidean distance between input pattern and stored reference patterns. A test chip, implementing the proposed architecture, was designed in 0.35 pm complementary metal-oxide-semiconductor (CMOS) technology with two-poly and three-metal layers. The nearest-match unit consumes only 0.64 mm(2) (12.5% of the total design area), while the whole chip area is 5.12 mm(2). The layout-based simulated winner-search time, the time to determine the best-matching reference-data word for an input-data word among a database of 64 reference patterns (5-bit, 16 units), is lower than 160 ns. This corresponds to a performance requirement of 27 giga operations per second (GOPS)/mm(2), if a general purpose computer with the same chip area would have to run the same workload. Furthermore, the power dissipation of the designed test chip is only about 38 mW/mm(2) at this high processing performance.
引用
收藏
页码:2231 / 2237
页数:7
相关论文
共 13 条
[1]   A CLASS OF ANALOG CMOS CIRCUITS BASED ON THE SQUARE-LAW CHARACTERISTIC OF AN MOS-TRANSISTOR IN SATURATION [J].
BULT, K ;
WALLINGA, H .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1987, 22 (03) :357-365
[2]   PROGRAMMABLE ANALOG VLSI FOR RADIAL BASIS FUNCTION NETWORKS [J].
CHURCHER, S ;
MURRAY, AF ;
REEKIE, HM .
ELECTRONICS LETTERS, 1993, 29 (18) :1603-1605
[3]  
FREEMAN M, 2005, IADIS AC, P329
[4]  
Hasler P, 1999, ANALOG CIRCUITS SIG, V512, P33
[5]   CMOS SELFBIASED EUCLIDEAN DISTANCE COMPUTING CIRCUIT WITH HIGH DYNAMIC-RANGE [J].
LANDOLT, O ;
VITTOZ, E ;
HEIM, P .
ELECTRONICS LETTERS, 1992, 28 (04) :352-354
[6]   Compact associative-memory architecture with fully parallel search capability for the minimum Hamming distance [J].
Mattausch, HJ ;
Gyohten, T ;
Soda, Y ;
Koide, T .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 2002, 37 (02) :218-227
[7]   A systolic algorithm for Euclidean distance transform [J].
Miyazawa, M ;
Zeng, PF ;
Iso, N ;
Hirata, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (07) :1127-1134
[8]   A word-parallel digital associative engine with wide search range based on Manhattan distance [J].
Oike, Y ;
Ikeda, M ;
Asada, K .
PROCEEDINGS OF THE IEEE 2004 CUSTOM INTEGRATED CIRCUITS CONFERENCE, 2004, :295-298
[9]  
OIKE Y, 2004, P IP BAS SYST ON CHI, P127
[10]  
Saif SM, 2006, IEEE IJCNN, P2815