A digital circuit for a minimum distance search using an asynchronous bubble shift memory

Author

Nakahara, Sumio ; Kawata, T.

Author_Institution

Hitachi, Tokyo, Japan

fYear

2004

fDate

15-19 Feb. 2004

Firstpage

504

Abstract

The architecture described allows a fully digital circuit to search for the minimum Hamming distance. It compares favorably with prior approaches in its robustness and short design time. A concentration of asynchronous circuit techniques allows a 35 ns search time of 64 entry×128 bit data with a 0.13 μm 5M CMOS process.

Keywords

CMOS memory circuits; asynchronous circuits; comparators (circuits); content-addressable storage; 0.13 micron; 128 bit; 35 ns; CAM; CMOS digital circuits; associative memories; asynchronous bubble shift memory; bit comparison; bit-swap memory cell; bitwise comparisons; minimum Hamming distance; minimum distance search; search time; Analog circuits; Data compression; Delay effects; Digital circuits; Hamming distance; Information retrieval; Latches; Pattern recognition; Robustness; Voltage;

fLanguage

English

Publisher

ieee

Conference_Titel

Solid-State Circuits Conference, 2004. Digest of Technical Papers. ISSCC. 2004 IEEE International

ISSN

0193-6530

Print_ISBN

0-7803-8267-6

Type

conf

DOI

10.1109/ISSCC.2004.1332815

Filename

1332815

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3415358