Yüklüyor…

Logic Synthesis for Finite State Machines Based on Linear Chains of States Foundations, Recent Developments and Challenges /

This book discusses Moore finite state machines (FSMs) implemented with field programmable gate arrays (FPGAs) including look-up table (LUT) elements and embedded memory blocks (EMBs). To minimize the number of LUTs in FSM logic circuits, the authors propose replacing a state register with a state c...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Barkalov, Alexander (Yazar), Titarenko, Larysa (Yazar), Bieganowski, Jacek (Yazar)
Müşterek Yazar: SpringerLink (Online service)
Materyal Türü: e-Kitap
Dil:İngilizce
Baskı/Yayın Bilgisi: Cham : Springer International Publishing : Imprint: Springer, 2018.
Edisyon:1st ed. 2018.
Seri Bilgileri:Studies in Systems, Decision and Control, 113
Konular:
Online Erişim:Full-text access
OPAC'ta görüntüle
Diğer Bilgiler
Özet:This book discusses Moore finite state machines (FSMs) implemented with field programmable gate arrays (FPGAs) including look-up table (LUT) elements and embedded memory blocks (EMBs). To minimize the number of LUTs in FSM logic circuits, the authors propose replacing a state register with a state counter. They also put forward an approach allowing linear chains of states to be created, which simplifies the system of input memory functions and, therefore, decreases the number of LUTs in the resulting FSM circuit. The authors combine this approach with using EMBs to implement the system of output functions (microoperations). This allows a significant decrease in the number of LUTs, as well as eliminating a lot of interconnections in the FSM logic circuit. As a rule, it also reduces the area occupied by the circuit and diminishes the resulting power dissipation. This book is an interesting and valuable resource for students and postgraduates in the area of computer science, as well as for designers of digital systems that included complex control units.
Fiziksel Özellikler:VIII, 225 p. 145 illus. online resource.
ISBN:9783319598376
ISSN:2198-4190 ;
DOI:10.1007/978-3-319-59837-6