Muutke küpsiste eelistusi

E-raamat: Switching and Finite Automata Theory

(Princeton University, New Jersey), (Technion - Israel Institute of Technology, Haifa)
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 22-Oct-2009
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781139931311
  • Formaat - EPUB+DRM
  • Hind: 148,20 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: EPUB+DRM
  • Ilmumisaeg: 22-Oct-2009
  • Kirjastus: Cambridge University Press
  • Keel: eng
  • ISBN-13: 9781139931311

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"Topics in switching and finite automata theory have been an important part of the curriculum in electrical engineering and computer science departments for several decades. The third edition of this book builds on the comprehensive foundation provided by the second edition and adds: significant new material in the areas of CMOS logic; modern two-level and multi-level logic synthesis methods; logic design for emerging nanotechnologies; test generation, design for testability and built-in self-test for combinational and sequential circuits; modern asynchronous circuit synthesis techniques; etc. We have attempted to maintain the comprehensive nature of the earlier edition in providing readers with an understanding of the structure, behavior, and limitations of logical machines. At the same time, we have provided an up-to-date context in which the presented techniques can find use in a variety of applications.We start with introductory material and build up to more advanced topics. Thus, the technical background assumed on the part of the reader is minimal"--Provided by publisher.



Understand the structure, behavior, and limitations of logic machines with this thoroughly updated third edition. Many new topics are included, such as CMOS gates, logic synthesis, logic design for emerging nanotechnologies, digital system testing, and asynchronous circuit design, to bring students up-to-speed with modern developments. The intuitive examples and minimal formalism of the previous edition are retained, giving students a text that is logical and easy to follow, yet rigorous. Kohavi and Jha begin with the basics, and then cover combinational logic design and testing, before moving on to more advanced topics in finite-state machine design and testing. Theory is made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.

Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition.

Arvustused

"If you intend to study computer engineering, read this book first, then do the hundreds of excellent exercises, and then read the book again." - Klaus Galensa, Computing Reviews

Muu info

Understand the structure, behaviour, and limitations of logic machines with this thoroughly updated third edition.
Preface; Part I. Preliminaries:
1. Number systems and codes;
2. Sets, relations, and lattices; Part II. Combinational Logic:
3. Switching algebra and its applications;
4. Minimisation of switching functions;
5. Logic design;
6. Multilevel logic synthesis;
7. Threshold logic for nanotechnologies;
8. Testing of combinational circuits; Part III. Finite State Machines:
9. Introduction to synchronous sequential circuits and iterative networks;
10. Capabilities, minimisation, and transformation of sequential machines;
11. Asynchronous sequential circuits;
12. Structure of sequential machines;
13. State-identification experiments and testing of sequential circuits;
14. Memory, definiteness, and information losslessness of finite automata;
15. Linear sequential machines;
16. Finite-state recognisers; Index.
Zvi Kohavi is Executive Vice President and Director General at Technion Israel Institute of Technology. He is Professor Emeritus of the Computer Science Department at Technion, where he held the position of Sir Michael and Lady Sobell Chair in Computer Engineering and Electronics. He has previously served as the Managing Director of the Technion Research and Deveopment Foundation, and on the faculty of M.I.T. and the University of Utah. Niraj K. Jha is a Professor at Princeton University and a Fellow of the IEEE and ACM. He is currently serving as Editor-in-Chief of IEEE Transactions on VLSI Systems and Associate Editor of IEEE Transactions on Computer-Aided Design, IEEE Transactions on Circuits and Systems, and Journal of Low Power Electronics. He is a recipient of the AT&T Foundation Award and NEC Preceptorship Award for research excellence, the NCR Award for teaching excellence, and Princeton's Graduate Mentoring Award.