8,525 research outputs found
Multi-stage languages in hardware design
As circuits increase in size and complexity, hardware description techniques have been trying to adopt features already well-
established in software languages. In this paper, we investigate how
different hardware description languages implement levels of abstraction over the hardware designs, and we examine how improvements
have lead to features like parameterised circuits and generic descriptions, that enable users to efficiently model and reason about large
regular-shaped structures and connection patterns. Nonetheless, the
ability to include non-functional properties of circuits in the same description is still an open issue. Lately, proposed solutions are looking
into meta-functional languages and multi-staging techniques. We examine how hardware description languages can benefit from the capabilities of meta-functional languages, which are able to reason about,
and transform the circuit generators as data objects, thus providing
a means to access both the functional and non-functional aspects of
the generated circuits.peer-reviewe
Reports to the President
A compilation of annual reports for the 1989-1990 academic year, including a report from the President of the Massachusetts Institute of Technology, as well as reports from the academic and administrative units of the Institute. The reports outline the year's goals, accomplishments, honors and awards, and future plans
Reports to the President
A compilation of annual reports including a report from the President of the Massachusetts Institute of Technology, as well as reports from the academic and administrative units of the Institute. The reports outline the year's goals, accomplishments, honors and awards, and future plans
Reports to the President
A compilation of annual reports for the 1988-1989 academic year, including a report from the President of the Massachusetts Institute of Technology, as well as reports from the academic and administrative units of the Institute. The reports outline the year's goals, accomplishments, honors and awards, and future plans
SAGA: A project to automate the management of software production systems
The project to automate the management of software production systems is described. The SAGA system is a software environment that is designed to support most of the software development activities that occur in a software lifecycle. The system can be configured to support specific software development applications using given programming languages, tools, and methodologies. Meta-tools are provided to ease configuration. Several major components of the SAGA system are completed to prototype form. The construction methods are described
Reports to the President
A compilation of annual reports for the 1982-1983 academic year, including a report from the President of the Massachusetts Institute of Technology, as well as reports from the academic and administrative units of the Institute. The reports outline the year's goals, accomplishments, honors and awards, and future plans
Recommended from our members
Automatic synthesis of analog layout : a survey
A review of recent research in the automatic synthesis of physical geometry for analog integrated circuits is presented. On introduction, an explanation of the difficulties involved in analog layout as opposed to digital layout is covered. Review of the literature then follows. Emphasis is placed on the exposition of general methods for addressing problems specific to analog layout, with the details of specific systems only being given when they surve to illustrate these methods well. The conclusion discusses problems remaining and offers a prediction as to how technology will evolve to solve them. It is argued that although progress has been and will continue to be made in the automation of analog IC layout, due to fundamental differences in the nature of analog IC design as opposed to digital design, it should not be expected that the level of automation of the former will reach that of the latter any time soon
Regular Expression Synthesis for BLAST Two-Hit Filtering
Genomic databases are exhibiting a growth rate that is outpacing Moore\u27s Law, which has made database search algorithms a popular application for use on emerging processor technologies. NCBI BLAST is the standard tool for performing searches against these databases, which operates by transforming each database query into a filter that is subsequently applied to the database. This requires a database scan for every query, fundamentally limiting its performance by I/O bandwidth. In this dissertation we present a functionally-equivalent variation on the NCBI BLAST algorithm that maps more suitably to an FPGA implementation. This variation of the algorithm attempts to reduce the I/O requirement by leveraging FPGA-specific capabilities, such as high pattern matching throughput and explicit on-chip memory structure and allocation. Our algorithm transforms the database—not the query—into a filter that is stored as a hierarchical arrangement of three tables, the first two of which are stored on-chip and the third off-chip. Our results show that it is possible to achieve speedups of up to 8x based on the relative reduction in I/O of our approach versus that of NCBI BLAST, with a minimal impact on sensitivity. More importantly, the performance relative to NCBI BLAST improves with larger databases and query workload sizes
Optimal compilation of parametrised quantum circuits
Parametrised quantum circuits contain phase gates whose phase is determined
by a classical algorithm prior to running the circuit on a quantum device. Such
circuits are used in variational algorithms like QAOA and VQE. In order for
these algorithms to be as efficient as possible it is important that we use the
fewest number of parameters. We show that, while the general problem of
minimising the number of parameters is NP-hard, when we restrict to circuits
that are Clifford apart from parametrised phase gates and where each parameter
is used just once, we can efficiently find the optimal parameter count. We show
that when parameter transformations are required to be sufficiently
well-behaved that the only rewrites that reduce parameters correspond to simple
'fusions'. Using this we find that a previous circuit optimisation strategy by
some of the authors [Kissinger, van de Wetering. PRA (2019)] finds the optimal
number of parameters. Our proof uses the ZX-calculus. We also prove that the
standard rewrite rules of the ZX-calculus suffice to prove any equality between
parametrised Clifford circuits
- …