Pattern-recognition system and method

Abstract

a plurality of binary logic trees converts a pattern to a signature word. Each logic has addressable test-node words with branch, status and pattern-bit address fields. The status field has flags for indicating a desired value of a pattern bit and for identifying leaf-node logic words for setting the signature bits. The logics are interrelated to each other by a set of reference words having a substantially constant intrapair Hamming distance. The signature is converted to one or more identifying codes by generating one of the reference words from the signature and comparing it with the signature. If one code is used, the comparison gives the correct code for the pattern. For plural codes, the codes are checked for consistency with each other and are used to complete a correct identifying code. Computer-program implementations are described for accomplishing all the above functions.

Claims aren’t available for this document.