Search arXivSearch

arXiv · 2105.12678

A Flexible FPGA-Based ISA Configurable SoC platform

Abstract

We proposes a platform which can generate hardware/software description based on flexible in-struction set architectures (ISAs). The platform takes advantage of the flexibility of field pro-grammable gate array (FPGA) to design many micro control units (MCUs) based on different ISAs. The platform can generate many ISAs, MCUs, and Assemblers according to a pre-defined ISA and user applications. Although the MCU performance is not optimized, the FPGA shows a great potential on resource reduction and enough performance at very low system clock rate. The flexible ISA has shown great importance for the design targeted to specific purpose. We also show a case study of the proposed flexible ISA-based FPGA-MCU. It can control many specifi-cally designed hardware IPs and a customized multi-task OS with tasks. Not only the case works correctly, but also the proposed FPGA-MCU of the case is flexible with reduced FPGA resources, low cost, and within time constraints.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shih-Yi Yuan, Bo-Yu Zhu. 2021-05-26. A Flexible FPGA-Based ISA Configurable SoC platform. https://arxiv.org/abs/2105.12678

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO