检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

597 篇 会议
32 篇 期刊文献

馆藏范围

629 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

534 篇 工学
- 480 篇 计算机科学与技术...
- 281 篇 软件工程
- 219 篇 电子科学与技术（可...
- 170 篇 电气工程
- 91 篇 信息与通信工程
- 33 篇 动力工程及工程热...
- 33 篇 控制科学与工程
- 27 篇 机械工程
- 16 篇 生物工程
- 14 篇 建筑学
- 12 篇 仪器科学与技术
- 10 篇 土木工程
- 8 篇 冶金工程
- 8 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 6 篇 材料科学与工程（可...
- 5 篇 光学工程
- 3 篇 测绘科学与技术
201 篇 理学
- 165 篇 数学
- 35 篇 物理学
- 20 篇 统计学（可授理学、...
- 17 篇 生物学
- 7 篇 系统科学
- 6 篇 化学
55 篇 管理学
- 47 篇 管理科学与工程(可...
- 30 篇 工商管理
- 9 篇 图书情报与档案管...
15 篇 经济学
- 15 篇 应用经济学
11 篇 法学
- 9 篇 社会学
4 篇 艺术学
- 4 篇 设计学（可授艺术学...
3 篇 农学
2 篇 教育学

主题

285 篇 field programmab...
169 篇 field programmab...
50 篇 signal processin...
50 篇 clocks
49 篇 modulation
49 篇 ofdm
49 篇 estimation
49 篇 filtration
30 篇 fpga
8 篇 field-programmab...
7 篇 fpgas
7 篇 logic gates
7 篇 systolic arrays
7 篇 optimization
7 篇 switches
7 篇 high-level synth...
7 篇 hardware
7 篇 field-programmab...
7 篇 reconfigurable c...
6 篇 routing

机构

6 篇 univ of toronto ...
5 篇 university of to...
5 篇 univ of toronto
5 篇 univ of californ...
5 篇 altera corporati...
4 篇 univ british col...
4 篇 dept. of cs 256-...
4 篇 department of el...
4 篇 imperial college...
4 篇 intel corporatio...
3 篇 computer science...
3 篇 tsinghua univers...
3 篇 department of ee...
3 篇 georgia inst tec...
3 篇 department of el...
3 篇 nanyang technol ...
3 篇 xilinx inc. san ...
3 篇 northwestern uni...
3 篇 fudan university
3 篇 state key lab of...

作者

20 篇 rose jonathan
20 篇 cong jason
11 篇 betz vaughn
10 篇 wawrzynek john
10 篇 chen deming
9 篇 dehon andré
9 篇 hauck scott
9 篇 zhang zhiru
8 篇 wilton steven j....
8 篇 schmit herman
7 篇 constantinides g...
7 篇 chow paul
7 篇 langhammer marti...
6 篇 wilton steven j....
6 篇 pasca bogdan
6 篇 li fei
5 篇 anderson jason h...
5 篇 dehon andre
5 篇 cheung peter y. ...
5 篇 ienne paolo

语言

622 篇 英文
7 篇 其他

检索条件"任意字段=Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays"

共 629 条记录，以下是551-560 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Synthesis for FPGAs with embedded memory blocks 00

Synthesis for FPGAs with embedded memory blocks

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Cong, Jason Yan, Kenneth Univ of California Los Angeles CA United States

ISBN: (纸本)9781581131932

Embedded memory blocks (EMBs) are used in modern field programmable gate arrays (FPGAs) for implementation of on-chip memories or specialized logic functions. In this paper, we propose an integrated approach with structural clustering and functional decomposition to minimize the circuit area using EMBs while preserving the circuit delay. The structural clustering method is based on the concepts of Maximum Fanout Free Cone (MFFC) and Maximum Fanout Free Subgraph (MFFS). In order to effectively use EMB in large clusters, single-output and multiple-output functional decompositions are used to decompose large clusters so that the encoding functions or base functions can be implemented by EMBs. It also considers multiple EMBs for individual large cluster so that better area reduction can be obtained. We have developed an algorithm called EMB_Syn that can be used as a postprocessing tool in the FPGA synthesis flow. MCNC benchmarks are used to test EMB_Syn on Altera's FLEX10K device family and the experimental results are compared with those by EMB_Pack and SMAP. When EMB_Syn is used as postmapping processing, it shows 45.06% and up to 5.23% improvements over EMB_Pack and SMAP, respectively, in terms of the covered area by EMBs.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Timing-driven placement for FPGAs 00

Timing-driven placement for FPGAs

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Marquardt, Alexander Betz, Vaughn Rose, Jonathan Right Track CAD Corp Toronto Ont Canada

ISBN: (纸本)9781581131932

In this paper we introduce a new Simulated Annealing-based timing-driven placement algorithm for FPGAs. This paper has three main contributions. First, our algorithm employs a novel method of determining source-sink connection delays during placement. Second, we introduce a new cost function that trades off between wire-use and critical path delay, resulting in significant reductions in critical path delay without significant increases in wire-use. Finally, we combine connection-based and path-based timing-analysis to obtain an algorithm that has the low time-complexity of connection-based timing-driven placement, while obtaining the quality of path-based timing-driven placement. A comparison of our new algorithm to a well known non-timing-driven placement algorithm demonstrates that our algorithm is able to increase the post-place-and-route speed (using a full path-based timing-driven router and a realistic routing architecture) of 20 MCNC benchmark circuits by an average of 42%, while only increasing the minimum wiring requirements by an average of 5%.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Technology mapping for k/m-macrocell based FPGAs 00

Technology mapping for k/m-macrocell based FPGAs

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Cong, Jason Huang, Hui Yuan, Xin Univ of California Los Angeles CA United States

ISBN: (纸本)9781581131932

In this paper, we study the technology mapping problem for a novel FPGA architecture that is based on k-input single-output PLA-like cells, or, k/m-macrocells. Each cell in this architecture can implement a single output function of up to k inputs and up to m product terms. We develop a very efficient technology mapping algorithm, k_m_flow, for this new type of architecture. The experiment results show our algorithm can achieve depth-optimality in practically all cases. Furthermore it is shown that the k/m-macrocell based FPGAs are practically equivalent to the traditional k-LUT based FPGAs with only a relatively small number of product terms (m≤k+3). We also investigate the total area and delay of k/m-macrocell based FPGAs on various benchmarks to compare it with commonly used 4-LUT based FPGAs. The experimental result shows k/m-macrocell based FPGAs can outperform 4-LUT based FPGAs in terms of both delay and area after placement and routing by VPR.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Representation for dynamic graphs in reconfigurable hardware and its application to fundamental graph algorithms

Representation for dynamic graphs in reconfigurable hardware...

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Huelsbergen, Lorenz Bell Lab Murray Hill United States

This paper gives a representation for graph data structures as electronic circuits in reconfigurable hardware. Graph properties, such as vertex reachability, are computed quickly by exploiting a graph's edge parallelism - signals propagate along many graph edges concurrently. This new representation admits arbitrary graphs in which vertices/edges may be inserted and deleted dynamically at low cost - graph modification does not entail any re-fitting of the graph's circuit. Dynamic modification is achieved by rewriting cells in a re-configurable hardware array. Dynamic graph algorithms are given for vertex reachability, transitive closure, shortest unit path, cycle detection, and connected-component identification. On the task of computing a graph's transitive closure, for example, simulation of such a dynamic graph processor indicates possible speedups greater than three orders of magnitude compared to an efficient software algorithm running on a contemporaneously fast uniprocessor. Implementation of a prototype in an FPGA verifies the accuracy of the simulation and demonstrates that a practical and efficient (compact) mapping of the graph construction is possible in existing FPGA architectures. In addition to speeding conventional graph computations with dynamic graph processors, we note their potential as parallel graph reducers implementing general (Turing equivalent) computation.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Generating highly-routable sparse crossbars for PLDs 00

Generating highly-routable sparse crossbars for PLDs

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Lemieux, Guy Leventis, Paul Lewis, David Univ of Toronto Toronto Ont Canada

ISBN: (纸本)9781581131932

A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to accurately compute the percentage of random test vectors that can be routed. The construction method attempts to maximize the spread of the switch locations, such that any given subset of input wires can connect to as many output wires as possible. Based on Hall's Theorem, we argue that this increases the likelihood of routing. The hardest test vectors to route are those which attempt to use all of the crossbar outputs. Results in this paper show that area-efficient sparse crossbars can be constructed by providing more outputs than required and a sufficient number of switches. In a few specific case studies, it is shown that sparse crossbars with about 90% fewer switches than a full crossbar can be constructed, and these crossbars are capable of routing over 95% of randomly chosen routing vectors. In one case, a new switch matrix which can replace the one in the Altera FLEX8000 family is shown. This new switch matrix uses approximately 14% more transistors, yet can increase the routability of the most difficult test vectors from 1% to over 96%.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Tolerating operational faults in cluster-based FPGAs 00

Tolerating operational faults in cluster-based FPGAs

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Lakamraju, Vijay Tessier, Russell Univ of Massachusetts Amherst MA United States

ISBN: (纸本)9781581131932

In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain hardware redundancy to allow for continued operation in the presence of operational faults, the need to recover faulty hardware and return it to full functionality quickly and efficiently is great. In addition to providing functional density, FPGAs provide a level of fault tolerance generally not found in mask-programmable devices by including the capability to reconfigure around operational faults in the field. In this paper, incremental CAD techniques are described that allow functional recovery of FPGA design configurations in the presence of single or multiple operational faults. Our preferred approach to fault recovery takes advantage of device routing hierarchy in architectural families such as Xilinx Virtex and Altera Apex to quickly swap unused logic and routing resources in place of faulty ones within logic clusters. These algorithms allow for straightforward implementation within a local fault-tolerant system without the need to access a remote processing location. If initial recovery attempts through localized swapping fail, an incremental router based on the widely-used PathFinder maze routing algorithm can be applied remotely in an attempt to form connections between newly-allocated logic and interconnect based on the history of the initial design route.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Factoring large numbers with programmable hardware 00

Factoring large numbers with programmable hardware

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Kim, Hea Joung Mangione-Smith, William H. Univ of California Los Angeles CA United States

ISBN: (纸本)9781581131932

Most advanced forms of security for electronic transactions rely on the public-key cryptosystems developed by Rivest, Shamir and Adleman. Unfortunately, these systems are only secure while it remains difficult to factor large integers. The fastest published algorithms for factoring large numbers have a common sieving step. These sieves collect numbers that are completely factored by a set of prime numbers that are known in advance. Furthermore, the time required to execute these sieves currently dominates the runtime of the factoring algorithms. We show how the sieving process can be mapped to the Mojave configurable computing architecture. The mapping exploits unique properties of the sieving algorithms to fully utilize the bandwidth of a multiple bank interleaved memory system. The sieve has been mapped to a single programmable hardware unit on the Mojave computer, and achieves a clock frequency of 16 MHz. The full system implementation sieves over 28 times faster than an UltraSPARC Workstation. A simple upgrade to 8 ns SRAMs will result in a speedup factor of 160.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of FPGA routing architectures from high-level descriptions 00

Automatic generation of FPGA routing architectures from high...

引用

FPGA 2000: acm/sigda international symposium on field programmable gate arrays

作者： Betz, Vaughn Rose, Jonathan Right Track CAD Corp Toronto Ont Canada

ISBN: (纸本)9781581131932

In this paper we present a `high-level' FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. We then present an `architecture generator' built into the VPR CAD tool that converts this high-level architecture description into a detailed and completely specified flat FPGA architecture. This flat architecture is the representation with which CAD optimization and visualization modules typically work. By allowing FPGA researchers to specify an architecture at a high-level, an architecture generator enables quick and easy `what-if' experimentation with a wide range of FPGA architectures. The net effect is a more fully optimized final FPGA architecture. In contrast, when FPGA architects are forced to use more traditional methods of describing an FPGA (such as the manual specification of every switch in the basic tile of the FPGA), far less experimentation can be performed in the same time, and the architectures experimented upon are likely to be highly similar, leaving important parts of the design space completely unexplored. This paper describes the automated routing architecture generation problem, and highlights the two key difficulties - creating an FPGA architecture that matches all of an FPGA architect's specifications, while simultaneously determining good values for the many unspecified portions of an FPGA so that a high quality FPGA results. We describe the method by which we generate FPGA routing architectures automatically, and present several examples.

关键词： field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Artificial neural network implementation on a single FPGA of a pipelined on-line backpropagation 13

Artificial neural network implementation on a single FPGA of...

引用

13th international symposium on System Synthesis (ISSS 2000)

作者： Gadea, R Cerdá, J Ballester, F Mocholí, A Univ Politecn Valencia Dept Elect Engn Valencia 46022 Spain

ISBN: (纸本)0769507662

The paper describes the implementation of a systolic array for a multilayer perceptron on a Virtex XCV400 FPGA with a hardware-friendly learning algorithm. A pipelined adaptation of the on-line backpropagation algorithm is shown. Parallelism is better exploited because both forward and backward phases can be performed simultaneously. We can implement very large interconnection layers by using large Xilinx devices with embedded memories alongside the projection used in the systolic architecture. These physical and architectural features - together with the combination of FPGA reconfiguration properties with a design flow based on generic VHDL - create an easy, flexible, and fast method of designing a complete ANN on a single FPGA. The result offers a high degree of parallelism and fast performance.

关键词： Arithmetic Artificial neural networks Backpropagation algorithms field programmable gate arrays Logic arrays Logic devices Neural networks Neurons Signal processing algorithms Systolic arrays

来源：评论

学校读者我要写书评

暂无评论

Embedded systems verification with FGPA-enhanced in-circuit emulator 13

Embedded systems verification with FGPA-enhanced in-circuit ...

引用

13th international symposium on System Synthesis (ISSS 2000)

作者： Meerwein, M Baumgartner, C Wieja, T Glauert, W Robert Bosch GmbH Automot Equipment Div 8 D-72703 Reutlingen Germany

ISBN: (纸本)0769507662

In this paper we present a novel coverification concept for embedded microcontrollers that satisfies industrial requirements. Based on a commercially available CPU in-circuit emulator coupled with FPGA boards, it verifies the correctness of an implementation in terms of function and timing within a real-world environment. Using our system, the software engineer can write, test and optimize programs for a chip that is not yet physically existent. In addition the system is used to obtain software module characterization data required for system partitioning. Its ability to integrate analog circuitry enables verification of the complete system-on-chip. Our methodology is fully integrated into the ASIC design flow providing ease of use and a high level of verification accuracy.

关键词： Circuit testing Embedded system field programmable gate arrays Microcontrollers Software systems Software testing System testing System-on-a-chip Systems engineering and theory Timing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共63页 << < 52 53 54 55 56 57 58 59 60 61 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：