메뉴 건너뛰기




Volumn , Issue , 2003, Pages 643-646

A high-speed and low-voltage associative co-processor with hamming distance ordering using word-parallel and hierarchical search architecture

Author keywords

[No Author keywords available]

Indexed keywords

CMOS INTEGRATED CIRCUITS; DATA COMPRESSION; MICROPROCESSOR CHIPS; PATTERN RECOGNITION;

EID: 0242696030     PISSN: 08865930     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (8)
  • 1
    • 0024717346 scopus 로고
    • A 20-kbit associative memory LSI for artificial intelligence machines
    • Aug.
    • T. Ogura et al., "A 20-kbit Associative Memory LSI for Artificial Intelligence Machines," IEEE J. Solid-Stage Circuit, vol. 24, no. 4, pp. 1014-1020, Aug. 1989.
    • (1989) IEEE J. Solid-Stage Circuit , vol.24 , Issue.4 , pp. 1014-1020
    • Ogura, T.1
  • 2
    • 0242425176 scopus 로고    scopus 로고
    • A fully parallel 1-Mb CAM LSI for real-time pixel-parallel image processing
    • Apr.
    • T. Ikenaga et al., "A Fully Parallel 1-Mb CAM LSI for Real-Time Pixel-Parallel Image Processing," IEEE J. Solid-Stage Circuit, vol. 35, no. 4, pp. 536-544, Apr. 2000.
    • (2000) IEEE J. Solid-Stage Circuit , vol.35 , Issue.4 , pp. 536-544
    • Ikenaga, T.1
  • 3
    • 0035369412 scopus 로고    scopus 로고
    • A design for high-speed low-power CMOS fully parallel content-addressable memory macros
    • June
    • H. Miyatake et al., "A Design for High-Speed Low-Power CMOS Fully Parallel Content-Addressable Memory Macros," IEEE J. Solid-Stage Circuit, vol. 36, no. 6, pp. 956-968, June 2001.
    • (2001) IEEE J. Solid-Stage Circuit , vol.36 , Issue.6 , pp. 956-968
    • Miyatake, H.1
  • 4
    • 85027116681 scopus 로고
    • Neuron MOS winner-take-all circuit and its application to associative memory
    • Feb.
    • T. Yamashita et al., "Neuron MOS Winner-Take-All Circuit and Its Application to Associative Memory," ISSCC Dig. Tech. Papers, pp. 236-237, Feb. 1993.
    • (1993) ISSCC Dig. Tech. Papers , pp. 236-237
    • Yamashita, T.1
  • 5
    • 0031069029 scopus 로고    scopus 로고
    • A minimum-distance search circuit using dual-line PWM signal processing and charge-packet counting techniques
    • Feb.
    • M. Nagata et al., "A Minimum-Distance Search Circuit using Dual-Line PWM Signal Processing and Charge-Packet Counting Techniques," ISSCC Dig. Tech. Papers, pp. 42-43, Feb. 1997.
    • (1997) ISSCC Dig. Tech. Papers , pp. 42-43
    • Nagata, M.1
  • 6
    • 84893807011 scopus 로고    scopus 로고
    • Time-domain minimum-distance detector and its application to low-power coding scheme on chip-interface
    • M. Ikeda et al., "Time-Domain Minimum-Distance Detector and Its Application to Low-Power Coding Scheme on Chip-Interface," Proc. of Eur. Solid-Stage Circuit Conf. (ESSCIRC), pp. 464-467, 1998.
    • (1998) Proc. of Eur. Solid-Stage Circuit Conf. (ESSCIRC) , pp. 464-467
    • Ikeda, M.1
  • 7
    • 0035054906 scopus 로고    scopus 로고
    • An architecture for compact associative memories with deca-ns nearest-match capability up to large distances
    • H. J. Mattausch et al., "An Architecture for Compact Associative Memories with Deca-ns Nearest-Match Capability up to Large Distances," ISSCC Dig. Tech. Papers, pp. 170-171, 2001.
    • (2001) ISSCC Dig. Tech. Papers , pp. 170-171
    • Mattausch, H.J.1
  • 8
    • 0242443354 scopus 로고    scopus 로고
    • Fully-parallel pattern-matching engine with dynamic adaptability to hamming or Manhattan distance
    • H. J. Mattausch et al., "Fully-Parallel Pattern-Matching Engine with Dynamic Adaptability to Hamming or Manhattan Distance," Symp. on VLSI Circuits Dig. Tech. Papers, pp. 252-255, 2002.
    • (2002) Symp. on VLSI Circuits Dig. Tech. Papers , pp. 252-255
    • Mattausch, H.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.