𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Logic Synthesis for FPGA-Based Control Units: Structural Decomposition in Logic Design (Lecture Notes in Electrical Engineering, 636)

✍ Scribed by Alexander Barkalov, Larysa Titarenko, Kamil Mielcarek, SΕ‚awomir Chmielewski


Publisher
Springer
Year
2020
Tongue
English
Leaves
257
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This book focuses on control units, which are a vital part of modern digital systems, and responsible for the efficiency of controlled systems. The model of a finite state machine (FSM) is often used to represent the behavior of a control unit. As a rule, control units have irregular structures that make it impossible to design their logic circuits using the standard library cells. Design methods depend strongly on such factors as the FSM used, specific features of the logic elements implemented in the FSM logic circuit, and the characteristics of the control algorithm to be interpreted.

This book discusses Moore and Mealy FSMs implemented with FPGA chips, including look-up table elements (LUT) and embedded memory blocks (EMB). It is crucial to minimize the number of LUTs and EMBs in an FSM logic circuit, as well as to make the interconnections between the logic elements more regular, and various methods of structural decompositions can be used to solve this problem. These methods are reduced to the presentation of an FSM circuit as a composition of different logic blocks, the majority of which implement systems of intermediate logic functions different (and much simpler) than input memory functions and FSM output functions. The structural decomposition results in multilevel FSM circuits having fewer logic elements than equivalent single-level circuits. The book describes well-known methods of structural decomposition and proposes new ones, examining their impact on the final amount of hardware in an FSM circuit. It is of interest to students and postgraduates in the area of Computer Science, as well as experts involved in designing digital systems with complex control units. The proposed models and design methods open new possibilities for creating logic circuits of control units with an optimal amount of hardware and regular interconnections.



✦ Table of Contents


Preface
Contents
Abbreviations
1 FSM-Based Models of Control Units
1.1 Background of Control Units
1.2 Logic Synthesis of Moore FSM
1.3 Logic Synthesis of Mealy FSM
1.4 Logic Synthesis of Combined FSM
1.5 Preliminary Assessment of Hardware Amount in FSM Circuits
References
2 Structural Decomposition in FSM Synthesis
2.1 General Characteristic of Structural Decomposition
2.2 Characteristic of FPGAs
2.3 Replacement of Logical Conditions
2.4 Encoding of Microoperations
2.5 Structural Decomposition for FPGA-Based Moore FSMs
References
3 Twofold State Assignment for Mealy FSMs
3.1 General Idea of the Method
3.2 Synthesis of Mealy FSM with the Base Structure
3.3 Synthesis of Mealy FSM with Encoding of Collections of Microoperations
3.4 Investigation of Proposed Method
References
4 Twofold State Assignment for Moore FSMs
4.1 Analysis of Possible Solutions
4.2 Synthesis of Moore FSM with the Base Structure
4.3 Synthesis of Moore FSM with Encoding of Collections of Microoperations
4.4 Encoding of the Fields of Compatible Microoperations
References
5 Combining Twofold State Assignment with Transformation of Object Codes
5.1 Introduction into Transformation of Object Codes
5.2 Synthesis of Mealy FSMs with Transformation of Microoperations
5.3 Synthesis of Mealy FSMs with Transformation of State Codes
5.4 Synthesis of Moore FSMs with Transformation of Microoperations
References
6 Combining Twofold State Assignment with Replacement of Logical Conditions
6.1 Analysis of Possible Solutions
6.2 Synthesis of Basic Model of Mealy FSM
6.3 Synthesis of Basic Model of Moore FSM
6.4 Synthesis Based on Transformation of GSA
References
7 Mixed Encoding of Microoperations
7.1 Mixed Encoding for Mealy FSMs
7.2 Mixed Encoding for Moore FSMs
7.3 Synthesis of FPGA-based Combined FSMs
7.4 Mixed Encoding for Combined FSMs
7.5 Mixed Encoding for LUT-based FSMs
References
8 Synthesis of Mealy FSMs with Counters
8.1 Using Counters in Control Units
8.2 Using Counters in Mealy FSMs
8.3 Structural Decomposition for Counter-Based Mealy FSMs
References
Appendix Conclusion
Index


πŸ“œ SIMILAR VOLUMES


Logic Synthesis for FSM-Based Control Un
✍ Alexander Barkalov, Larysa Titarenko (auth.) πŸ“‚ Library πŸ“… 2009 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p><P>The control unit is one of the most important parts of any digital system responsible for interplay of other system blocks. Very often, the model of a finite state machine (FSM) is used to represent the behaviour of a control unit. Modern computer-aided design tools include a lot of optimal so

Logic Synthesis for Compositional Microp
✍ Alexander Barkalov, Larysa Titarenko πŸ“‚ Library πŸ“… 2008 πŸ› Springer 🌐 English

The control unit is one of the most important parts of any digital system. As a rule, control units have an irregular structure, which makes the processing of their logic circuits design very sophisticated. One possible way to optimise such characteristics as the size or performance of control units

Logic Synthesis for FPGA-Based Finite St
✍ Alexander Barkalov, Larysa Titarenko, Malgorzata Kolopienczyk, Kamil Mielcarek, πŸ“‚ Library πŸ“… 2016 πŸ› Springer International Publishing 🌐 English

<p><p>This book discusses control units represented by the model of a finite state machine (FSM). It contains various original methods and takes into account the peculiarities of field-programmable gate arrays (FPGA) chips and a FSM model. It shows that one of the peculiarities of FPGA chips is the

Logic colloquium '02: lecture notes in l
✍ Chatzidakis, Zoe ́Maria; Koepke, Peter; Pohlers, Wolfram (eds.) πŸ“‚ Library πŸ“… 2006 πŸ› A K Peters/CRC Press 🌐 English

Logic Colloquium '02 includes articles from some of the world's preeminent logicians. The topics span all areas of mathematical logic, but with an emphasis on Computability Theory and Proof Theory. This book will be of interest to graduate students and researchers in the field of mathematical logic.

The Notre Dame Lectures: Lecture Notes i
✍ Peter Cholak (eds.) πŸ“‚ Library πŸ“… 2005 πŸ› A K Peters, Association for Symbolic Logic;A K Pet 🌐 English

In fall 2000, the Notre Dame logic community hosted Greg Hjorth, Rodney G. Downey, ZoΓ© Chatzidakis, and Paola D'Aquino as visiting lecturers. Each of them presented a month long series of expository lectures at the graduate level. The articles in this volume are refinements of these excellent lectur