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

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/spl times/128 bit data with a 0.13 /spl mu/m 5M CMOS process.