Join-calculus

From formulasearchengine
Revision as of 10:56, 15 March 2013 by en>Addbot (Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q3183028)
Jump to navigation Jump to search

I'm Fernando (21) from Seltjarnarnes, Iceland.
I'm learning Norwegian literature at a local college and I'm just about to graduate.
I have a part time job in a the office.

my site; wellness [continue reading this..] 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: X NOR 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

Consider two 4-bit binary numbers A and B so

A=A3A2A1A0

B=B3B2B1B0

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.,

A3=B3, A2=B2, A1=B1 and A0=B0

Since the numbers are binary, the digits are either 0 or 1 and the boolean function for equality of any two digits Ai and Bi can be expressed as

xi=AiBi+AiBi.

xi is 1 only if Ai and Bi are equal.

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

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

(A=B)=x3x2x1x0

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)=A3B3+x3A2B2+x3x2A1B1+x3x2x1A0B0

(A<B)=A3B3+x3A2B2+x3x2A1B1+x3x2x1A0B0

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

See also

External links