Low power implementation of DCT for on-board satellite image processing systems

S. Vijay, D. Anchit
{"title":"Low power implementation of DCT for on-board satellite image processing systems","authors":"S. Vijay, D. Anchit","doi":"10.1109/MWSCAS.2009.5235883","DOIUrl":null,"url":null,"abstract":"Full adders are the significant elements which need to be analyzed for low-complexity implementation. Algorithms which minimize the complexity of multiplications of the input image matrix and the DCT matrix focus on reducing the number of full adders (NFAs) needed to implement the multiplication. In this paper, we have successfully proposed a novel technique to reduce considerably the NFAs, and thereby both the power consumption and time delay involved in implementing the image-DCT multiplication. The authors make use of row-column transformations of the input image matrix exploiting the symmetry of the DCT. Design results show that our method gives an average reduction in power of about 10.5% when compared to Differential Pixel Implementation (DPI) [12] and 16.5% when compared to the conventional implementation. The proposed method can also be made recursive, which can further reduce the NFAs for the implementation.","PeriodicalId":254577,"journal":{"name":"2009 52nd IEEE International Midwest Symposium on Circuits and Systems","volume":"322 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 52nd IEEE International Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2009.5235883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Full adders are the significant elements which need to be analyzed for low-complexity implementation. Algorithms which minimize the complexity of multiplications of the input image matrix and the DCT matrix focus on reducing the number of full adders (NFAs) needed to implement the multiplication. In this paper, we have successfully proposed a novel technique to reduce considerably the NFAs, and thereby both the power consumption and time delay involved in implementing the image-DCT multiplication. The authors make use of row-column transformations of the input image matrix exploiting the symmetry of the DCT. Design results show that our method gives an average reduction in power of about 10.5% when compared to Differential Pixel Implementation (DPI) [12] and 16.5% when compared to the conventional implementation. The proposed method can also be made recursive, which can further reduce the NFAs for the implementation.
星载卫星图像处理系统DCT的低功耗实现
全加法器是低复杂度实现中需要分析的重要元素。将输入图像矩阵和DCT矩阵的乘法复杂度最小化的算法侧重于减少实现乘法所需的全加法器(nfa)的数量。在本文中,我们成功地提出了一种新技术,可以大大减少nfa,从而降低实现图像- dct乘法所涉及的功耗和时间延迟。作者利用输入图像矩阵的行-列变换来利用DCT的对称性。设计结果表明,我们的方法与差分像素实现(DPI)[12]相比,功耗平均降低约10.5%,与传统实现相比,功耗平均降低16.5%。该方法还可以递归化,进一步减少了实现过程中的nfa。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信