<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<article xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="technology" lang="en"><front><journal-meta><journal-id journal-id-type="publisher">IJCRR</journal-id><journal-id journal-id-type="nlm-ta">I Journ Cur Res Re</journal-id><journal-title-group><journal-title>International Journal of Current Research and Review</journal-title><abbrev-journal-title abbrev-type="pubmed">I Journ Cur Res Re</abbrev-journal-title></journal-title-group><issn pub-type="ppub">2231-2196</issn><issn pub-type="opub">0975-5241</issn><publisher><publisher-name>Radiance Research Academy</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">1746</article-id><article-id pub-id-type="doi"/><article-id pub-id-type="doi-url"/><article-categories><subj-group subj-group-type="heading"><subject>Technology</subject></subj-group></article-categories><title-group><article-title>EFFICIENT DISTRIBUTED ARITHMETIC BASED DISCRETE COSINE TRANSFORM CORE WITH ERROR COMPENSATION&#13;
</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Dharini</surname><given-names>G.</given-names></name></contrib><contrib contrib-type="author"><name><surname>P.S</surname><given-names>Sharon</given-names></name></contrib><contrib contrib-type="author"><name><surname>S</surname><given-names>Arun</given-names></name></contrib><contrib contrib-type="author"><name><surname>Radhika</surname><given-names>R.</given-names></name></contrib></contrib-group><pub-date pub-type="ppub"><day>22</day><month>06</month><year>2012</year></pub-date><volume>)</volume><issue/><fpage>20</fpage><lpage>26</lpage><permissions><copyright-statement>This article is copyright of Popeye Publishing, 2009</copyright-statement><copyright-year>2009</copyright-year><license license-type="open-access" href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0) Licence. You may share and adapt the material, but must give appropriate credit to the source, provide a link to the licence, and indicate if changes were made.</license-p></license></permissions><abstract><p>In this paper, an error-compensated adder-tree is proposed to deal with the truncation errors by performing shifting and addition operations in parallel thus achieving low-error and high-throughput discrete cosine transform (DCT) design. The Discrete Cosine Transform is a type of Image Transform which expresses a sequence of finitely many data points in terms of a sum of cosine functions at different frequencies. The proposed scheme incorporates 9-bit distributed arithmetic (DA) - precision for this work instead of the 12 bits in the previous works, so as to meet the desired peak-signal-to-noise-ratio (PSNR). Thus, an area efficient DCT core is implemented to achieve 1 Gpels/s throughput rate for the PSNR requirements outlined in the earlier works.&#13;
</p></abstract><kwd-group><kwd>Distributed arithmetic (DA)-based</kwd><kwd> 2-D discrete cosine transform (DCT)</kwd><kwd> PSNR – Peak Signal to Noise Ratio.</kwd></kwd-group></article-meta></front></article>
