找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Logic Synthesis for Finite State Machines Based on Linear Chains of States; Foundations, Recent Alexander Barkalov,Larysa Titarenko,Jacek

[復(fù)制鏈接]
查看: 21553|回復(fù): 42
樓主
發(fā)表于 2025-3-21 16:11:50 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States
副標(biāo)題Foundations, Recent
編輯Alexander Barkalov,Larysa Titarenko,Jacek Bieganow
視頻videohttp://file.papertrans.cn/588/587941/587941.mp4
概述Presents original synthesis and optimization methods taking into account the peculiarities of a control algorithm and finite state machine (FSM) model in use.Discusses the hardware implementation of c
叢書名稱Studies in Systems, Decision and Control
圖書封面Titlebook: Logic Synthesis for Finite State Machines Based on Linear Chains of States; Foundations, Recent  Alexander Barkalov,Larysa Titarenko,Jacek
描述.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.
出版日期Book 2018
關(guān)鍵詞Linear Chains of States; Finite State Machine; Logic Synthesis; Field-Programmable Gate Arrays; Look-up
版次1
doihttps://doi.org/10.1007/978-3-319-59837-6
isbn_softcover978-3-319-86714-4
isbn_ebook978-3-319-59837-6Series ISSN 2198-4182 Series E-ISSN 2198-4190
issn_series 2198-4182
copyrightSpringer International Publishing AG 2018
The information of publication is updating

書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States影響因子(影響力)




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States影響因子(影響力)學(xué)科排名




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States網(wǎng)絡(luò)公開度




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States被引頻次




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States被引頻次學(xué)科排名




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States年度引用




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States年度引用學(xué)科排名




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States讀者反饋




書目名稱Logic Synthesis for Finite State Machines Based on Linear Chains of States讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:59:02 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:49:07 | 只看該作者
地板
發(fā)表于 2025-3-22 05:44:58 | 只看該作者
Hardware Reduction for Moore XFSMs,imal state assignment or transformation of state codes. The third part deals with the models based on the encoding of the chain outputs. At last, the principle of code sharing is discussed. In this case, the state code is represented as a concatenation of the code of class of pseudoequivalent chains and the code of element inside this class.
5#
發(fā)表于 2025-3-22 09:05:47 | 只看該作者
6#
發(fā)表于 2025-3-22 15:23:03 | 只看該作者
Finite State Machines and Field-Programmable Gate Arrays,. Next, the basic problems of FSM design are considered. Different state assignment methods are analyzed, as well as the methods of functional decomposition. Next the issues are discussed connected with implementing FSM logic circuits with EMBs. The peculiarities of hybrid FPGAs are discussed last part of the Chapter.
7#
發(fā)表于 2025-3-22 18:05:39 | 只看該作者
8#
發(fā)表于 2025-3-23 00:51:27 | 只看該作者
Hardware Reduction for Moore EFSMs,the principle of code sharing. In this case, the state code is represented as a concatenation of the chain code and the code of component inside this chain. The last part of the chapter is devoted to design methods targeting the hybrid FPGAs.
9#
發(fā)表于 2025-3-23 04:29:54 | 只看該作者
10#
發(fā)表于 2025-3-23 05:42:13 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 13:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
原平市| 呼和浩特市| 辽中县| 宜宾市| 祁门县| 长沙市| 浮梁县| 灵武市| 桂平市| 什邡市| 万盛区| 华亭县| 岫岩| 武强县| 周口市| 资阳市| 涪陵区| 新兴县| 湖口县| 富裕县| 吉林省| 油尖旺区| 泾川县| 厦门市| 甘南县| 河源市| 厦门市| 固镇县| 娱乐| 平顺县| 新沂市| 内江市| 嘉祥县| 建瓯市| 昔阳县| 大同县| 江孜县| 来凤县| 丰城市| 临洮县| 台北市|