Muutke küpsiste eelistusi

Finite State Machine Logic Synthesis for Complex Programmable Logic Devices 2013 ed. [Pehme köide]

  • Formaat: Paperback / softback, 172 pages, kõrgus x laius: 235x155 mm, kaal: 2934 g, XV, 172 p., 1 Paperback / softback
  • Sari: Lecture Notes in Electrical Engineering 231
  • Ilmumisaeg: 25-Jun-2015
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642442242
  • ISBN-13: 9783642442247
  • Pehme köide
  • Hind: 95,02 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 111,79 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 172 pages, kõrgus x laius: 235x155 mm, kaal: 2934 g, XV, 172 p., 1 Paperback / softback
  • Sari: Lecture Notes in Electrical Engineering 231
  • Ilmumisaeg: 25-Jun-2015
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642442242
  • ISBN-13: 9783642442247

This book is a monograph devoted to logic synthesis and optimization for CPLDs. CPLDs' macrocell can also be interpreted as programmable AND-fixed OR structure, well known as PAL-based structure. The question is: what should be done when the number of implicants representing function exceeds the number of product terms available in a logic block. The answer is ... in the book.

Logic synthesis and optimization methods dedicated for PAL-based structures are proposed. The methods strive to find the optimum fit for the combinational logic and finite state machines to the structure of the logic device and aim at area and speed optimization. The theoretical background and complete strategies are richly illustrated with examples and figures.



Offering theoretical background, complete strategies and many examples and figures, this book discusses the question of what should be done when the number of implicants representing function exceeds the number of product terms available in a logic block.
Introduction.- Definitions and Basic Properties.- Synthesis of FSMs.- State Assignment Algorithms.- Theoretical Background of Technology-Dependent Optimization.- The Algorithm of Area Optimization Based on Graphs of Outputs.- Conclusions.- Output File Format.- Conclusion.