menu
{ "item_title" : "Logic Synthesis and Verification Algorithms", "item_author" : [" Gary D. Hachtel", "Fabio Somenzi "], "item_description" : "Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students. Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics. A unique feature of this text is the large collection of solved problems. Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/79/239/746/0792397460_b.jpg", "price_data" : { "retail_price" : "99.99", "online_price" : "99.99", "our_price" : "99.99", "club_price" : "99.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Logic Synthesis and Verification Algorithms|Gary D. Hachtel

Logic Synthesis and Verification Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students.
Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics.
A unique feature of this text is the large collection of solved problems.
Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.

This item is Non-Returnable

Details

  • ISBN-13: 9780792397465
  • ISBN-10: 0792397460
  • Publisher: Springer
  • Publish Date: June 1996
  • Dimensions: 10.25 x 7.32 x 1.56 inches
  • Shipping Weight: 3.1 pounds
  • Page Count: 564

Related Categories

You May Also Like...

    1

BAM Customer Reviews