2011 VII Southern Conference on Programmable Logic (SPL)最新文献

筛选
英文 中文
Python as a hardware description language: A case study Python作为硬件描述语言:一个案例研究
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782635
J. I. Villar, J. Juan, M. Bellido, J. Viejo, D. Guerrero, J. Decaluwe
{"title":"Python as a hardware description language: A case study","authors":"J. I. Villar, J. Juan, M. Bellido, J. Viejo, D. Guerrero, J. Decaluwe","doi":"10.1109/SPL.2011.5782635","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782635","url":null,"abstract":"Many people may see the development of software and hardware like different disciplines. However, there are great similarities between them that have been shown due to the appearance of extensions for general purpose programming languages for its use as hardware description languages. In this contribution, the approach proposed by the MyHDL package to use Python as an HDL is analyzed by making a comparative study. This study is based on the independent application of Verilog and Python based flows to the development of a real peripheral. The use of MyHDL has revealed to be a powerful and promising tool, not only because of the surprising results, but also because it opens new horizons towards the development of new techniques for modeling and verification, using the full power of one of the most versatile programming languages nowadays.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"33 1","pages":"117-122"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87749743","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}
引用次数: 25
A novel method for secure intellectual property deployment in embedded systems 一种在嵌入式系统中安全部署知识产权的新方法
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782649
Sunil Malipatlolla, S. Huss
{"title":"A novel method for secure intellectual property deployment in embedded systems","authors":"Sunil Malipatlolla, S. Huss","doi":"10.1109/SPL.2011.5782649","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782649","url":null,"abstract":"The configuration data sequence of a Field Programmable Gate Array (FPGA) is an Intellectual Property (IP) of the original designer. With the increase in deployment of FPGAs in modern embedded systems, the IP protection of FPGA has become a necessary requirement for many IP vendors. There have been already many proposals to overcome this problem using symmetric encryption techniques but these methods need a cryptographic key to be stored in a non-volatile memory located on FPGA or in a battery-backed RAM as done in some of the current FPGAs. The expenses with the proposed methods are, occupation of larger area on FPGA in the former case and limited lifetime of the device in the latter. In contrast, we propose a novel method which combines the Dynamic Partial Reconfiguration (Dynamic PR) feature of an SRAM-based FPGA with the Public Key Cryptography (PKC) to protect the FPGA configuration files without the need of fixed key storage on FPGA or external to FPGA. The proposed method, is secure against the known attacks such as the Man-In-The-Middle (MITM) attack and replay attack. Therefore, the method can be used for secure deploying of IPs from local and remote vendors. Also, using this novel method not only high-end FPGAs but also low-end FPGAs with PR capabilities are secured.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"258 1","pages":"203-208"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75557020","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
Using partial reconfigurability to aid debugging of FPGA designs 利用部分可重构性帮助FPGA设计调试
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782651
A. Ehliar, J. Siverskog
{"title":"Using partial reconfigurability to aid debugging of FPGA designs","authors":"A. Ehliar, J. Siverskog","doi":"10.1109/SPL.2011.5782651","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782651","url":null,"abstract":"This paper discusses the use of partial reconfigurability in Xilinx FPGA designs in order to aid debugging. A debugging framework is proposed where the use of partial reconfigurability can allow for added flexibility by allowing a debugger to decide at run time what debugging module to use. This paper also presents an open source debugging tool which allows a user to read-out the contents of memory blocks in Xilinx designs without needing to use any JTAG adapter. This allows a user to debug an FPGA in situations which would otherwise be difficult, i.e. in the field.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"34 2","pages":"215-220"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72548600","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
Spanning forests in constant time using FPGAS applied to network design problems 用fpga在恒定时间内跨越森林解决网络设计问题
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782645
T. Silva, Marcilyanne Moreira Gois, Paulo Matias, A. Delbem, E. Marques, Vanderlei Bonato
{"title":"Spanning forests in constant time using FPGAS applied to network design problems","authors":"T. Silva, Marcilyanne Moreira Gois, Paulo Matias, A. Delbem, E. Marques, Vanderlei Bonato","doi":"10.1109/SPL.2011.5782645","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782645","url":null,"abstract":"Problems involving network design can be found in many real world applications such as power systems, vehicle routing, telecommunication networks, phylogenetic trees, among others. These problems involve thousands or millions of input variables and often need information and solution in real time. In general, they are computationally complex (NP-Hard). In this context, metaheuristics like evolutionary algorithms have been investigated. Recently, researches have shown that the performance of evolutionary algorithms for network design problems can be significantly increased by means of more appropriate dynamic data structures (encodings). To achieve high performance, we parallelized the application via a dynamic data structure, called node-depth encoding for representation of a set (population) of spanning forests. This paper proposes an FPGA-based hardware architecture, denominated Hardware-Parallelized NDE (HPNDE), which is able to generate spanning trees (forests) in a constant average running time O(1), enabling its application in real large-scale problems, given an FPGA with enough resources to implement such structure. The parallelized approach is 1.5k times faster than its sequential counterpart.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"15 1","pages":"179-184"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87960648","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 low-latency parallel architecture for digital PLL with application to ultra-high speed carrier recovery systems 一种适用于超高速载波恢复系统的新型低延迟数字锁相环并行架构
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782621
P. Gianni, H. Carrer, G. Corral-Briones, M. Hueda
{"title":"A novel low-latency parallel architecture for digital PLL with application to ultra-high speed carrier recovery systems","authors":"P. Gianni, H. Carrer, G. Corral-Briones, M. Hueda","doi":"10.1109/SPL.2011.5782621","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782621","url":null,"abstract":"This paper introduces a new low latency parallel processing digital carrier recovery (CR) architecture suitable for ultra-high speed intradyne coherent optical receivers (e.g. ≥ 100Gb/s). The proposed parallel scheme builds upon a novel digital phase locked loop (DPLL) architecture, which breaks the bottleneck of the feedback path. Thus, it is avoided the high latency introduced by the parallel processing implementation in the feedback loop of traditional DPLLs. Numerical results show that the bandwidth and the capture range of the new parallel DPLL are close to those achieved by a serial DPLL. This excellent behavior makes the proposed low latency parallel DPLL architecture an excellent choice for implementing high speed CR systems in both ASIC and FPGA platforms.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"123 1","pages":"31-36"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91313252","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
Soft error in FPGA-implemented asynchronous circuits fpga实现异步电路中的软误差
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782652
W. Kuang, Yu Bai
{"title":"Soft error in FPGA-implemented asynchronous circuits","authors":"W. Kuang, Yu Bai","doi":"10.1109/SPL.2011.5782652","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782652","url":null,"abstract":"In this paper, we investigate the mechanism of soft error generation and propagation in asynchronous circuits which are implemented on FPGAs. The effects of the soft errors on Quasi-delay-insensitive (QDI) asynchronous circuits are analyzed. The results show that it is much easier to detect the soft error in asynchronous circuits implemented on FPGAs so that FPGAs can be reprogrammed, compared with traditional synchronous circuits.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"4 1","pages":"221-226"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73472787","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
Experiences applying framework-based functional verification to a design for programmable logic 有将基于框架的功能验证应用于可编程逻辑设计的经验
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782634
O. Goni, M. Vazquez, E. Todorovich, G. Sutter
{"title":"Experiences applying framework-based functional verification to a design for programmable logic","authors":"O. Goni, M. Vazquez, E. Todorovich, G. Sutter","doi":"10.1109/SPL.2011.5782634","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782634","url":null,"abstract":"This paper presents experiences in applying modern functional verification to a configurable decimal floating point Adder / Subtractor core targeted to programmable logic. Despite its huge input space, a number of hard-to-verify corner cases are identified. Two different verification frameworks were applied in order to develop testbenches: OVM and Truss. These tesbenches were built to be independent of the ALU operand representation and IEEE754-2008 specific modules were also implemented. Verification results, the experience itself, and a comparative study of the alternatives was made and summarized for designers and verification engineers.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"16 1","pages":"109-115"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73871780","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 high data rate BPSK receiver implementation in FPGA for high dynamics applications 高数据速率BPSK接收机的FPGA实现,用于高动态应用
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782654
Juan Augusto Maya, Nicolas A. Casco, P. A. Roncagliolo, Javier G. García
{"title":"A high data rate BPSK receiver implementation in FPGA for high dynamics applications","authors":"Juan Augusto Maya, Nicolas A. Casco, P. A. Roncagliolo, Javier G. García","doi":"10.1109/SPL.2011.5782654","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782654","url":null,"abstract":"In this paper we present the implementation of a FPGA based high data rate BPSK receiver specifically designed to withstand the high dynamics of airborne vehicles (i.e. aircraft, sounding rockets, satellites, etc.). The carrier recovery is implemented through a Costas loop, and a Gardner detector is used for the timing recovery. This architecture was chosen because it provides almost independent carrier and bit synchronization. Loop filters were designed through analog to discrete-time conversion. A theoretical analysis of the design, simulation and its implementation is presented.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"50 1","pages":"233-238"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76175267","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
Iterative decimal multiplication using binary arithmetic 使用二进制算法的迭代十进制乘法
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782658
M. Véstias, H. Neto
{"title":"Iterative decimal multiplication using binary arithmetic","authors":"M. Véstias, H. Neto","doi":"10.1109/SPL.2011.5782658","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782658","url":null,"abstract":"The IEEE-754 2008 standard for floating point arithmetic has definitely dictated the importance of decimal arithmetic. Human-centric applications, like financial and commercial, depend on decimal arithmetic since the results must match exactly those obtained by human calculations. A few hardware approaches have been proposed for decimal arithmetic, including addition, subtraction, multiplication and division. Parallel implementations for these operations are very expensive in terms of occupied resources and therefore implementations based on iterative algorithms are good alternatives. In this paper, we propose an iterative decimal multiplier for FPGA that uses binary arithmetic. The circuits were implemented in a Xilinx Virtex 4 FPGA. The results indicate that the proposed iterative multipliers are very competitive when compared to decimal multipliers implemented with direct manipulation of BCD numbers.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"96 1","pages":"257-262"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90519994","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
Balanced bipartitioning of a multi-weighted hypergraph for heterogeneous FPGAS 异构fpga的多加权超图平衡双划分
2011 VII Southern Conference on Programmable Logic (SPL) Pub Date : 2011-04-13 DOI: 10.1109/SPL.2011.5782631
Sagnik Mukhopadhyay, Pritha Banerjee, S. Sur-Kolay
{"title":"Balanced bipartitioning of a multi-weighted hypergraph for heterogeneous FPGAS","authors":"Sagnik Mukhopadhyay, Pritha Banerjee, S. Sur-Kolay","doi":"10.1109/SPL.2011.5782631","DOIUrl":"https://doi.org/10.1109/SPL.2011.5782631","url":null,"abstract":"In this paper, we present a heuristic algorithm for bipartitioning a netlist of modules having m types of heterogeneous resources, as in modern FPGAs with configurable logic blocks (CLBs), Block RAMs and Multipliers (MULs). The desired min-cut bipartition has to satisfy m constraints arising from given balance ratios, one for each type of resource. The netlist is represented as a hypergraph, whose vertices correspond to the modules. Each vertex has a m-tuple weight vector, denoting the number of resource units of each type. Our proposed multi-constraint bipartitioner is based on dynamic programming, which employs a single-constraint bipartitioner. The upper bounds for mean deviation in combined balance ratio, and for the increment in cut-size are presented. Experimental results on a set of benchmarks show that on the average there is negligible deviation in cut-size for multi-constraint bipartitions from single-constraint bipartion, while satisfying the individual balance ratio constraints for each type of resource.","PeriodicalId":6329,"journal":{"name":"2011 VII Southern Conference on Programmable Logic (SPL)","volume":"19 1","pages":"91-96"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88925550","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
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学术官方微信