VLSI architecture for hand-written symbol recognition

Comparing the hand-written symbol with the set of training symbols (called reference symbols), we can recognize the input hand-written symbol by computing the distances among the input symbol and the reference symbols in the training set. In this paper we propose a VLSI architecture based on the space-time domain expansion which can compute the symbol distance and also give the index-pairs which correspond to the warp function. The time complexity is O(max(m, n)) by using m × n processing elements array, where m is the length of the input symbol and n is the length of the reference symbol. With a uniprocessor the matching process will have the time complexity O(m × n). If there are p reference symbols, using the proposed architecture the recognition problem can be solved in time O(max(m,n,p)). With a uniprocessor the time complexity will be O(m × n × p). The algorithm partition problems are discussed. Verification of the proposed VLSI architecture is also given.