2008 IEEE Computer Society Annual Symposium on VLSI最新文献

筛选
英文 中文
Shared-PPRM: A Memory-Efficient Representation for Boolean Reversible Functions 共享- pprm:布尔可逆函数的内存高效表示
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.41
Yasaman Sanaee, Mehdi Saeedi, M. S. Zamani
{"title":"Shared-PPRM: A Memory-Efficient Representation for Boolean Reversible Functions","authors":"Yasaman Sanaee, Mehdi Saeedi, M. S. Zamani","doi":"10.1109/ISVLSI.2008.41","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.41","url":null,"abstract":"A memory-efficient representation scheme, shared-PPRM (SPPRM), for Boolean reversible functions is introduced and analyzed. Compared with conventional PPRM expansion, SPPRM reduces memory usages by using one memory location for many repetitive PPRM sub-expressions. To evaluate the effects of data structure on SPPRM representation, two linked list-based data structures are also examined. The experimental results show the efficiency of the proposed SPPRM representation for both memory usage and CPU time.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124953155","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}
引用次数: 5
Emerging Concepts in Non-volatile Memory Technologies - Era of Resistance Switching Memories 非易失性存储器技术中的新兴概念-电阻开关存储器时代
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.97
C. Muller
{"title":"Emerging Concepts in Non-volatile Memory Technologies - Era of Resistance Switching Memories","authors":"C. Muller","doi":"10.1109/ISVLSI.2008.97","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.97","url":null,"abstract":"The field of embedded electronic systems is still emerging, e.g. in attractive products from widespreaded industry as well as in corresponding academic and industrial research activities. Here, multipurpose adaptivity and reliability features are playing more and more central roles, especially while scaling silicon technologies down according to Moore's goals. On the other side reconfigurable computing technologies are getting more and more awareness by leading processor and mainframe companies, due to increasing energy and cost constraints. These technologies are very advanced in the meanwhile, e.g. also from the high-level tooling point of view. Thus, an ldquoall-win-symbiosisrdquo of future silicon-based processor technologies and reconfigurable circuit/architectures is a must from my point of view. In addition, dynamic and partial reconfiguration found its way from academic labs to industry research and development groups, including the investigation for system integration of real-world applications. The exploitation of dynamic and partial reconfiguration in embedded electronic systems provides a high adaptivity in different kind of applications and situations. Reliability, failure-redundancy and run-time adaptivity by usage of real-time hardware reconfiguration are important aspects for actual and future systems. In order to exploit such kind of adaptive chips sufficiently by handling complexity and execution/application dynamics during runtime efficiently, recent research initiatives like organic computing are giving promising perspectives by learning from mechanisms and behaviours in nature, e.g. in optimizing on-demand chip adaptivity by realizing selected organic functionalities.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"652 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123288112","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
A Real Case of Significant Scan Test Cost Reduction 显著降低扫描测试成本的真实案例
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.32
Selina Sha, B. Swanson
{"title":"A Real Case of Significant Scan Test Cost Reduction","authors":"Selina Sha, B. Swanson","doi":"10.1109/ISVLSI.2008.32","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.32","url":null,"abstract":"With the advent of nanometer technologies, the design size of integrated circuits is getting larger and the operation speed is getting faster. As a consequence, test cost is becoming unbearable with traditional test methods. The big challenge for design and test engineers is how to guarantee the required high levels of test quality and yield while keeping the test cost low. From a scan-based ATPG point of view, there are two main ways to reduce test cost. One way is to reduce test pattern volume and test run time. The problem is how to maintain the same test coverage with a smaller test pattern set. The other way to reduce test cost is to use lower-end testers, which are much cheaper but have limited memory, data channels, and clocking capabilities. This paper shares the experiences of a real case of how to significantly reduce scan test cost by using DFT techniques.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116595678","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
A Fuzzy Approach for Variation Aware Buffer Insertion and Driver Sizing 一种变化感知缓冲器插入和驱动器大小的模糊方法
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.63
V. Mahalingam, N. Ranganathan
{"title":"A Fuzzy Approach for Variation Aware Buffer Insertion and Driver Sizing","authors":"V. Mahalingam, N. Ranganathan","doi":"10.1109/ISVLSI.2008.63","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.63","url":null,"abstract":"In nanometer regime, the effects of process variations are dominating circuit performance, power and reliability of circuits. Hence, it is important to properly manage variation effects at the design stage to avoid excessive performance and power penalties. Buffer insertion and driver sizing (BIDS) techniques are widely used in design flow due to their simplicity and effectiveness in improving metrics such as power, performance and noise. In this paper, we propose a fuzzy optimization technique to perform variation aware Buffer insertion and driver sizing at the network level. Previous variation aware techniques for buffer insertion, processes individual nets in a critical first fashion, which can result in severe over-buffering. Hence, we formulate the variation aware BIDS problem as a fuzzy piece-wise linear program to maximize variation resistance in the presence of delay, power and noise constraints. The uncertainty due to process variations in circuit delay is modeled using fuzzy numbers and the fuzzy approach performs pre-processing deterministic optimizations with the worst and average case values to convert the uncertain problem into a crisp problem. The proposed approach evaluated on ITCpsila99 benchmarks shows a 45% reduction in resource (buffer, driver) cost compared to deterministic worst case approach.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"259 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113996570","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}
引用次数: 3
Design of Fractal Image Compression on SOC 基于SOC的分形图像压缩设计
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.26
A. Jedidi, B. Rejeb, M. Abid
{"title":"Design of Fractal Image Compression on SOC","authors":"A. Jedidi, B. Rejeb, M. Abid","doi":"10.1109/ISVLSI.2008.26","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.26","url":null,"abstract":"The technological revolution during the last years has carried out a great evolution especially in the multimedia domain. Nowadays, almost everyone benefits from various video applications such as TV broadcasting and video conferencing. This progress involves particularly an increase in the capacity of digital data transmission. As a result, data compression became increasingly significant for storage and transmission. In this paper, we present an algorithm for fractal image compression based on SOC in real time. The algorithm consists of a hardware and software part. The hardware part supports an expensive calculation; therefore it is conceived on RTL level. The coding algorithm was implemented on the Altera chart STRATIX-I. The functional blocks were implemented with clock rate of 410 MHz with a maximum flow data input of 13.2 Gbit/s.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133310361","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}
引用次数: 0
A Novel Multiple Core Co-processor Architecture for Efficient Server-Based Public Key Cryptographic Applications 一种新的多核协处理器架构,用于高效的基于服务器的公钥加密应用
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.9
R. Laue, H. G. Molter, Felix Rieder, S. Huss, Kartik Saxena
{"title":"A Novel Multiple Core Co-processor Architecture for Efficient Server-Based Public Key Cryptographic Applications","authors":"R. Laue, H. G. Molter, Felix Rieder, S. Huss, Kartik Saxena","doi":"10.1109/ISVLSI.2008.9","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.9","url":null,"abstract":"We present an SoC-based cryptographic co-processor for server applications, which supports different public key cryptographic schemes. Its novel architecture comprises multiple cores and utilizes HW/SW co-design to support flexibility concerning the supported cryptographic schemes. The emphasis on servers shifts the focus to high throughput, while the usual metric in literature is low latency. Thus, to gain low latency, usual architectures feature high parallelization at the lowest abstraction level leading to some limitations regarding the throughput, if used to support different schemes. Consequently, the proposed architecture utilizes parallelization at this level only to a low degree and compensates the resulting loss in efficiency by heavily exploiting parallelization at higher abstraction levels.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124562017","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}
引用次数: 7
Adaptive Neuron Activation Function with FGMOS Based Operational Transconductance Amplifier 基于FGMOS的运算跨导放大器的自适应神经元激活函数
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.12
V. Babu, K. A. Rose, M. Baiju
{"title":"Adaptive Neuron Activation Function with FGMOS Based Operational Transconductance Amplifier","authors":"V. Babu, K. A. Rose, M. Baiju","doi":"10.1109/ISVLSI.2008.12","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.12","url":null,"abstract":"In this paper, an operational transconductane amplifier (OTA) with tunable transconductance and threshold level, based on multiple input floating gate MOS (MIFGMOS) transistor is presented. This OTA has much wider linear range compared to CMOS based OTA. This circuit is suitable for analog signal processing and neural network applications. It can be used as neuron activation function (NAF) with programmable slope and threshold. Depending on the applications, in neural networks, it may be required to change the threshold levels and slope of the activation function. In the proposed circuit, these parameters can be easily changed by changing voltage at the control gate of FGMOS transistors. TSPICE simulation results using 2mum N-well process are presented.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111655","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}
引用次数: 12
Communication Centric Modelling of System on Chip Devices Targeting Multi-standard Telecommunication Applications 面向多标准电信应用的片上系统以通信为中心的建模
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.55
A. Ahmadinia, Balal Ahmad, T. Arslan
{"title":"Communication Centric Modelling of System on Chip Devices Targeting Multi-standard Telecommunication Applications","authors":"A. Ahmadinia, Balal Ahmad, T. Arslan","doi":"10.1109/ISVLSI.2008.55","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.55","url":null,"abstract":"In this paper we propose a novel framework for modelling heterogeneous SoC architectures with emphasis on reconfigurable component integration and optimised communication media. Our work targets three major issues faced by the current SoC design methodologies; a novel hybrid communication topology, communication centric platforms and modelling of reconfigurable components in the system. Multi-standard telecommunication applications are chosen as our target domain and a case study of WiMAX is used as a real world example to demonstrate the novelty of our work. A system consisting of an ARM processor, reconfigurable FFT and reconfigurable Viterbi decoder is considered with the option of system scalability for future upgrades. Behaviour of system with different communication platforms is analysed for its throughput and power characteristics with different reconfigurable scenarios to show the effectiveness of our approach.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778588","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}
引用次数: 0
Uncriticality-Directed Low-Power Instruction Scheduling 非临界定向低功耗指令调度
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.64
Shingo Watanabe, Toshinori Sato
{"title":"Uncriticality-Directed Low-Power Instruction Scheduling","authors":"Shingo Watanabe, Toshinori Sato","doi":"10.1109/ISVLSI.2008.64","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.64","url":null,"abstract":"Intelligent mobile information devices require low-power and high-performance processors. In order to reduce energy consumption with maintaining computing performance, we proposed to utilize information regarding instruction criticality. Every functional unit in our processor has different latency and energy consumption. Only critical instructions are executed in power-hungry units, and the total energy consumption can be reduced. While we have studied several techniques to identify critical instructions for years, we have not found any technique that achieves both simplicity and high accuracy to identify. In this paper, we propose to exploit uncriticality rather than criticality. Only uncritical instructions are executed in power-efficient units, and energy consumption can be reduced. Our simulation results show approximately 10% energy reduction.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"119 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302612","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}
引用次数: 6
Arithmetic Data Path Optimization Using Borrow-Save Representation 使用借用-保存表示的算术数据路径优化
2008 IEEE Computer Society Annual Symposium on VLSI Pub Date : 2008-04-07 DOI: 10.1109/ISVLSI.2008.29
Sophie Dupuis, R. Chotin-Avot, H. Mehrez
{"title":"Arithmetic Data Path Optimization Using Borrow-Save Representation","authors":"Sophie Dupuis, R. Chotin-Avot, H. Mehrez","doi":"10.1109/ISVLSI.2008.29","DOIUrl":"https://doi.org/10.1109/ISVLSI.2008.29","url":null,"abstract":"Considering the performance increase provided by redundant operators such as adders and multipliers, it appears interesting to generalize the use of those operators in high computational digital circuit design. Using redundant arithmetic in conjunction with classical arithmetic is nevertheless a complex task. Optimization CAD tools which automate its use become therefore very helpful. However the existing approaches are restricted in using only the Carry-Save representation. In this paper we propose to overcome this limitation with an exploration of the possible optimizations of using the Borrow-Save representation also. To illustrate this, the optimizations of a Distance Computation Unit (DCU) and a Discrete Cosine Transform (DCT) operators are presented.","PeriodicalId":289357,"journal":{"name":"2008 IEEE Computer Society Annual Symposium on VLSI","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116133740","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书