Logic Synthesis for FPGA-Based Mealy Finite State Machines by Alexander Barkalov, Larysa Titarenko, Kazimierz Krzywicki
Estimated delivery 3-12 business days
Format Paperback
Condition Brand New
Description This book is devoted to logic synthesis of field programmable gate array (FPGA)-based circuits of Mealy finite state machines (FSM). Three new methods of state assignment are proposed which allows obtaining FSM circuits required minimum amount of internal chip resources.
Publisher Description
This book is devoted to the logic synthesis of field programmable gate array (FPGA)-based circuits of Mealy finite state machines (FSM). Three new methods of state assignment are proposed, which allows obtaining FSM circuits required minimum amount of internal chip Synthesis for FPGA-Based Mealy Finite State Machines: Structural Decomposition in Logic Design contains several original synthesis and optimization methods based on the structural decomposition of FPGA-based FSM circuits developed by the authors. To optimize FSM circuits, the authors introduce the use of three methods of state assignment: twofold, extended, and composite. These methods allow for the creation of two- or three-level architectures of FSM circuits. The authors also demonstrate how the proposed methods, FSM architectures and synthesis methods can replace known solutions based on either functional decomposition or classical methods of structural decomposition. The authors also show how these architectures have regular systems of interconnections and demonstrate positive features compared to methods based on functional decomposition, including producing circuits with fewer elements that are faster and consume less power than their counterparts. The book includes experimental results proving the efficiency of the proposed solutions and compares the numbers in Look-up Tables (LUTs), showing the performance (maximum operating frequency) and power consumption for various methods of state audience for this book is students, researchers, and engineers specializing in computer science/ engineering, electronics, and telecommunications. It will be especially useful for engineers working within the scope of algorithms, hardware-based software accelerators and control units, and systems based on the use of FPGAs.
Details
- ISBN 103288228X
- ISBN-13 9781032882284
- Title Logic Synthesis for FPGA-Based Mealy Finite State Machines
- Author Alexander Barkalov, Larysa Titarenko, Kazimierz Krzywicki
- Format Paperback
- Year 2026
- Pages 306
- Publisher Taylor & Francis Ltd
GE_Item_ID:178719713; About Us
Grand Eagle Retail is the ideal place for all your shopping needs! With fast shipping, low prices, friendly service and over 1,000,000 in stock items - you\'re bound to find what you want, at a price you\'ll love!
Shipping & Delivery Times
Shipping is FREE to any address in USA.
Please view estimated delivery times at the top of the listing. Deliveries are made by either USPS or Courier. We are unable to deliver faster than stated.
International deliveries will take 1-6 weeks.
NOTE: We are unable to offer combined shipping for multiple items purchased. This is because our items are shipped from different locations.
Returns
If you wish to return an item, please consult our Returns Policy as below:
Please contact Customer Services and request \"Return Authorisation\" before you send your item back to us. Unauthorised returns will not be accepted.
Returns must be postmarked within 4 business days of authorisation and must be in resellable condition.
Returns are shipped at the customer\'s risk. We cannot take responsibility for items which are lost or damaged in transit.
For purchases where a shipping charge was paid, there will be no refund of the original shipping charge.
Additional Questions
If you have any questions please feel free to Contact Us.
Categories
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.