Skip to main content

Simplifying Boolean Algebra for FPGA

  • Chapter
  • First Online:
Beginning FPGA: Programming Metal
  • 4611 Accesses

Abstract

Using Boolean algebra to directly describe the combinational logic in VHDL (VHSIC (very high speed integrated circuit) Hardware Description Language) may not be a good idea for a design that has more than four inputs. When the combinational logic design has more than four inputs, the "logic" behind the design tends to become difficult for other designers to understand.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Aiken Pang and Peter Membrey

About this chapter

Cite this chapter

Pang, A., Membrey, P. (2017). Simplifying Boolean Algebra for FPGA. In: Beginning FPGA: Programming Metal. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-6248-0_9

Download citation

Publish with us

Policies and ethics