Patent ID: 8958265
Filing Date: 2015-02-17
Classification: G06K,G11C,H03K

Abstract:
1. A method for selecting a K-dimensional vector that is a Manhattan nearest neighbor to a K-dimensional input vector containing K N-bit coordinates, from set of K-dimensional vectors, each containing K N-bit coordinates, where K and N are positive integers, the vectors residing in an orthogonal memory, the method utilizing a set of counters, one counter per vector in the set of vectors, the method comprising: a) initializing, the set of counters; b) successively, for each of the N bits in the coordinates, doubling the counters, and successively tor each of the K coordinates adjusting each counter in parallel with the difference between the bit of the input vector and the corresponding bit of the vector from the set of vectors; and c) selecting, from the set of vectors one or more vectors that are closest to the input vector.