Assembly and method for binary tree-searched vector...

H - Electricity – 03 – M

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 7/30 (2006.01) G06T 9/00 (2006.01) H04N 7/28 (2006.01)

Patent

CA 2047941

ABSTRACT OF THE DISCLOSURE AN ASSEMBLY AND METHOD FOR BINARY TREE-SEARCHED VECTOR QUANTISATION DATA COMPRESSION PROCESSING Data compression processing is carried out using binary Tree-Searched Vector Quantisation in which the direction of branching at each node of the tree is decided by comparison of an input vector (6) with a single code vector (B(n)) and an associated Scalar value (A).

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Assembly and method for binary tree-searched vector... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Assembly and method for binary tree-searched vector..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Assembly and method for binary tree-searched vector... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1841152

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.