共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Alan Mycroft Richard Sharp 《International Journal on Software Tools for Technology Transfer (STTT)》2003,4(3):271-297
The FLaSH (Functional Languages for Synthesising Hardware) system allows a designer to map a high-level functional language,
SAFL, and its more expressive extension, SAFL+, into hardware. The system has two phases: first we perform architectural exploration
by applying a series of semantics-preserving transformations to SAFL specifications; then the resulting specification is
compiled into hardware in a resource-aware manner – that is, we map separate functions to separate hardware functional units
(functions which are called multiple times become shared functional units). This article introduces the SAFL language and
shows how program transformations on it can explore area-time trade-offs. We then show how the FLaSH compiler compiles SAFL
to synchronous hardware and how SAFL transformations can also express hardware/software co-design. As a case study we demonstrate
how SAFL transformations allow us to refine a simple specification of a MIPS-style processor into pipelined and superscalar
implementations. The superset language SAFL+ (adding process calculi features but retaining many of the design aims) is then
described and given semantics both as hardware and as a programming language.
Published online: 17 December 2002 相似文献
3.
4.
Yau-Hwang Kuo Chao-Lieh Chen 《Fuzzy Systems, IEEE Transactions on》1998,6(2):266-285
A novel primitive cell structure for high-performance hardware realization of fuzzy computations is proposed in this paper. Such a cell structure is called generic LR fuzzy cell because it is an integral unit that encapsulates an LR fuzzy set and a basic fuzzy operation such as implication or arithmetic operation. Based on the proposed cell structure, we can develop two major kinds of fuzzy cell-LR fuzzy implication cell and LR fuzzy arithmetic cell-for the systematic synthesis of fuzzy application specific integrated circuits (ASICs) or general purposed fuzzy processors. The fuzzy systems synthesized with LR fuzzy cells possess the characteristics of decentralized knowledge manipulations and massively parallel inference. The system expandability and reconfigurability are also warrantable. This paper emphasizes on the design and application of fuzzy implication cell. The LR fuzzy implication cell is implemented with analog current mode technology. By this technology, an implication cell has the characteristics including small circuit area, high performance, low-power dissipation, etc. Moreover, the implication cell manipulates continuous data so that the realization of a pure fuzzy system is possible. In this paper, the key circuit characteristics of fuzzy implication cell are evaluated in details and there are two cases-fuzzy knowledge system and fuzzy mean filter-implemented to confirm the effectiveness and efficiency of fuzzy hardware synthesis by the LR fuzzy cells 相似文献
5.
Controllers for serial protocols are control-oriented designs that include complex state machines. Manually designing protocol controllers is thus tedious, error prone, and time-consuming. We present a new methodology for the efficient design of communication controller hardware suited for (but not limited to) complex, bit-serial protocols. Our methodology synthesizes controller hardware from a formal high-level specification of the protocol. In this approach, a single run of the synthesis algorithm synthesizes a complete communication architecture from a single protocol specification. The method not only reduces modeling effort but also ensures that both the interacting transaction producer and consumer controllers conform to the initial protocol specification 相似文献
6.
Andy Gill Tristan Bull Andrew Farmer Garrin Kimmell Ed Komp 《Higher-Order and Symbolic Computation》2012,25(2-4):255-274
In this article we overview the design and implementation of the second generation of Kansas Lava. Driven by the needs and experiences of implementing telemetry decoders and other circuits, we have made a number of improvements to both the external API and the internal representations used. We have retained our dual shallow/deep representation of signals in general, but now have a number of externally visible abstractions for combinatorial and sequential circuits, and enabled signals. We introduce these abstractions, as well as our abstractions for reading and writing memory. Internally, we found the need to represent unknown values inside our circuits, so we made aggressive use of associated type families to lift our values to allow unknowns, in a principled and regular way. We discuss this design decision, how it unfortunately complicates the internals of Kansas Lava, and how we mitigate this complexity. Finally, when connecting Kansas Lava to the real world, the standardized idiom of using named input and output ports is provided by Kansas Lava using a new monad, called Fabric. We present the design of this Fabric monad, and illustrate its use in a small but complete example. 相似文献
7.
We present SpExSim, a software tool for quickly surveying legacy code bases for kernels that could be accelerated by FPGA-based compute units. We specifically aim for low development effort by considering the use of C-based high-level hardware synthesis, instead of complex manual hardware designs. SpExSim not only exploits the spatially distributed model of computation commonly used on FPGAs, but can also model the effect of two different microarchitectures commonly used in C-to-hardware compilers, including pipelined architectures with modulo scheduling. The estimations have been validated against actual hardware generated by two current HLS tools.
相似文献8.
Many processes require controllers with an instant response (e.g. motor control, CNC machines). A high-performance PLC can be constructed with use of programmable logic devices. A lack of custom synthesis tools disables the use of standard languages widely accepted by automation designers. The paper presents the systematic process of a PLC program synthesis to hardware structure. An input PLC program is given according to the IEC61131-3 standard. The synthesis process has been developed for implementation of a program described with the LD and SFC languages. The essential idea of synthesis process is obtaining a massively parallel operating hardware structure that significantly reduces response processing time. The PLC program is translated into originally developed dedicated graph structure that enables a wide range of optimizations. In the next step, it is mapped into a hardware structure. In order to reduce resource requirements, a strategy with resource sharing is shown, which is an original extension of general mapping concepts. Modern FPGAs are equipped with arithmetic cores dedicated for signal processing, inspiring the development of the original DSP48 block mapping strategy. It attempts to utilize all features of the block in the pipelined calculation model. The considerations are summarized with the implementation result compared against standard PLC implementation, a mutual comparison of general hardware mapping, and with the use of DSP48 units. 相似文献
9.
Lower Bound Estimation of Hardware Resources for Scheduling in High-Level Synthesis 总被引:2,自引:0,他引:2 下载免费PDF全文
ShenZhaoxuan ChingChuen 《计算机科学技术学报》2002,17(6):0-0
In high-level synthesis of VLSI circuits,good lower bound prediction can efficiently narrow down the large space of possible designs.Previous approaches predict the lower bound by relaxing or even ignoring the precedence constraints of the data flow graph (DFG),and result in inaccuracy of the lower bound.The loop folding and conditional branch were also not considered,In this paper,a new stepwise refinement algorithm is proposed.which takes consideration of precedence constraints of the DFG to estimate the lower bound of hardware resources under time constratints,Processing techniques to handle multi-cycle,chaining,pipelining,as well as loop folding and mutual exclusion among conditional branches are also incorporated in the algorithm.Experimental results show that the algorithm can produce a very tight and close to optimal lower bound in reasonable computation time. 相似文献
10.
11.
12.
13.
15.
17.
19.