发布求助
文献互助 智能选刊 最新文献

Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222)最新文献

筛选
英文 中文
An architecture of full-search block matching for minimum memory bandwidth requirement 基于最小内存带宽要求的全搜索块匹配体系结构
Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222) Pub Date : 1998-02-19 DOI: 10.1109/GLSV.1998.665217
Jen-Chien Tuan, C. Jen
{"title":"An architecture of full-search block matching for minimum memory bandwidth requirement","authors":"Jen-Chien Tuan, C. Jen","doi":"10.1109/GLSV.1998.665217","DOIUrl":"https://doi.org/10.1109/GLSV.1998.665217","url":null,"abstract":"In this paper an architecture of full-search block matching motion estimation suitable for high quality video is proposed. Minimum memory bandwidth is an important requirement in motion estimation architecture especially when dealing with high quality video such as large frame size video. Memory bandwidth will increase to an unrealistically high value without careful consideration, which no cost efficient solution can afford. This architecture is designed for overcoming the frame memory bandwidth bottleneck by exploiting the maximum data reuse property. This is done by setting up local memory for storing frame data. The size of local memory is also optimized to near minimum value, only a little overhead is introduced. Due to the reduction of memory bandwidth, the costs of the frame memory modules, I/O pin count and the power consumption can be reduced but 100% hardware efficiency is still achieved. Simple and regular interconnections are featured to ensure high speed operation by an efficient and distributed local memory organization.","PeriodicalId":225107,"journal":{"name":"Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132139805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
VHDL testability analysis based on fault clustering and implicit fault injection 基于故障聚类和隐式故障注入的VHDL可测试性分析
Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222) Pub Date : 1998-02-19 DOI: 10.1109/GLSV.1998.665238
F. Bietti, Fabrizio Ferrandi, F. Fummi, D. Sciuto
{"title":"VHDL testability analysis based on fault clustering and implicit fault injection","authors":"F. Bietti, Fabrizio Ferrandi, F. Fummi, D. Sciuto","doi":"10.1109/GLSV.1998.665238","DOIUrl":"https://doi.org/10.1109/GLSV.1998.665238","url":null,"abstract":"Testability analysis of VHDL sequential models is the main topic of this paper. We investigate the possibility to obtain information about the testability of a sequential VHDL description before its actual synthesis. The analysis is based on an implicit fault model that injects faults into a BDD based description extracted from the VHDL representation. Such an injection is related to the original VHDL representation thus allowing the identification of potential testability problems before RTL and logic synthesis. Fault injection is performed efficiently by exploiting the concept of fault clustering, that is the possibility of grouping faults and analyzing them concurrently. The proposed methodology is applied to benchmarks for efficiency evaluation and to a real VHDL description.","PeriodicalId":225107,"journal":{"name":"Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222)","volume":"24 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116829790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Maximum current estimation in programmable logic arrays 可编程逻辑阵列的最大电流估计
Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222) Pub Date : 1998-02-19 DOI: 10.1109/GLSV.1998.665276
S. Bobba, I. Hajj
{"title":"Maximum current estimation in programmable logic arrays","authors":"S. Bobba, I. Hajj","doi":"10.1109/GLSV.1998.665276","DOIUrl":"https://doi.org/10.1109/GLSV.1998.665276","url":null,"abstract":"Programmable logic array (PLA) is a circuit realization for the two-level sum of products representation of a multi-output Boolean function. The current drawn by a PLA is input dependent and it makes the problem of estimating the maximum current intractable. Integrated circuit reliability and signal integrity are related to the maximum current drawn by the circuit. Hence, an estimate of the maximum current is required for the design of a reliable VLSI circuit. In this paper, we present an input pattern-independent algorithm to obtain the estimate of maximum and minimum currents drawn by a PLA over all possible input vectors. Experimental results on several benchmark circuits and comparisons with exhaustive simulations are also included in this paper.","PeriodicalId":225107,"journal":{"name":"Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121691382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信