Design and Analysis of Matching Circuit Architectures for a Closest Match Lookup
暂无分享,去创建一个
Sakir Sezer | John V. McCanny | Holger Blume | Friederich Kupzog | Tobias G. Noll | Kieran McLaughlin | H. Blume | J. McCanny | F. Kupzog | T. Noll | S. Sezer | K. McLaughlin
[1] Marco Aiello,et al. Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006) , 2006 .
[2] Stamatis Vassiliadis,et al. A low-power carry skip adder with fast saturation , 2004, Proceedings. 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors, 2004..
[3] Yuke Wang,et al. The design of hybrid carry-lookahead/carry-select adders , 2002 .
[4] Behrooz Parhami,et al. Computer arithmetic - algorithms and hardware designs , 1999 .
[5] Sethuraman Panchanathan,et al. A content-addressable memory architecture for image coding using vector quantization , 1991, IEEE Trans. Signal Process..
[6] M. van de Panne,et al. MACHAM: a best match content addressable memory , 1989, Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
[7] L. T. Clark,et al. A pipelined associated memory implemented in VLSI , 1989 .
[8] Teuvo Kohonen,et al. Self-organization and associative memory: 3rd edition , 1989 .
[9] Teuvo Kohonen,et al. Self-Organization and Associative Memory , 1988 .
[10] H. Graf,et al. A CMOS associative memory chip based on neural networks , 1987, 1987 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.
[11] Robert K. Brayton,et al. Sensitivity and optimization , 1980 .
[12] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.