Open in app
Home
Notifications
Lists
Stories

Write
Jay Castro
Jay Castro

Home

Dec 3, 2020

Combinational Logic: How to Create 32-bit less than comparator

The purpose of this article is to create a design that is scalable and can be expanded to 2n bits. Below is a truth table for a 2-bit less than circuit. Next, we use a Karnaugh-map (K-map) to and use the min-terms ( where Y=1) to generate an equation for our 2-bit less than circuit.

Design

2 min read

Combinational Logic: How to Create 32-bit less than comparator
Combinational Logic: How to Create 32-bit less than comparator

Combinational Logic: How to Create 32-bit less than comparator

The purpose of this article is to create a design that is scalable and can be expanded to 2n bits.

Below is a truth table for a 2-bit less than circuit.

Less Than Truth Table

Next, we use a Karnaugh-map (K-map) to and use the min-terms ( where Y=1) to generate an equation for our 2-bit less than circuit.

--

--

Jay Castro

Jay Castro

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Knowable