2011 International Symposium on Electronic System Design最新文献

筛选
英文 中文
Optimizing Test Architecture for TSV Based 3D Stacked ICs Using Hard SOCs 基于硬soc的TSV 3D堆叠ic测试架构优化
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.29
S. Roy, C. Giri, A. Chakraborty, Subhro Mukherjee, D. K. Das, H. Rahaman
{"title":"Optimizing Test Architecture for TSV Based 3D Stacked ICs Using Hard SOCs","authors":"S. Roy, C. Giri, A. Chakraborty, Subhro Mukherjee, D. K. Das, H. Rahaman","doi":"10.1109/ISED.2011.29","DOIUrl":"https://doi.org/10.1109/ISED.2011.29","url":null,"abstract":"In this paper we have addressed the test infrastructure design for TSV based 3D stacked IC (3D SIC). Each of the die consisting of one or more hard SOCs. Main objective of this work is to design the test architecture for the 3D SIC so that overall test time can be optimized. To prove the efficiency of our proposed algorithm we have considered a 3D stacked IC (SIC) using 5 standard SOCs. Obtained test results show that our proposed solution can achieve up to 59 % reduction in test time compared to the baseline method of sequentially testing all the dies in the stack. We have also shown that increasing the number of test access mechanism (TAM) and through silicon vias (TSVs) help in the reduction of test time but the increase in the number of TAM is unnecessary after a certain limit. In this work we have assumed that the different dies in different layers may consist of two SOCs as opposed to previous work, where each die consists of single SOC.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123742717","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
Runtime Congestion and Crosstalk Aware Router for FPGA Using Jbits3.0 for Partial Reconfigurable Application 基于Jbits3.0的FPGA运行时拥塞和串扰感知路由器
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.16
N. Das, P. Roy, H. Rahaman
{"title":"Runtime Congestion and Crosstalk Aware Router for FPGA Using Jbits3.0 for Partial Reconfigurable Application","authors":"N. Das, P. Roy, H. Rahaman","doi":"10.1109/ISED.2011.16","DOIUrl":"https://doi.org/10.1109/ISED.2011.16","url":null,"abstract":"With the reduction in chip size, the cross talk has become a critical concern among the designers. One of the major techniques to avoid the cross talk effect is to route the critical path in such a way that no interferences occur between the interconnects. In this paper we have proposed a run time congestion and cross talk aware router for FPGA using Jbits3.0. Since, in FPGA routing, resources are fixed so in contrary to ASICs, that, the FPGAs do not have the luxury of utilizing any rerouting options within the wafer-as it requires. So, we routed only those nets having length more than a predetermined critical length or the critical path to avoid cross talk. Hence, congestion and cross talk aware routing can be performed using smaller routing area. Here, we have implemented the router by using class provided by JBits for Xilinx, Vertex-II FPGA (xc2V1000). It has been found that the results are quite encouraging.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128792792","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
An Efficient Method for Using Transaction Level Assertions in a Class Based Verification Environment 在基于类的验证环境中使用事务级断言的有效方法
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.32
Naveen Sudhish, B. Raghavendra, Harish Yagain
{"title":"An Efficient Method for Using Transaction Level Assertions in a Class Based Verification Environment","authors":"Naveen Sudhish, B. Raghavendra, Harish Yagain","doi":"10.1109/ISED.2011.32","DOIUrl":"https://doi.org/10.1109/ISED.2011.32","url":null,"abstract":"Transaction level assertions are powerful way of abstracting property of a design. This paper talks about application of transaction level assertion in a transaction driven verification (TDV)environment and shows how assertions on meaningful collection of transactions from different verification component checks property of a design under verification (DUV) using SVA. In conventional class based transaction driven verification environment (example OVM, UVM), system verilog temporal assertions are possible only in design elements like module. So for modeling transaction level assertions, transactions are needed to pass from class environment to module/program block where the assertions are implemented. Here we are proposing a new method for doing transaction level assertions by exploiting concept of method ports and system verilog scoping rules.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130624284","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}
引用次数: 8
Instruction Scheduling on Variable Latency Functional Units of VLIW Processors VLIW处理器可变延迟功能单元的指令调度
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.50
Nayan V. Mujadiya
{"title":"Instruction Scheduling on Variable Latency Functional Units of VLIW Processors","authors":"Nayan V. Mujadiya","doi":"10.1109/ISED.2011.50","DOIUrl":"https://doi.org/10.1109/ISED.2011.50","url":null,"abstract":"In Very Long Instruction Word (VLIW) processors, based on the available instruction-level parallelism in programs, compilers schedule operations onto different functional units. By assuming all the functional units of same kind and having the same latency, the conventional list-scheduling algorithm selects the first available (free) functional unit to schedule an operation. But, in advanced process technologies due to process variation, functional units of same kind may have different latencies. In such situation, conventional scheduling algorithms may not yield good performance. In this work, we address an interesting problem of how to schedule operations on variable latency functional units of a VLIW processor. We propose an algorithm to schedule operations on non-uniform latency functional units and compare our algorithm with the conventional list-scheduling algorithm.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121436890","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}
引用次数: 16
Image Authentication Using Hough Transform Generated Self Signature in DCT Based Frequency Domain (IAHTSSDCT) 基于DCT频域的Hough变换自签名图像认证(IAHTSSDCT)
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.43
M. Sengupta, J. K. Mandal
{"title":"Image Authentication Using Hough Transform Generated Self Signature in DCT Based Frequency Domain (IAHTSSDCT)","authors":"M. Sengupta, J. K. Mandal","doi":"10.1109/ISED.2011.43","DOIUrl":"https://doi.org/10.1109/ISED.2011.43","url":null,"abstract":"In this paper a DCT based steganographic technique in frequency domain, termed as IAHTSSDCT has been proposed for authentication of gray scale images. The cover image passes through Hough transformation based on hash function to generate unique signature treated as secret information. As the first step of embedding the cover image transformed into time domain using 2x2 masks in row major order using DCT resulting its corresponding frequency components. Using a secret key and hash function the secret signature/information is embedded into selective AC coefficients. To generate stegoimage those frequency coefficients then passes through inverse DCT. Extraction is also done through same procedure. Experimental results are computed and compared with the existing steganographic techniques like SAWT [1] and YulinWang [3] in terms of Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) and Image Fidelity (IF) which show better performances in IAHTSSDCT.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114761651","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}
引用次数: 4
A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC) 基于视觉密码(SCOSVC)的最优共享秘密通信新技术
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.49
J. K. Mandal, S. Ghatak
{"title":"A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC)","authors":"J. K. Mandal, S. Ghatak","doi":"10.1109/ISED.2011.49","DOIUrl":"https://doi.org/10.1109/ISED.2011.49","url":null,"abstract":"In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125723437","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
A Message Embedded Authentication of Songs to Verify Intellectual Property Right (MEAS) 基于信息嵌入的歌曲知识产权认证(MEAS)
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.44
U. K. Mondal, J. K. Mandal
{"title":"A Message Embedded Authentication of Songs to Verify Intellectual Property Right (MEAS)","authors":"U. K. Mondal, J. K. Mandal","doi":"10.1109/ISED.2011.44","DOIUrl":"https://doi.org/10.1109/ISED.2011.44","url":null,"abstract":"In this paper, an approach has been made to provide security to digital song through embedding some secret information like singer name, album title, genre, etc on some precalculated portion of the song without changing its audible quality. Authenticating code is embedded as secrete information into original signal in the proposed technique. The embedded unique secret code is used to detect and identify the original song from similar available songs. A comparative study has been made with similar existing techniques and experimental results are also presented based on Microsoft WAVE (\".wav\") stereo sound files.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130903921","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 Best Path Selection Based Parallel Router for DMFBs 基于最佳路径选择的dmfb并行路由器
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.33
P. Roy, H. Rahaman, Rupam Bhattacharya, P. Dasgupta
{"title":"A Best Path Selection Based Parallel Router for DMFBs","authors":"P. Roy, H. Rahaman, Rupam Bhattacharya, P. Dasgupta","doi":"10.1109/ISED.2011.33","DOIUrl":"https://doi.org/10.1109/ISED.2011.33","url":null,"abstract":"Recent advances in the design of digital micro fluidic based biochips have revolutionized the area of biochemical analysis especially for low-cost, portable, and disposable devices targeted towards clinical diagnostics applications. A promising category of micro fluidic biochips relies on the principle of electro wetting-on-dielectric, whereby discrete droplets of nanoliter volumes can be manipulated using an array of electrodes. This emerging technology combines electronics with biology to open new application areas such as point-of-care diagnosis, on-chip DNA analysis, and automated drug discovery. With the rapid advancement in micro fluidic and micro fabrication technology the complexity of design is expected to increase enormously as the number of concurrent application of assays in a single device increases significantly. One of the major CAD issues in this area is the concurrent routing of droplets in the design of DMFBs. The objective of droplet routing is to schedule the movement of a number of droplets in a time multiplexed manner to avoid their cross contamination. In this paper we attempted to resolve this problem using a line probe based algorithm to estimate all possible routing paths for each droplets. Thereby we used a graph based model to select the most suitable path for each droplet in the context of collision avoidance, minimization of stalling and optimized utilization of resources. The algorithm guided with problem specific heuristics has been tested with a number of standard test benches and the experimental results obtained so far indicate encouraging developments.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116132392","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
A Novel 14-Transistors Low-Power High-Speed PPM Adder 一种新型14晶体管低功耗高速PPM加法器
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.19
Ramracksha Tripathi, Shivshankar Mishra, S. Prakash
{"title":"A Novel 14-Transistors Low-Power High-Speed PPM Adder","authors":"Ramracksha Tripathi, Shivshankar Mishra, S. Prakash","doi":"10.1109/ISED.2011.19","DOIUrl":"https://doi.org/10.1109/ISED.2011.19","url":null,"abstract":"In this paper we mainly deal with design and simulation of different redundant-binary full adder (Plus-Plus-Minus Adder) topologies using minimum number of transistors. These PPM adder topologies are simulated to evaluate their performance in total power dissipation, speed, and PDP. Compared with other PPM adder designs, the proposed novel design full adder topology features higher computing speed and lower energy (power delay product) operation. The simulation results reveal that the overall PDP for the proposed circuits have been improved by 10 % to 15 % at the supply voltage of 1.8V when compared with the reported PPM adder topologies at 0.18µm CMOS technology.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"6 51","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046167","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
System on Chip Implementation of Adaptive Moving Average Based Multiple-Model Kalman Filter for Denoising Fiber Optic Gyroscope Signal 基于自适应移动平均的多模型卡尔曼滤波对光纤陀螺信号去噪的片上系统实现
2011 International Symposium on Electronic System Design Pub Date : 2011-12-19 DOI: 10.1109/ISED.2011.61
P. KarthikK., P. Rangababu, S. L. Sabat, J. Nayak
{"title":"System on Chip Implementation of Adaptive Moving Average Based Multiple-Model Kalman Filter for Denoising Fiber Optic Gyroscope Signal","authors":"P. KarthikK., P. Rangababu, S. L. Sabat, J. Nayak","doi":"10.1109/ISED.2011.61","DOIUrl":"https://doi.org/10.1109/ISED.2011.61","url":null,"abstract":"This paper proposes a combination of adaptive moving average process with multiple model kalman filter to efficiently denoise a digital Fiber Optic Gyroscope (FOG) signal. This algorithm has two phases i) Identification of transition of signal in a single frame of the signal ii) Filter the signal using a multiple model kalman filter. The transition locations are identified by comparing sample variance with a threshold value. Two different kalman filters are used to denoise the signal, one in the vicinity of transition region and other for non transition region. The performance of the algorithm is compared with adaptive moving average filter, standard kalman filter, standard multiple model kalman filter. Simulation results reveal that the proposed adaptive moving average based multiple model kalman filter (AMAMMKF) efficiently denoises the signal both in the transition and non-transition region. This paper also focuses on the system on chip (SoC) implementation of the proposed AMAMMKF algorithm in Virtex 5 FX70T1136-1 field programmable gate array (FPGA).","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125090502","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
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学术官方微信