Digital comparator

For other uses, see comparator (disambiguation).

A digital comparator or magnitude comparator is a hardware electronic device that takes two numbers as input in binary form and determines whether one number is greater than, less than or equal to the other number. Comparators are used in central processing unit s (CPUs) and microcontrollers (MCUs). Examples of digital comparator include the CMOS 4063 and 4585 and the TTL 7485 and 74682-'89.

Note: An XNOR gate is a basic comparator, because its output is "1" only if its two input bits are equal.

The analog equivalent of digital comparator is the voltage comparator. Many microcontrollers have analog comparators on some of their inputs that can be read or trigger an interrupt.

Implementation

Digital comparator using multiplexers

Consider two 4-bit binary numbers A and B so

One-bit binary full comparator, equality, inequality, greater than, less than at gate level. Created using Logisim.

$A=A_{3}A_{2}A_{1}A_{0}$

$B=B_{3}B_{2}B_{1}B_{0}$

Here each subscript represents one of the digits in the numbers.

Equality

The binary numbers A and B will be equal if all the pairs of significant digits of both numbers are equal, i.e.,

$A_{3}=B_{3}$ , $A_{2}=B_{2}$ , $A_{1}=B_{1}$ and $A_{0}=B_{0}$

Since the numbers are binary, the digits are either 0 or 1 and the boolean function for equality of any two digits $A_{i}$ and $B_{i}$ can be expressed as

$x_{i}=A_{i}B_{i}+{\overline {A}}_{i}{\overline {B}}_{i}$ we can also replace it by XNOR gate in digital electronics.

$x_{i}$ is 1 only if $A_{i}$ and $B_{i}$ are equal.

For the equality of A and B, all $x_{i}$ variables (for i=0,1,2,3) must be 1.

So the equality condition of A and B can be implemented using the AND operation as

$(A=B)=x_{3}x_{2}x_{1}x_{0}$

The binary variable (A=B) is 1 only if all pairs of digits of the two numbers are equal.

Inequality

In order to manually determine the greater of two binary numbers, we inspect the relative magnitudes of pairs of significant digits, starting from the most significant bit, gradually proceeding towards lower significant bits until an inequality is found. When an inequality is found, if the corresponding bit of A is 1 and that of B is 0 then we conclude that A>B.

This sequential comparison can be expressed logically as:

$(A>B)=A_{3}{\overline {B}}_{3}+x_{3}A_{2}{\overline {B}}_{2}+x_{3}x_{2}A_{1}{\overline {B}}_{1}+x_{3}x_{2}x_{1}A_{0}{\overline {B}}_{0}$

$(A<B)={\overline {A}}_{3}B_{3}+x_{3}{\overline {A}}_{2}B_{2}+x_{3}x_{2}{\overline {A}}_{1}B_{1}+x_{3}x_{2}x_{1}{\overline {A}}_{0}B_{0}$

(A>B) and (A < B) are output binary variables, which are equal to 1 when A>B or A<B respectively.

External links

Digital Comparators by Texas Instruments

This article is issued from Wikipedia - version of the 3/31/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

Digital comparator

Implementation

See also

External links