http://rdf.ncbi.nlm.nih.gov/pubchem/patent/KR-20090027696-A
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_82a9e22a923eca64a02a97f0dfb493ed |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-147 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-625 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-42 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-61 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04N19-60 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04N7-24 |
filingDate | 2007-06-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_bc5dbc5351211d260cbb5f45d9eaf8e9 |
publicationDate | 2009-03-17-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | KR-20090027696-A |
titleOfInvention | Efficient Fixed-Point Approximation of Forward and Inverse Discrete Cosine Transforms |
abstract | Techniques for copying the operation of inverse discrete cosine transform using fixed point arithmetic are disclosed. According to these techniques, a matrix of scaled coefficients is generated by multiplying the coefficients of the matrix of encoded coefficients by the scale factor. Next, a matrix of biased coefficients is generated by adding the center point bias value to the DC coefficients of the matrix of scaled coefficients. Fixed-point arithmetic is then used to apply the transform to the matrix of biased coefficients. The values of the resulting matrix are then right-shifted to yield a matrix of pixel component values. The matrix of pixel component values is then combined to produce a matrix of pixels. The matrix of pixels generated by this technique is very similar to the matrix of pixels decompressed using the ideal inverse discrete cosine transform ("IDCT"). |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/KR-101315600-B1 |
priorityDate | 2006-06-26-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: 38.