File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Architecture for tree search based vector quantization for single chip implementation

TitleArchitecture for tree search based vector quantization for single chip implementation
Authors
Issue Date1992
Citation
Proceedings Of The International Conference On Application, 1992, p. 385-399 How to Cite?
AbstractVector Quantization (VQ) has become feasible to be used in real-time applications by employing VLSI technology. In this paper, we propose a new search algorithm and an architecture for implementing it, which can be used in real-time image processing. This search algorithm takes O(k) time units on a sequential machine, where k is the dimension of the codevectors, assuming unit time corresponds to one comparison operation. The proposed architecture employs a single Processing Element (PE) and O(N) external memory for storing N hyperplanes used in the search, where N is the number of codevectors. Compared with known architectures for VQ in the literature, the proposed design does not perform any multiplication operation, since the search method is independent of any Lq metric, 1≤q≤∞. It leads to an area efficient design with the PE consisting of a comparator and O(k) registers. Also, the memory used by the design is significantly less than those employed in the known architectures.
Persistent Identifierhttp://hdl.handle.net/10722/151793

 

DC FieldValueLanguage
dc.contributor.authorPark, Heonchulen_US
dc.contributor.authorPrasanna, Viktor Ken_US
dc.contributor.authorWang, ChoLien_US
dc.date.accessioned2012-06-26T06:29:34Z-
dc.date.available2012-06-26T06:29:34Z-
dc.date.issued1992en_US
dc.identifier.citationProceedings Of The International Conference On Application, 1992, p. 385-399en_US
dc.identifier.urihttp://hdl.handle.net/10722/151793-
dc.description.abstractVector Quantization (VQ) has become feasible to be used in real-time applications by employing VLSI technology. In this paper, we propose a new search algorithm and an architecture for implementing it, which can be used in real-time image processing. This search algorithm takes O(k) time units on a sequential machine, where k is the dimension of the codevectors, assuming unit time corresponds to one comparison operation. The proposed architecture employs a single Processing Element (PE) and O(N) external memory for storing N hyperplanes used in the search, where N is the number of codevectors. Compared with known architectures for VQ in the literature, the proposed design does not perform any multiplication operation, since the search method is independent of any Lq metric, 1≤q≤∞. It leads to an area efficient design with the PE consisting of a comparator and O(k) registers. Also, the memory used by the design is significantly less than those employed in the known architectures.en_US
dc.languageengen_US
dc.relation.ispartofProceedings of the International Conference on Applicationen_US
dc.titleArchitecture for tree search based vector quantization for single chip implementationen_US
dc.typeConference_Paperen_US
dc.identifier.emailWang, ChoLi:clwang@cs.hku.hken_US
dc.identifier.authorityWang, ChoLi=rp00183en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0027001254en_US
dc.identifier.spage385en_US
dc.identifier.epage399en_US
dc.identifier.scopusauthoridPark, Heonchul=7601564751en_US
dc.identifier.scopusauthoridPrasanna, Viktor K=7005057102en_US
dc.identifier.scopusauthoridWang, ChoLi=7501646188en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats