Home > Store

Verilog Digital Computer Design: Algorithms Into Hardware

Register your product to gain access to bonus material or receive a coupon.

Verilog Digital Computer Design: Algorithms Into Hardware


  • Sorry, this book is no longer in print.
Not for Sale



  • Organizes coverage around design topics, such as pipelining, and emphasizes techniques that focus on creation of correct designs which reduce time to market.
  • Uses algorithmic state machines (ASMs) as the master plan in a top down approach — where physical details are ignored in order that the designer can concentrate on developing a correct algorithm.
  • Shows the correspondence of ASMs to implicit style Verilog — which is similar to software, except that the designer has control over scheduling of computation within clock cycles.
  • Fully discusses the relationships of the code to the cycle-by-cycle activity of the design.
  • Expresses designs with both ASM charts and Verilog.
    • Shows the intimate connection between ASMs and implicit style Verilog.

  • Uses a few simple design examples of both special and general purpose machines to illustrate the tradeoff between hardware and software.
  • Offers extensive coverage of implicit style Verilog and non-blocking assignment — a high-level notation that captures, in an abstract way, the essential aspect of synchronous registers.
    • Shows that complex digital and computer systems can be thought of as algorithms coded in implicit style Verilog — rather than the traditional gate, structural, or RTL approaches used by many designers.

    • Contains many practical examples of implicit style Verilog.

  • Features a novel ASM/Verilog description of pipelined and superscalar processors.
    • Describes pipelined systems as a natural extension of non-blocking assignment in implicit style Verilog.

    • Provides a unique full chapter on a superscalar processor.

  • Contains a unique approach to one hot synthesis.
    • Outlines the one to one mapping between ASM charts, implicit style Verilog, and one hot circuit diagrams.

    • Presents the Verilog Implicit to One hot (VITO) preprocessor — a novel way to automatically synthesize a one hot design from implicit style Verilog directly.

  • Provides a web site that offers:
    • Verilog source code.

    • Links to software: VeriWell/Free; VerilogEASY; VITO; ARM (Advanced RISC Machines) HTML.


  • Copyright 1998
  • Dimensions: 7" x 9-1/4"
  • Pages: 640
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-639253-9
  • ISBN-13: 978-0-13-639253-8


Verilog Digital Computer Design: Algorithms to Hardware

Shorten time to market with Verilog HDL

Real-world Verilog design, start-to-finish

The most productive way to design complex digital and computer systems is to understand them as algorithms and code them in implicit style Verilog, using Verilog's non-blocking assignment features. In this book, award-winning Verilog expert Mark Gord on Arnold shows how, introducing a top-down approach that leverages the ASM charts most digital designers are already familiar with. Throughout, you'll learn practical techniques that enable earlier debugging, automatic conversion of source code into hardware, and shorter time to market.

  • Understand the fundamental goals, structure and behavior of Verilog.
  • Discover how to use ASMs as the “master plan” for digital design.
  • Walk through the three stages of Verilog design: behavioral, mixed and structural.
  • Learn Verilog simulation techniques for Mealy machines and bottom-testing loops.
  • Use Verilog gate level techniques to model propagation delay.
  • Leverage special-purpose design techniques to build general-purpose processors.

Arnold demonstrates a powerful new approach that automatically synthesizes a one-hot design directly from implicit style Verilog. He also introduces the elegant ARM instruction set as a way of exploring RISC design with implicit Verilog and ASMs. From start to finish, Verilog Digital Computer Design: Algorithms to Hardware is more than a great guide to Verilog: it's a primer on the enduring concepts of computer design that will apply no matter which tools you choose.

Sample Content

Table of Contents

(NOTE: Chapters conclude with Conclusion, Further Reading, and Exercises.)

1. Why Verilog Computer Design?

What is computer design? A brief history of computer/digital technology. Translating algorithms into hardware. Hardware description languages. Typography. Assumed background.

2. Designing ASMs.

What is an ASM chart? Pure behavioral example. Mixed examples. Pure structural example. Hierarchical design.

3. Verilog Hardware Description Language.

Simulation versus synthesis. Verilog versus VHDL. Role of test code. Behavioral features of Verilog. Structural features of Verilog. $time. Time control. Assignment with time control. Tasks and functions. Structural Verilog, modules and ports.

4. Three Stages for Verilog Design.

Pure behavioral examples. Mixed stage of the two-state division machine. Pure structural stage of the two state division machine. Hierarchical refinement of the controller.

5. Advanced ASM Techniques.

Moore versus Mealy. Mealy version of the division machine. Translating Mealy ASMs into behavioral Verilog. Translating complex (goto) ASMs into behavioral Verilog. Translating conditional command signals into Verilog. Single-state Mealy ASMs.

6. Designing for Speed and Cost.

Propagation delay. Factors that determine clock frequency. Example of netlist propagation delay. Abstracting propagation delay. Single cycle, multi-cycle and pipeline.

7. One Hot Designs.

Moore ASM to one hot. Verilog to one hot. Mealy commands in a one hot machine. Moore command signals with Mealy<<=. Bottom testing loops with disable inside forever.

8. General-Purpose Computers.

Introduction and history. Structure of the machine. Behavioral fetch/execute. Mixed fetch/execute. Memory hierarchy.

9. Pipelined General-Purpose Processor.

First attempt to pipeline. Example of independent instructions. Data dependencies. Data forwarding. Control dependencies: implementing JMP. Skip instructions in a pipeline. Our old friend: division. Multi-port memory. Pipelined PDP-8 architecture.

10. RISC Processors.

History of CISC versus RISC. The ARM. Princeton versus Harvard architecture. The register file. Three operands are faster than one. ARM subset. Multi-cycle implementation of the ARM subset. Pipelined implementation. Superscalar implementation. Comparison of childish division implementations.

11. Synthesis.

Overview of synthesis. Verilog synthesis styles. Synthesizing enabled_register. Synthesizing a combinational adder. Synthesizing an implicit style bit serial adder. Switch debouncing and single pulsing. Explicit style switch debouncer. Putting it all together: structural synthesis. A bit serial PDP-8.

A. Machine and Assembly Language.

B. PDP-8 Commands.

Memory reference instructions. Non-memory reference instructions. Group 1 microinstructions. Group 2 microinstructions.

C. Combinational Logic Building Blocks.

Models of reality. Bus. Adder. Multiplexer. Other arithmetic units. Arithmetic logic unit. Comparator. Demux. Decoders. Encoders. Programmable devices. Conclusions. Further reading. Exercises.

D. Sequential Logic Building Blocks.

D.1 System clock. Timing Diagrams. Synchronous Logic. Bus timing diagrams. The D-type register. Enabled D-type register. Up counter register. Up/down counter. Shift register. Unused inputs. Highly specialized registers. Further Reading. Exercises.

E. Tri-State Devices.

Switches. Single bit tri-state gate in structural Verilog. Bus drivers. Uses of tri-state. Further Reading. Exercises.

F. Tools and Resources.

Prentice Hall. VeriWell Simulator. M4-128/64 demoboard. Wirewrap supplies. VerilogEASY. PLDesigner. VITO. Open Verilog International (OVI). Other Verilog and programmable logic vendors. PDP-8. ARM.

G. ARM Instructions.

Efficient instruction set. Instruction set summary. Register Model.

H. Another View on Non-blocking Assignment.

Sequential logic. $strobe. Inertial versus transport delay. Sequence preservation. Further reading.

I. Glossary.

J. Limitations on Mealy with Implicit Style.

Further Reading.



When I started teaching Verilog to electrical engineering and computer science seniors at the University of Wyoming, there were only two books and a handful of papers on the subject, in contrast to the overwhelming body of academic literature written about VHDL. Previously, VHDL had been unsuccessful in this course. For all its linguistic merits, VHDL is too complex for the first-time user. Verilog, on the other hand, is much more straightforward and allows the first-time user to focus on the design rather than on language details. Yet Verilog is powerful enough to describe very exotic designs, as illustrated in chapters 8-11.

As its subtitle indicates, this book emphasizes the algorithmic nature of digital computer design. This book uses the manual notation of Algorithmic State Machine (ASM) charts (chapter 2) as the master plan for designs. This book uses a top-down approach, which is based on the designerÕs faith that details can be ignored at the beginning of the design process, so that the designer's total effort can be to develop a correct algorithm.

Chapters 2-11 use the same elementary algorithm, referred to as the childish division algorithm, for many hardware and software examples. Because this algorithm is so simple, it allows the reader to focus on the Verilog and computer design topics being covered by each chapter. This book is unique in showing the correspondence of ASM charts to implicit style Verilog (chapters 3, 5 and 7). All chapters emphasize a feature of Verilog, known as non-blocking assignment or Register Transfer Notation (RTN), which is the main distinction between software and synchronous hardware. Except for chapter 6, this book ignores (abstracts away) propagation delay. Instead, the emphasis here is toward designs that are accurate on a clock cycle by clock cycle basis with non-blocking assignment. (Many existing Verilog books either provide too much propagation delay information or are so abstract as to be inaccurate on a clock cycle basis. Appendices C and D motivate the abstraction level used here.)

Chapter 4 gives a novel three-stage design process (behavioral, mixed, structural), which exercises the reader's understanding of many elementary features of Verilog. Chapter 7 explains an automated one hot preprocessor, known as VITO, that eliminates the need to go though this manual three-stage process.

This book defers the introduction of Mealy machines until chapter 5 because my experience has been that the complex interactions of decisions and non- blocking assignments in a Mealy machine are confusing to the first-time designer. Understanding chapter 5 is only necessary to understand chapters 9 and 10, appendix J and sections 7.4 and 11.6.

The goal is to emphasize a few enduring concepts of computer design, such as pipelined (chapters 6 and 9) and superscalar (chapter 10) approaches, and show that these concepts are a natural outgrowth of the non-blocking assignment. Chapter 6 uses AS M charts and implicit Verilog to describe pipelining of a special-purpose machine with only the material of chapter 4. Chapters 8, 9 and 11 use the classic PDP-8 as an illustration of the basic principles of a stored program computer and cache memory. Chapter 8 depends only on the ASM material of chapter 2. Chapter 9 requires an understanding of all preceding chapters, except chapter 7. The capstone of this book, chapter 10 (which depends on chapter 9), uses the elegant ARM instruction set to explore the RISC approach, again with the unique combination of ASMs, implicit Verilog and non-blocking assignment.

Chapters 3-6, 9 and 10 emphasize Verilog simulation as a tool for uncovering bugs in a design prior to fabrication. Test code (sometimes called a testbench) that simulates the operating environment for the machine is given with most designs. Chapter 10 introduces the concept of Verilog code coverage. Chapters 7 and 11, which are partially accessible to a reader who understands chapter 3, uses specific synthesis tools for programmable logic to illustrate general techniques that apply to most vendors' tools. Even in synthesis, simulation is an important part of the design flow. Chapter 11 will be much more meaningful after the reader has grasped chapters 1-9. The designs in chapter 11 have been tested and downloaded (www.phptr.com) into Vantis CPLDs using a tool available to readers of this book (appendix F), but these designs should also be usable with minor modifications for other chips, such as FPGAs.

Appendices A, B and G give background on the machine language examples used in chapters 8-11. Appendices C and D give the block diagram notation used in all chapters for combinational logic and sequential logic, respectively. Chapters 1-11 do not use tri-state bidirectional buses, but appendix E explains the Verilog coding of such buses.

This book touches upon several different areas, such as “computer design,” “state machine design,” “assembly language programming,” “computer organization,” “computer arithmetic,” “computer architecture,” “register transfer logic design,” “hardware/software trade-offs,” “VLSI design,” “parallel processing” and “programmable logic design.” I would ask the reader not to try to place this book into the pigeon hole of some narrow academic category. Rather, I would hope the reader will appreciate in all these digital and computer design topics the common thread which the ASM and Verilog notations highlight. This book just scratches the surface of computer design and of Verilog. Space limitations prevented inclusion of material on interfacing (other than section 11.6) and on multiprocessing. The examples of childish division, PDP-8 and ARM algorithms were chosen for their simplicity. Sections labeled “Further reading” at the end of most chapters indicate where an interested reader can find more advanced concepts and algorithms, as well as more sophisticated features of Verilog. Appendix F indicates postal and Web addresses for obtaining additional tools and resources. It is hoped that the simple examples of Verilog and ASMs in this book will enable the reader to proceed to these more advanced computer design concepts.

In places, this book states my opinions rather boldly. I respect readers who have differing interpretations and methodologies, but I would ask such readers to look past these distinctions to the unique and valuable approaches in this book that are not found elsewhere. I have sprinkled (somewhat biased) historical tidbits, primarily from the first quarter century of electronic computer design, to illustrate how enduring algorithms are, and how transient technology is. Languages are more algorithmic than they are technological. Just look at the endurance of the COBOL language for business software. Hardware description languages will no doubt change as the twenty-first century unfolds, but I suspect whatever they become, they will include something very much like contemporary implicit style Verilog.


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020