Principles of Digital Design

Name: Principles of Digital Design
Price: 5.56 USD
Availability: InStock
ISBN: 9780133011449

ISBN-10: 0133011445

ISBN-13: 9780133011449

Edition: 1st 1997

Authors: Daniel D. Gajski

List price: $212.00

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $5.56

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Appropriate for introductory courses in digital design, computer design, computer design and computer architecture in computer engineering and computer science curricula. This text is designed to facilitate a thorough understanding of the fundamental principles of design without requiring readers to memorize an excess of confusing technological details. It integrates fundamentals with state-of-the-art techniques in computer design to demonstrate the complete design process, from specification to manufacturing.

Book details

List price: $212.00
Edition: 1st
Copyright year: 1997
Publisher: Prentice Hall PTR
Publication date: 9/9/1996
Binding: Hardcover
Pages: 447
Size: 8.50" wide x 9.75" long x 1.00" tall
Weight: 2.046
Language: English




Introduction


Design representation


Levels of abstraction


Design process


CAD tools


Typical design process


Road map



Data Types and Representations


Positional number systems


Octal and hexadecimal numbers


Number system conversions


Addition and subtraction of binary numbers


Representation of negative numbers


Two's-complement addition and subtraction


Binary ultiplication


Binary division


Floating-point number representation


Binary codes for decimal numbers


Character codes


Codes for error detection and correction


Hamming codes



Boolean Algebra and Logic Design


Algebraic properties


Axiomatic definition of boolean algebra


Basic theorems of boolean algebra


Boolean functions


Canonical forms


Standard forms


Digital logic gates


Extension to multiple inputs and multiple operators


Gate implementations


VLSI technology



Simplification of Boolean Functions


The map representation


The map method of simplification


Don't-care conditions


The tabulation method


Technology mapping for gate arrays


Technology mapping for custom libraries


Hazard-free design



Combinatorial Components


Carry-ripple adders


Carry-look-ahead adders


Adders/subtractors


Logic unit


Arithmetic-Logic Unit


Decoders


Selectors


Buses


Priority encoders


Magnitude comparators


Shifters and rotators


Read-Only memories


Programmable logic arrays



Sequential Logic


SR-latch


Gated SR-latch


Gated D-latch


Flip-flops


Flip-flop types


Analysis of sequential logic


Finite-state-machine model


Synthesis of sequential logic


FSM model capture


State minimization


State encoding


Choice of memory elements


Optimization and timing



Storage Components


Registers


Shift registers


Counters


BCD counter


Asynchronous counter


Register files


Random-access memories (RAMs)


Push-down stacks


Firs- in-first-out queue


Simple datapaths


General datapaths


Control unit design



Register-Transfer Design


Design model


FSMD definition


Algorithmic-state-machine charts


Synthesis from ASM charts


Register sharing (variable merging)


Functional unit sharing (operator sharing)


Bus sharing (connection merging)


Register merging


Chaining and multicycling


Functional unit pipelining


ASM pipelining


Control- pipelining


Scheduling



Processor Design


Instruction sets


Addressing modes


Processor design


Instruction set design


Processor design


Reduced instruction set


RISC Design


Data forwarding


Branch prediction