Fundamentals of Logic Design

ISBN-10: 0495471690

ISBN-13: 9780495471691

Edition: 6th 2010

List price: $331.95 Buy it from $17.87 Rent it from $22.00
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


Used Starting from $17.90
Rent Starting from $22.00
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought

Book details

List price: $331.95
Edition: 6th
Copyright year: 2010
Publisher: Course Technology
Publication date: 3/13/2009
Binding: Paperback
Pages: 758
Size: 8.25" wide x 9.25" long x 1.50" tall
Weight: 3.542
Language: English

Larry L. Kinney is a Professor and Director of Undergraduate Studies at the University of Minnesota. He received his Ph.D in Electrical Engineering from the University of Iowa in 1968. His research concerns digital system and digital computer design, specifically concurrent error detection techniques, testing of logic and design, distributed computer systems, computer architectures, error detecting/correcting codes, and applications of microprocessors.

Introduction: Number Systems and Conversion
Digital Systems and Switching Circuits
Number Systems and Conversion
Binary Arithmetic
Representation of Negative Numbers
Binary Codes
Boolean Algebra
Basic Operations
Boolean Expressions and Truth Tables
Basic Theorems
Commutative, Associative, and Distributive Laws
Simplification Theorems
Multiplying Out and Factoring
DeMorgan's Laws
Boolean Algebra (Cont)
Multiplying Out and Factoring Expressions
Exclusive-OR and Equivalence Operations
The Consensus Theorem
Algebraic Simplification of Switching Expressions
Proving Validity of an Equation
Applications of Boolean Algebra: Minterm and Maxterm Expressions
Conversion of English Sentences to Boolean Equations
Combinational Logic Design Using a Truth Table
Minterm and Maxterm Expansions
General Minterm and Maxterm Expansions
Incompletely Specified Functions
Examples of Truth Table Construction
Design of Binary Adders
Karnaugh Maps
Minimum Forms of Switching Functions
Two- and Three-Variable Karnaugh Maps
Four-Variable Karnaugh Maps
Determination of Minimum Expressions Using Essential Prime Implicants
Five-Variable Karnaugh Maps
Other Uses of Karnaugh Maps
Other Forms of Karnaugh Maps
Quine-McClusky Method
Determination of Prime Implicants
The Prime Implicant Chart
Petrick's Method
Simplification of Incompletely Specified Functions
Simplification Using Map-Entered Variables
Multi-Level Gate Circuits: NAND and NOR Gates Multi-Level Gate Circuits
NAND and NOR Gates
Design of Two-Level Circuits Using NAND and NOR Gates
Design of Multi-Level NAND and NOR Gate Circuits
Circuit Conversion Using Alternative Gate Symbols
Design of Two-Level, Multiple-Output Circuits Determination of Essential Prime Implicants for Multiple-Output Realization
Multiple-Output NAND and NOR Circuits
Combinational Circuit Design and Simulation Using Gates Review of Combinational Circuit Design
Design of Circuits with Limited Gate Fan-In
Gate Delays and Timing Diagrams
Hazards in Combinational Logic
Simulation and Testing of Logic Circuits
Multiplexers, Decodes, and Programmable Logic Devices Introduction
Three-State Buffers
Decoders and Encoders
Read-Only Memories
Programmable Logic Devices
Complex Programmable Logic Devices
Field Programmable Gate Arrays
Introduction to VHDL VHDL Description of Combinational Circuits
VHDL Models for Multiplexers
VHDL Modules
Signals and Constants
VHDL Operators
Packages and Libraries
IEEE Standard Logic
Compilation and Simulation of VHDL Code
Latches and Flip-Flops Introduction
Set-Reset Latch
Gated D Latch
Edge-Triggered D Flip-Flop
S-R Flip-Flop
J-K Flip-Flop
T Flip-Flop
Flip-Flops with Additional Inputs
Registers and Counters Registers and Register Transfers
Shift Registers
Design of Binary Counters
Counters for Other Sequences
Counter Design Using S-R and J-K Flip-XFlops
Derivation of Flip-Flop Input Equations-Summary
Analysis of Clocked Sequential Circuits A Sequential Parity Checker
Analysis by Signal Tracing and Timing Charts
State Tables and Graphs
General Models for Sequential Circuits
Derivation of State Graphs and Tables
Design of a Sequence Detector
More Complex Design Problems
Guidelines for Construction of State Graphs
Serial Data Code Conversion
Alphanumeric State Graph Notation
Reduction of State Tables State Assignment Elimination of Redundant States
Equivalent States
Determination of State Equivalence Using an Implication Table
Equivalent Sequential Circuits
Incompletely Specified State Tables
Derivation of Flip-Flop Input Equations
Equivalent State Assignments
Guidelines for State Assignment
Using a One-Hot State Assignment
Sequential Circuit Design
Summary of Design Procedure for Sequential Circuits
Design Example-Code Converter
Design of Iterative Circuits
Design of Sequential Circuits Using ROMs and PLAs
Sequential Circuit Design Using CPLDs
Sequential Circuit Design Using FPGAs
Simulation and Testing of Sequential Circuits
Overview of Computer-Aided Design
VHDL for Sequential Logic
Modeling Flip-Flops Using VHDL Processes
Modeling Registers and Counters Using VHDL Processes
Modeling Combinational Logic Using VHDL Processes
Modeling a Sequential Machine
Synthesis of VHDL Code
More About Processes and Sequential Statements
Circuits for Arithmetic Operations
Serial Adder with Accumulator
Design of a Parallel Multiplier /Design of a Binary Divider
State Machine Design with SM Charts State Machine Charts
Derivation of SM Charts
Realization of SM Charts
VHDL for Digital System Design
VHDL Code for a Serial Adder
VHDL Code for a Binary Multiplier
VHDL Code for a Binary Divider
VHDL Code for a Dice Game Simulator
Concluding Remarks
Appendices MOS and CMOS Logic
VHDL Language Summary /Proofs of Theorems
Answers to Selected Study Guide Questions and Problems
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.