Vector Quantization (VQ) has become feasible to be used in d -t i m e applications by employing VLSZ technology. In this paper, we pmpose a new search algorithm and an ar-&tectum for implementing it, which mn be used in ml-time image processing. This search algorithm takes O(k) time units on a sequential machine, where k is the dimension of the deuectors, assuming unit time corresponds to one comparison opemtwn. The pmposed aditectum employs a single Processing Element (PE) and O ( N ) ezternal memory for storing N hyperplanes used in the search, where N is the number of codeuectors.C o m p a d with known amhitectures for VQ in the litenatum, the PFoPdped design does not perform any multiplication opemtwn, since the search method is independent of any L, metric, 1 5 q 5 00. Zt leads to an area eflcient design with the PE consisting of a compamtor and 00) nqisters. Also, the memory used by ihe design is significnntly lees than those employed in the known architectures.