메뉴 건너뛰기




Volumn 40, Issue 1, 2005, Pages 276-285

A design for a minimum hamming-distance search using asynchronous digital techniques

Author keywords

Associative memories; Asynchronous circuits; Bubble sort; CAM; CMOS digital circuits; Hamming distance; Self timing

Indexed keywords

CMOS INTEGRATED CIRCUITS; DATA STORAGE EQUIPMENT; IMAGE PROCESSING; LOGIC DESIGN; MULTIMEDIA SYSTEMS; PATTERN RECOGNITION; TRANSISTORS;

EID: 11944252393     PISSN: 00189200     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSSC.2004.837966     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 0032686256 scopus 로고    scopus 로고
    • A fully parallel vector-quantization processor for real-time motion-picture compression
    • Jun.
    • A. Nakada et al, "A fully parallel vector-quantization processor for real-time motion-picture compression," IEEE J. Solid-State Circuits, vol. 34, no. 6, pp. 822-830, Jun. 1999.
    • (1999) IEEE J. Solid-state Circuits , vol.34 , Issue.6 , pp. 822-830
    • Nakada, A.1
  • 2
    • 0014857106 scopus 로고
    • Integrated-circuit content-addressable memories
    • Oct.
    • J. T. Koo, "Integrated-circuit content-addressable memories," IEEE J. Solid-State Circuits, vol. SSC-5, no. 5, pp. 208-215, Oct. 1970.
    • (1970) IEEE J. Solid-state Circuits , vol.SSC-5 , Issue.5 , pp. 208-215
    • Koo, J.T.1
  • 3
    • 0031069029 scopus 로고    scopus 로고
    • A minimum-distance search circuit using dual-line PWM signal processing and charge-packet counting techniques
    • M. Nagata et al., "A minimum-distance search circuit using dual-line PWM signal processing and charge-packet counting techniques," in IEEE Int. Solid-State Circuits Conf. (ISSCC) Dig. Tech. Papers, 1997, pp. 42-43.
    • (1997) IEEE Int. Solid-state Circuits Conf. (ISSCC) Dig. Tech. Papers , pp. 42-43
    • Nagata, M.1
  • 4
    • 0026883775 scopus 로고
    • Associative IC memories with relational search and nearest-match capabilities
    • Jun.
    • S. M. S. Jalaleddine and L. G. Johnson, "Associative IC memories with relational search and nearest-match capabilities," IEEE J. Solid-State Circuits, vol. 27, no. 6, pp. 892-900, Jun. 1992.
    • (1992) IEEE J. Solid-state Circuits , vol.27 , Issue.6 , pp. 892-900
    • Jalaleddine, S.M.S.1    Johnson, L.G.2
  • 5
    • 0036474678 scopus 로고    scopus 로고
    • Compact associative-memory architecture with fully parallel search capability for the minimum hamming distance
    • Feb.
    • H. J. Mattausch et al., "Compact associative-memory architecture with fully parallel search capability for the minimum Hamming distance," IEEE J. Solid-State Circuits, vol. 37, no. 2, pp. 218-227, Feb. 2002.
    • (2002) IEEE J. Solid-state Circuits , vol.37 , Issue.2 , pp. 218-227
    • Mattausch, H.J.1
  • 6
    • 0242696030 scopus 로고    scopus 로고
    • A high-speed and low-voltage associative co-processor with hamming distance ordering using word-parallel and hierarchical search architecture
    • Y. Oike, M. Ikeda, and K. Asada, "A high-speed and low-voltage associative co-processor with Hamming distance ordering using word-parallel and hierarchical search architecture," in Proc. IEEE Custom Integrated Circuits Conf., 2003, pp. 643-646.
    • (2003) Proc. IEEE Custom Integrated Circuits Conf. , pp. 643-646
    • Oike, Y.1    Ikeda, M.2    Asada, K.3
  • 7
    • 0026123817 scopus 로고
    • Logic synthesis of race-free asynchronous CMOS circuits
    • Mar.
    • C. Piguet, "Logic synthesis of race-free asynchronous CMOS circuits," IEEE J. Solid-State Circuits, vol. 26, no. 3, pp. 371-380, Mar. 1991.
    • (1991) IEEE J. Solid-state Circuits , vol.26 , Issue.3 , pp. 371-380
    • Piguet, C.1
  • 8
    • 0024610919 scopus 로고
    • A tutorial on hidden Markov models and selected applications in speech recognition
    • Feb.
    • L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," in Proc. IEEE, vol. 77, Feb. 1989, pp. 257-286.
    • (1989) Proc. IEEE , vol.77 , pp. 257-286
    • Rabiner, L.R.1
  • 9
    • 0005346567 scopus 로고
    • Modeling polyfont printed characters with HMM's and a shift invariant hamming distance
    • Aug.
    • A. J. Elms and J. Illingworth, "Modeling polyfont printed characters with HMM's and a shift invariant Hamming distance," in Proc. 3rd Int. Conf. Document Analysis and Recognition, vol. 1, Aug. 1995, pp. 504-507.
    • (1995) Proc. 3rd Int. Conf. Document Analysis and Recognition , vol.1 , pp. 504-507
    • Elms, A.J.1    Illingworth, J.2
  • 10
    • 33747449197 scopus 로고
    • Memory-based character recognition using a transformation invariant metric
    • Oct.
    • P. Y. Simard, Y. L. Cun, and J. S. Denker, "Memory-based character recognition using a transformation invariant metric," in Proc. Int. Conf. Pattern Recognition, vol. II, Oct. 1994, pp. 262-267.
    • (1994) Proc. Int. Conf. Pattern Recognition , vol.2 , pp. 262-267
    • Simard, P.Y.1    Cun, Y.L.2    Denker, J.S.3
  • 11
    • 0027664012 scopus 로고
    • Using vector quantization for image processing
    • Sep.
    • P.C. Cosman, K. L. Oehler, E. A. Riskin, and R. M. Gray, "Using vector quantization for image processing," in Proc. IEEE, vol. 81, Sep. 1993, pp. 1326-1341.
    • (1993) Proc. IEEE , vol.81 , pp. 1326-1341
    • Cosman, P.C.1    Oehler, K.L.2    Riskin, E.A.3    Gray, R.M.4


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