Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Thomas B. PreuBer"'
Publikováno v:
FPL
Content-Addressable Memory (CAM) is a powerful abstraction for building memory caches, routing tables and hazard detection logic. Without a native CAM structure available on FPGA devices, their functionality must be emulated using the structural prim
Publikováno v:
FPL
Data sketches are a set of widely used approximated data summarizing techniques. Their fundamental property is sub-linear memory complexity on the input cardinality, an important aspect when processing streams or data sets with a vast base domain (UR
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6cc65a66fb2e3469cfcce5425af4350
Scaling Neural Network Performance through Customized Hardware Architectures on Reconfigurable Logic
Autor:
Yaman Umuroglu, Thomas B. PreuBer, Kenneth O'Brien, Miriam Leeser, Michaela Blott, Nicholas J. Fraser, Giulio Gambardella
Publikováno v:
ICCD
2017 IEEE International Conference on Computer Design (ICCD)
2017 IEEE International Conference on Computer Design (ICCD)
Convolutional Neural Networks have dramatically improved in recent years, surpassing human accuracy on certain problems and performance exceeding that of traditional computer vision algorithms. While the compute pattern in itself is relatively simple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c26696c41f07ad500d828f59088cb070
http://arxiv.org/abs/1807.03123
http://arxiv.org/abs/1807.03123
Publikováno v:
FCCM
As programmable logic is conquering data centers, FPGA resources become a ubiquitously available commodity available through the cloud. In these ecosystems, their employment must advance to fit the role of a dynamically managed, shared resource withi
Autor:
Fredo Erxleben, Thomas B. PreuBer
Publikováno v:
SiPS
The synthesis and mapping of user designs to configurable hardware is typically performed by heuristics. These approaches analyze the decomposability of the combinational user functions as a starting point and derive appropriate mappings to LUT struc
Publikováno v:
FCCM
The mapping of reads, i.e. short DNA base pair strings, to large genome databases has become a critical operation for genetic analysis and diagnosis. Although this mapping operation is a simple string search tolerant of some character mismatches, it
Autor:
Rainer G. Spallek, Thomas B. Preuber
Publikováno v:
ASAP
It was previously shown [5] that the BRESENHAM algorithm [2] is well-suited for digital fractional clock generation. Specifically, it proved to be the optimal approximation of a desired clock in terms of the edges provided by the reference clock. Mor