http://rdf.ncbi.nlm.nih.gov/pubchem/patent/TW-I224430-B
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_9fc0a00eab3a757e8324b1e887d7ba97 http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_f66c720548d90576751aa5e7ce81e8c4 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M7-42 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M7-40 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N7-30 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M7-42 |
filingDate | 2000-07-27-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2004-11-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c9545ed22ca24108003b103ff052b988 |
publicationDate | 2004-11-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | TW-I224430-B |
titleOfInvention | Packing variable-length code bits at fixed positions |
abstract | A conventional variable-length codebook is converted into a modified codebook in which each symbol is represented by the same number of bits, but at least one symbol can be represented by at least two different code words. Such symbols therefore may be said to have redundant bits, which may then be used to encode other symbols, thereby achieving a degree of data compression. By using fixed-length code words, the positions of code words in the resulting encoded data steam are known a priori. As a result, the encoded data can decoded in parallel. The present invention provides both the data compression advantages of variable-length encoding schemes and the ability to perform parallel decoding processing of fixed-length encoding schemes. The present invention can be embodied in either lossless or lossy implementations. |
priorityDate | 1999-07-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 19.