The following publications are possibly variants of this publication:
- Realization of K-Nearest-Matches Search Capability in Fully-Parallel Associative MemoriesMd. Anwarul Abedin, Yuki Tanaka, Ali Ahmadi, Shogo Sakakibara, Tetsushi Koide, Hans Jürgen Mattausch. ieicet, 90-A(6):1240-1243, 2007. [doi]
- A nearest-hamming-distance search memory with fully parallel mixed digital-analog match circuitryTetsushi Koide, Hans Jürgen Mattausch, Yuji Yano, Takayuki Gyohten, Yoshihiro Soda. aspdac 2003: 591-592 [doi]
- Associative memory with fully parallel nearest-Manhattan-distance search for low-power real-time single-chip applicationsYuji Yano, Tetsushi Koide, Hans Jürgen Mattausch. aspdac 2004: 543-544 [doi]
- Word-parallel coprocessor architecture for digital nearest Euclidean distance searchToshinobu Akazawa, Seiryu Sasaki, Hans Jürgen Mattausch. esscirc 2013: 267-270 [doi]
- Compact associative-memory architecture with fully parallel search capability for the minimum Hamming distanceHans Jürgen Mattausch, Takayuki Gyohten, Yoshihiro Soda, Tetsushi Koide. jssc, 37(2):218-227, 2002. [doi]
- Associative Memory for Nearest-Hamming-Distance Search Based on Frequency MappingHans Jürgen Mattausch, Wataru Imafuku, Akio Kawabata, Tania Ansari, Masahiro Yasuda, Tetsushi Koide. jssc, 47(6):1448-1459, 2012. [doi]