DOCSLIB.ORG

Hardware Description Language Based on Message Passing and Implicit Pipelining

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Hardware Description Language Based on Message Passing and Implicit Pipelining Hardware Description Language Based on Message Passing and Implicit Pipelining Dmitri Boulytchev Oleg Medvedev St.Petersburg State University St.Petersburg State University [email protected] [email protected], [email protected] Abstract depends on secret knowledge of implementation details We present a hardware description language (currently and subtle host platform properties. In the same time the called “HaSCoL”) which is based on both reliable and assistance of development tools for exploring the design unreliable message passing and implicit pipelining of space by source code transformations with predictable message handlers. The language consists of a small core results is extremely desirable. and a number of extensions, which cover many features Another inconvenience originates from the fact that of high level software languages as well as high level hardware and software are traditionally expressed us- hardware description languages (HDLs). These exten- ing different languages. Thus the problem of interfacing sions have simple projections into the core language and software and hardware components arises. At present allow compact and concise description of complex al- time no drastic solution for this problem is suggested. gorithms. The core language in turn can be converted We argue that these problems can be solved by de- into efficient VHDL. We discuss place-and-route results scribing both hardware and software using the same for some benchmarks implemented both in HaSCoL and general-purpose programming language (with hard- VHDL and suggest an optimization which should im- ware description as its proper sublanguage). We call prove the results significantly and make them close to this language “HaSCoL” (Hardware-Software Codesign those for hand-coded VHDL. Language). This paper presents our current state of the art: a pure hardware description language. 1. Introduction 2. HaSCoL in a nutshell The advances in hardware development technologies This section informally describes the language by exam- made the process of hardware design and implemen- ples. tation more ”software-like”. For example many algo- rithms can now be accelerated in orders of magnitude 2.1 Core features by partial mapping to FPGA (e.g. molecular dynamics simulation [6] or XML filtering [7]). These algorithms Any specification in HaSCol describes synchronous de- can be of various domains and therefore might be tough sign. Unlike VHDL or Verilog clock and reset (and some to implement using conventional hardware development auxiliary) signals are not presented explicitly but ex- techniques which were historically ad-hoc crafted to uti- press themselves by mean of relevant constructs seman- lize rather low-level tools for rather narrow set of prob- tics. lems. In particular, two general problems in the domain The example below demonstrates some features of of hardware-software codesign — Design Space Explo- the language using inline comments (which start with ration (DSE) and hardware-software decomposition — two dashes): can hardly be solved using conventional hardware de- −− − scription language (such as VHDL or Verilog) as the A 19 bit unsigned integer global variable with asynchronous −− read and synchronous write access; initial value 5 language of primary representation. −− is assigned on each reset. The main problem with those languages (let alone data count : uint(19) = 5; their low level) is that they can hardly be operated in −− A handler which starts on each cycle when messages arrive a formal, unmanned way. For example, hardware de- −− simultaneously from the channels ”chan1” and ”chan2”. velopment using VHDL involves a lot of pragmatics, in chan1(a : Type1), in chan2(b : Type2) f is directed by a number of programming patterns and −− In the first cycle of handler body we put the result of −− some computation (”a+b”) into intermediate register ”c” and −− Assembler syntax pattern: specified strings and −− increment the global counter in parallel. −− string representation of the parameters have to be c = a + b j count := count + 1; −− concatenated to produce assembler text for the −− In the second cycle we evaluate a condition (”c > 0”) −− instruction (e.g. ”r5 := r7”). −− and perform the first cycle of the ”else”−branch or looks f”r” dst ”:=” ”r” srcg −− ”then”−branch respectively. end if c > 0 then −− We send the value of register ”c” through the channel 2.2 Structural design and communication −− ”chan3”. If no handler is ready to consume the value −− the computation is suspended for one cycle. A typical design in HaSCoL consists of a hierarchy of send chan3(c) else blocks. Blocks are interconnected by channels, which −− We asynchronously compute expression ”not c” and store are used to transmit messages between handlers. −− the result in register ”d”. In parallel we send a message A single HaSCoL block is a set of handlers. Each −− to the ”notify” channel in an unreliable manner ( i . e . handler receives messages from some channels, pro- −− the computation continues regardless successful delivery). cesses received data and sends messages in a reliable d = not c j inform notify (); or non-reliable manner through other channels. −− We reliably send ”d” to the ”chan3” on the next cycle. Some of blocks may be written directly in VHDL send chan3(d) if one needs to instantiate some technology-specific fi VHDL components (e.g. a dual-port on-chip RAM). g A situation when two different messages are sent The example above demonstrates the two main fea- through the same channel in the same cycle is rather tures of HaSCoL — stallable pipelining and reliable common for complex designs. HaSCoL provides a con- message delivery. Pipelining means that a handler starts venient way to resolve such a conflicts by introducing to process a new incoming set of messages on each cy- the notion of ports, which can be specified for a chan- cle unless its first cycle is stalled. That is, if it takes more nel (in fact, if no ports are explicitly specified then one than one cycle to process a set of messages then many default port is assumed; strictly speaking a message can sets of messages can potentially be processed simulta- only be sent through some port of channel, not a chan- neously in a pipelined manner. nel itself). All ports of the same channel have different Reliable message delivery means that each “send” priorities assigned. Sending different values through the operator may stall a handler if no handler is ready to same port of the same channel at the same cycle results accept the message being sent. The stall is propagated in unpredictable clash of data, while sending through in opposite to the message flow direction so that no different ports does not. message is ever lost. This reliability mechanism may There are two priority assignment disciplines — completely block a handler. Since reliable delivery is static and fair. Static priorities are assigned once and not always desirable the language also has “inform” for all; fair priorities are reassigned in a circular manner construct, which never stalls but may loose messages. each time a message is consumed from the channel. The language provides many high-level constructs by mean of syntax extensions (see section 3). Below we 3. Language extension hierarchy demonstrate the most hardware specific one — proces- sor instruction description: An important HaSCoL feature, which facilitates various analyses and transformation into VHDL, is that HaS- −− The statement expresses a register−to−register assignment. CoL is not a single language but a hierarchy of lan- −− It matches an instruction code in ”cmd” with a binary pattern guages. Each hierarchy level is a syntax extension of the −− of the instruction and performs assignment. previous one. The base level is easily convertible into ef- match cmd with ficient VHDL. The hierarchy is shown on Fig. 1. −− The instruction has two parameters −−− numbers of general The core language level consists of constructs to ex- −− purpose registers of the processor. press only structural design, message delivery, straight- insn (src, dst : uint(3)) line multi-cycle code and one-cycle conditionals (no −− Instruction semantics. other control flow, no global variables etc.) This level does f regs[dst] := regs[src] g −− Binary pattern: specified bit strings and binary can be directly converted into synthesizable VHDL. −− representation of the parameters have to be The next level extends core language with global −− concatenated to produce a binary representation of variables. It is converted to the core language by rep- −− the instruction (e.g. 0x6F000000). resenting each global variable as a handler which holds coded f0b01 src dst 0x000000 g assigned value by permanently resending it to itself in Processor instruction set description erates synthesizable VHDL; assembler generator which 1 Coarse grain synchronization generates a binutils-compatible assembler from a pro- (monitors) cessor instruction set description. In this section we Control flow statements present evaluation of these tools on some benchmarks. (conditional, loop, First, we implemented a pipelined cubic polynomial pattern matching etc.) evaluator and a Fast Fourier Transform with a pipelined Global variables butterfly. Table 1 shows results of synthesis and place- and-route for a Virtex-4 xc4vlx15-12sf363 device. Im- Core language plementations written in HaSCoL and in pure VHDL are compared for each benchmark. For a case of the polynomial the difference in perfor- mance is rather minor. Analysis of mapping results for the FFT explains Figure 1. Language extension hierarchy the major difference in LUT numbers. The reason is an incompleteness of the VHDL generator. It generates Table 1. Evaluation results a huge amount of logic to support reliable message FFT polynomial passing even for the case, where only unreliable one VHDL HaSCoL VHDL HaSCoL is used (like in FFT). This defect can be fixed with an ∗ Lines of code 531 290 95 18 appropriate code analysis and we will do this soon. 4-input LUTs 566 2320 129 162 Note that the difference in description simplicity is RAMB16s 40 40 0 0 major for both cases.
Load more

Recommended publications
  • An Introduction to High-Level Synthesis
    High-Level Synthesis An Introduction to High-Level Synthesis Philippe Coussy Michael Meredith Universite´ de Bretagne-Sud, Lab-STICC Forte Design Systems Daniel D. Gajski Andres Takach University of California, Irvine Mentor Graphics today would even think of program- Editor’s note: ming a complex software application High-level synthesis raises the design abstraction level and allows rapid gener- solely by using an assembly language. ation of optimized RTL hardware for performance, area, and power require- In the hardware domain, specification ments. This article gives an overview of state-of-the-art HLS techniques and languages and design methodologies tools. 1,2 ÀÀTim Cheng, Editor in Chief have evolved similarly. For this reason, until the late 1960s, ICs were designed, optimized, and laid out by hand. Simula- THE GROWING CAPABILITIES of silicon technology tion at the gate level appeared in the early 1970s, and and the increasing complexity of applications in re- cycle-based simulation became available by 1979. Tech- cent decades have forced design methodologies niques introduced during the 1980s included place-and- and tools to move to higher abstraction levels. Raising route, schematic circuit capture, formal verification, the abstraction levels and accelerating automation of and static timing analysis. Hardware description lan- both the synthesis and the verification processes have guages (HDLs), such as Verilog (1986) and VHDL for this reason always been key factors in the evolu- (1987), have enabled wide adoption of simulation tion of the design process, which in turn has allowed tools. These HDLs have also served as inputs to logic designers to explore the design space efficiently and synthesis tools leading to the definition of their synthe- rapidly.
    [Show full text]
  • The Challenges of Hardware Synthesis from C-Like Languages
    The Challenges of Hardware Synthesis from C-like Languages Stephen A. Edwards∗ Department of Computer Science Columbia University, New York Abstract most successful C-like languages, in fact, bear little syntactic or semantic resemblance to C, effectively forcing users to learn The relentless increase in the complexity of integrated circuits a new language anyway. As a result, techniques for synthesiz- we can fabricate imposes a continuing need for ways to de- ing hardware from C either generate inefficient hardware or scribe complex hardware succinctly. Because of their ubiquity propose a language that merely adopts part of C syntax. and flexibility, many have proposed to use the C and C++ lan- For space reasons, this paper is focused purely on the use of guages as specification languages for digital hardware. Yet, C-like languages for synthesis. I deliberately omit discussion tools based on this idea have seen little commercial interest. of other important uses of a design language, such as validation In this paper, I argue that C/C++ is a poor choice for specify- and algorithm exploration. C-like languages are much more ing hardware for synthesis and suggest a set of criteria that the compelling for these tasks, and one in particular (SystemC) is next successful hardware description language should have. now widely used, as are many ad hoc variants. 1 Introduction 2 A Short History of C Familiarity is the main reason C-like languages have been pro- Dennis Ritchie developed C in the early 1970 [18] based on posed for hardware synthesis. Synthesize hardware from C, experience with Ken Thompson’s B language, which had itself proponents claim, and we will effectively turn every C pro- evolved from Martin Richards’ BCPL [17].
    [Show full text]
  • A Compiler Infrastructure for Static and Hybrid Analysis of Discrete Event System Models
    UNIVERSITY OF CALIFORNIA, IRVINE A Compiler Infrastructure for Static and Hybrid Analysis of Discrete Event System Models DISSERTATION submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Computer Engineering by Tim Schmidt Dissertation Committee: Professor Rainer D¨omer,Chair Professor Kwei-Jay Lin Professor Fadi Kurdahi 2018 c 2018 Tim Schmidt TABLE OF CONTENTS Page LIST OF FIGURES v LIST OF TABLES vii LIST OF ALGORITHMS viii LIST OF ACRONYMS ix ACKNOWLEDGMENTS x CURRICULUM VITAE xii ABSTRACT OF THE DISSERTATION xvi 1 Introduction 1 1.1 System Level Design . .1 1.2 SystemC . .3 1.3 Recoding Infrastructure for SystemC (RISC) . .7 1.3.1 Software Stack . .7 1.3.2 Tool Flow . .8 1.4 Segment Graph . 11 1.5 Goals . 19 1.6 Related Work . 22 1.6.1 LECS Group . 22 1.6.2 Other Related Work . 25 2 Static Communication Graph Generation 28 2.1 Introduction . 28 2.1.1 Related work . 31 2.2 Thread Communication Graph . 32 2.3 Static Compiler Analysis . 34 2.3.1 Thread Communication Graph . 34 2.3.2 Module Hierarchy . 37 2.3.3 Optimization and Designer Interaction . 38 2.3.4 Visualization . 38 2.3.5 Accuracy and Limitations . 39 ii 2.4 Experiments . 39 2.4.1 Mandelbrot Renderer . 39 2.4.2 AMBA Bus Model . 41 2.4.3 S2C Testbench . 42 2.5 Summary . 43 3 Static Analysis for Reduced Conflicts 45 3.1 Channel Analysis . 45 3.1.1 Introduction . 46 3.1.2 Conflict Analysis . 49 3.1.3 Port Call Path Sensitive Segment Graphs .
    [Show full text]
  • Parallel Systemc/TLM Simulation of Hardware Components Described for High-Level Synthesis Denis Becker
    Parallel SystemC/TLM Simulation of Hardware Components described for High-Level Synthesis Denis Becker To cite this version: Denis Becker. Parallel SystemC/TLM Simulation of Hardware Components described for High- Level Synthesis. Artificial Intelligence [cs.AI]. Université Grenoble Alpes, 2017. English. NNT: 2017GREAM082. tel-01709813v3 HAL Id: tel-01709813 https://hal.archives-ouvertes.fr/tel-01709813v3 Submitted on 18 Sep 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE Pour obtenir le grade de DOCTEUR DE LA COMMUNAUTÉ UNIVERSITÉ GRENOBLE ALPES Spécialité : Informatique Arrêté ministériel : 25 mai 2016 Présentée par Denis Becker Thèse dirigée par Matthieu Moy et co-encadrée par Jérôme Cornet préparée au sein du Laboratoire Verimag, de STMicroelectronics et de l’École Doctorale de Mathématiques, Sciences et Technologies de l’Information, Informatique Simulation Parallèle en SystemC/TLM de Composants Matériels décrits pour la Synthèse de Haut-Niveau Parallel SystemC/TLM Simulation of Hardware Components described for High-Level Synthesis Thèse soutenue publiquement le 11 décembre 2017, devant le jury composé de : M. Frédéric Pétrot Professeur, Université Grenoble Alpes, France, Président M. Rainer Dömer Professeur, University of California, Irvine, CA, États-Unis, Rapporteur M.
    [Show full text]
  • INTEGRATING ALGORITHM-LEVEL DESIGN and SYSTEM-LEVEL DESIGN THROUGH SPECIFICATION Synthesisintegrating Algorithm-Level Design
    INTEGRATING ALGORITHM-LEVEL DESIGN AND SYSTEM-LEVEL DESIGN THROUGH SPECIFICATION SYNTHESIS A Dissertation Presented by Jiaxing Zhang to The Department of Electrical and Computer Engineering in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Engineering Northeastern University Boston, Massachusetts August 2014 To my family. i Contents List of Figures v List of Tables vii List of Acronyms viii Acknowledgments x Abstract xi 1 Introduction 1 1.1 Specification Gap . 2 1.2 Flexibility and Overhead Trade-off . 3 1.3 Problem Definition and Goals . 5 1.4 Contributions . 5 1.5 Overview . 8 2 Background 9 2.1 EDA Designs . 9 2.2 Algorithm Level Design . 12 2.2.1 MATLAB/Simulink Modeling Environments . 14 2.3 System-Level Design . 15 2.3.1 Design Abstractions . 17 2.3.2 System Level Design Languages . 18 2.4 Related Work . 20 2.4.1 Bridging Design Gaps . 20 2.4.2 Flexibility Overhead: Granularity Challenges . 24 2.4.3 Flexibility Overhead: SW Synthesis . 24 2.5 Summary . 25 3 Specification Synthesis 27 3.1 Specification Synthesis Foundations . 27 3.1.1 Structural Semantics . 29 3.1.2 Execution Semantics . 31 ii 3.2 Algo2Spec Design . 31 3.2.1 Leaf Synthesizer . 33 3.2.2 Hierarchy Synthesizer . 37 3.2.3 Granularity Discussions . 43 3.3 Algorithm-Architecture Co-Design Flow . 43 3.4 Experimental Results . 45 3.4.1 MJPEG Encoder Synthesis Example . 46 3.4.2 Productivity Gain . 51 3.5 Summary . 53 4 Specification Granularity 54 4.1 Introduction . 54 4.2 Background: Specification Performance Analysis .
    [Show full text]
  • System Modeling & HW/SW Co-Verification
    System Modeling & HW/SW Co-Verification Prof. Chien-Nan Liu TEL: 03-4227151 ext:4534 Email: [email protected] 1 Outline l Introduction l System Modeling Languages l SystemC Overview l Data-Types l Processes l Interfaces l Simulation Supports l System Design Environments l HW/SW Co-Verification l Conclusion 2 Outline l Introduction l System Modeling Languages l SystemC Overview l Data-Types l Processes l Interfaces l Simulation Supports l System Design Environments l HW/SW Co-Verification l Conclusion 3 Design Challenges Reference http://www.doulos.com 4 Silicon complexity v.s Software complexity Silicon complexity is growing 10x Software in systems is growing faster every 6 years than 10x every 6 years Reference http://www.doulos.com 5 Increasing Complexity in SoC Designs l One or more processors l 32-bit Microcontrollers l DSPs or specialized media processors l On-chip memory l Special function blocks l Peripheral control devices l Complex on-chip communications network (On-chip busses) l RTOS and embedded software which are layering architecture l …… 6 How to Conquer the Complexity ? l Modeling strategies – Using the appropriate modeling for different levels – The consistency and accuracy of the model l Reuse existing designs – IP reuse – Architecture reuse (A platform based design) l Partition – Based on functionality – Hardware and software 7 Traditional System Design Flow (1/2) l Designers partition the system into hardware and software early in the flow l HW and SW engineers design their respective components in isolation l HW
    [Show full text]
  • An In-Fabric Memory Architecture for FPGA-Based Computing
    CoRAM: An In-Fabric Memory Architecture for FPGA-Based Computing Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Eric S. Chung B.S., Electrical Engineering and Computer Science University of California, Berkeley Carnegie Mellon University Pittsburgh, PA August, 2011 Abstract Field Programmable Gate Arrays (FPGA) have been used in many applications to achieve orders-of-magnitude improvement in absolute performance and energy efficiency relative to con- ventional microprocessors. Despite their newfound potency in both processing performance and energy efficiency, FPGAs have not gained widespread acceptance as mainstream computing de- vices. A fundamental obstacle to FPGA-based computing can be traced to the FPGA’s lack of a common, scalable memory abstraction. When developing for FPGAs, application writers are often responsible for crafting the application-specific infrastructure logic that transports the data to and from the processing kernels, which are the ultimate producers and consumers within the fabric. Very often, this infrastructure logic not only increases design time and effort but will inflexibly lock a de- sign to a particular FPGA product line, hindering scalability and portability. To create a common, scalable memory abstraction, this thesis proposes a new FPGA memory architecture called Con- nected RAM (CoRAM) to serve as a portable bridge between the distributed computation kernels and the edge memory interfaces. In addition to improving performance and efficiency, the CoRAM architecture provides a virtualized memory environment as seen by the hardware kernels to simplify application development and to improve an application’s scalability and portability. i Acknowledgements I owe all of my success to my academic advisor, Professor James Hoe, who taught me how to think, speak, and write.
    [Show full text]
  • EE382N.23: Embedded System Design and Modeling Lecture 2
    EE382N.23: Embedded Sys Dsgn/Modeling Lecture 2 EE382N.23: Embedded System Design and Modeling Lecture 2 – System-Level Design Languages Sources: R. Doemer, UC Irvine Andreas Gerstlauer Electrical and Computer Engineering University of Texas at Austin [email protected] Lecture 2: Outline • System-level design languages • Goals, requirements • Fundamental principles of language design • The SpecC language • Core language syntax and semantics • The SystemC language • Versus SpecC EE382N.23: Embedded Sys Dsgn/Modeling, Lecture 2 © 2017 A. Gerstlauer 2 (c) 2017 A. Gerstlauer 1 EE382N.23: Embedded Sys Dsgn/Modeling Lecture 2 Languages Represent a model in machine-readable form Apply algorithms and tools Automatic refinement, analysis, synthesis, simulation • Syntax defines grammar • Possible strings over an alphabet • Textual or graphical • Semantics defines meaning • Execution/simulation model • Operational or denotational EE382N.23: Embedded Sys Dsgn/Modeling, Lecture 2 © 2017 A. Gerstlauer 3 Models vs. Languages Poetry Recipe Story State Sequent. Data- Models machine program flow Languages English Spanish Japanese C C++ Java Recipes vs. English Sequential programs vs. C • Computation models describe system behavior • Conceptual notion, e.g., recipe, sequential program • Languages capture models • Concrete form, e.g., English, C • Variety of languages can capture one model • E.g., sequential program model C,C++, Java • One language can capture variety of models • E.g., C++ → sequential program model, object-oriented model, state machine model • Certain languages better at capturing certain models Source: T. Givargis, F. Vahid. “Embedded System Design”, Wiley 2002. EE382N.23: Embedded Sys Dsgn/Modeling, Lecture 2 © 2017 A. Gerstlauer 4 (c) 2017 A. Gerstlauer 2 EE382N.23: Embedded Sys Dsgn/Modeling Lecture 2 Simulation vs.
    [Show full text]
  • Dynamic Module Library for System Level Modeling and Simulation of Dynamically Reconfigurable Systems
    JOURNAL OF COMPUTERS, VOL. 3, NO. 2, FEBRUARY 2008 55 Dynamic Module Library for System Level Modeling and Simulation of Dynamically Reconfigurable Systems Kenji Asano NEC Electronics Corporation 1753, Shimonumabe, Nakahara-Ku, Kawasaki, Kanagawa 211-8668, JAPAN Email: [email protected] Junji Kitamichi Kenichi Kuroda School of Computer Science and Engineering, The University of Aizu, Tsuruga, Ikki-machi, Aizu-Wakamatsu, Fukushima 965-8580, JAPAN Email: {kitamiti,kuroda}@u-aizu.ac.jp Abstract— In this paper, we propose a library for the and costs required for design and verification are increas- system level modeling and simulation of the system which ing. To circumvent these disadvantages, the following includes Dynamically Reconfigurable Architectures(DRAs). design methodologies are being proposed. The proposed library is an extended SystemC library. Using the proposed library, the designer can model the system One is a system level design. The abstraction level specifications including modules for the dynamic generation of system level design is higher than that of traditional and elimination and ports and channels for the dynamic Register Transfer (RT) level. In the traditional design connection and dispatch between them, that are needed in flow, system specifications are written in a natural lan- the design of general-purpose dynamically reconfigurable guage. Therefore, they may contain vague statements and systems at the system design level. In addition, we evaluate the proposed library by the modeling and simulation of mistakes. This causes problems in the RT level design. sample circuits, such as partially DRA and multi-context Furthermore, a natural language cannot be converted to DRA. Using the proposed library, we can model the system hardware and embedded software descriptions.
    [Show full text]
  • System-On-A-Chip Design and Verification
    A Survey: System-on-a-Chip Design and Verification Ali Habibi and Sofiène Tahar Electrical & Computer Engineering Department, Concordia University Montreal, Quebec, Canada Email: {habibi, tahar}@ece.concordia.ca Technical Report January 2003 Abstract. In this technical report, we survey the state-of-the-art of the design and verifica- tion techniques and methodologies the System on-a-Chip (SoC). The advancement in the hardware area made it possible the integration of a complete yet complex system on a sin- gle chip. Over 10 million gates, integrated together and running a real time optimized software red crossed classical design techniques. Traditional Regiter Transfer level (RTL) will serve as an assembler language for the new design languages or so called system level languages. A challenge facing the SoC designers is to decide which system level lan- guage we have to use and how the verification task will be accomplished. This report pre- sents the main proposals in defining a system level language and discusses the eventual verification techniques that can be used. 1. Introduction A decade ago, the EDA industry went progressively from gate level to register-transfer- level abstraction. This is one of the basic reasons why this process gained a great increase in the productivity. Nowadays, an important effort is being spent in order to develop a sys- tem level languages and to define new design and verification methodologies and verifica- tion at this abstraction level. The reason for all this activity is simple. Register-transfer level (RTL) hardware design is too low as an abstraction level to start designing multimillion-gate systems (as shown in Figure 1).
    [Show full text]
  • HDL Based Digital Design with Programmable Logic Lecture 1
    EE 459/500 – HDL Based Digital Design with Programmable Logic Lecture 1 Introduction 1 Course Info . Times: TuTh 11am-12:20pm . Room: Furnas 213/214 . Instructor – Cristinel Ababei • E-mail: [email protected] • Phone: 716-645-1607 • Office hours (209 Davis Hall): TuTh 10- 11am or by appointment . Teaching assistant • Yi Cao, [email protected] • Labs: Wed. 2-4pm in Furnas 213/214 2 .1 Course Requirements . Textbook and references • Jr. Charles H. Roth and Lizy K. John, Digital Systems Design Using VHDL, CL Engineering, 2nd edition, 2007. • Peter J. Ashenden, The Student's Guide to VHDL, Morgan Kaufmann. Software • Xilinx ISE WebPack 14.1 • Aldec’s Active-HDL 9.1 Student Edition simulator . Hardware • Digilent ATLYS FPGA (Spartan-6) development board 3 Grading . Grade breakdown: “A”=[97-100] “A-”=[94- 97) “B+”=[90-94) “B”=[87-90) “B-”=[84-87) “C+”=[80-84) “C”=[77-80) “C-”=[74-77) “D+”=[70-74) “D”=[60-70) “F”=[0-60). Final grade components: • Midterm exam: 20% • Final exam: 20% • Homework assignments: 10% • Labs: 20% • Course project: 30% 4 .2 Course Outline . Week 1: Introduction, overview of digital systems . Week 2: Combinational logic circuits and design . Week 3-5: VHDL modeling of digital systems . Week 6-9: Sequential systems and design . Week 10: Memory and timing . Week 11-14: Computer design basics . Week 15: Project demos 5 What is a Digital System? . Structure: a collection of interconnected digital modules designed to perform a particular function. Function: takes a set of discrete information inputs and discrete internal information (system state) and generates a set of discrete information outputs.
    [Show full text]
  • System-On-Chip Environment: Tutorial
    System-on-Chip Environment SCE Version 2.2.0 Beta Tutorial Samar Abdi Junyu Peng Haobo Yu Dongwan Shin Andreas Gerstlauer Rainer Doemer Daniel Gajski Center for Embedded Computer Systems University of California, Irvine Irvine, CA 92697-3425 +1 (949) 824-8919 http://www.cecs.uci.edu System-on-Chip Environment: SCE Version 2.2.0 Beta; Tutorial by Samar Abdi, Junyu Peng, Haobo Yu, Dongwan Shin, Andreas Gerstlauer, Rainer Doemer, and Daniel Gajski Center for Embedded Computer Systems University of California, Irvine Irvine, CA 92697-3425 +1 (949) 824-8919 http://www.cecs.uci.edu Published July 23, 2003 Copyright © 2003-2017 CECS, UC Irvine Table of Contents 1. Introduction................................................................................................................1 1.1. Motivation.........................................................................................................1 1.2. SCE Goals.........................................................................................................2 1.3. Models for System Design................................................................................2 1.4. System-on-Chip Environment...........................................................................4 1.5. Design Example: GSM Vocoder.......................................................................4 1.6. Organization of the Tutorial..............................................................................5 2. System Specification Analysis ...................................................................................9
    [Show full text]