%0 Journal Article
%J Signal Processing, IEEE Transactions on
%D 1993
%T VLSI implementation of a tree searched vector quantizer
%A Kolagotla,R. K.
%A Yu,S.-S.
%A JaJa, Joseph F.
%K (mathematics);
%K 2
%K 20
%K chips;
%K coding;
%K compression;
%K data
%K design;
%K digital
%K image
%K implementation;
%K MHz;
%K micron;
%K PROCESSING
%K quantisation;
%K quantizer;
%K searched
%K signal
%K tree
%K TREES
%K vector
%K VLSI
%K VLSI;
%X The VLSI design and implementation of a tree-searched vector quantizer is presented. The number of processors needed is equal to the depth of the tree. All processors are identical, and data flow between processors is regular. No global control signals are needed. The processors have been fabricated using 2 mu;m N-well process on a 7.9 times;9.2 mm die. Each processor chip contains 25000 transistors and has 84 pins. The processors have been thoroughly tested at a clock frequency of 20 MHz
%B Signal Processing, IEEE Transactions on
%V 41
%P 901 - 905
%8 1993/02//
%@ 1053-587X
%G eng
%N 2
%R 10.1109/78.193225