1-bit magnitude comparator.

[timmy1521]

with the following outputs int the pdf file

 

[Harald Kapp]

???
What is your question?
What have you done so far to solve the task?
We will give you useful advice, but we will not do your homework. Only by solving the task yourself (with helpful nudges from us) will you be able to learn something - not from copying ready made solutions.

 

[timmy1521]

???
What is your question?
What have you done so far to solve the task?
We will give you useful advice, but we will not do your homework. Only by solving the task yourself (with helpful nudges from us) will you be able to learn something - not from copying ready made solutions.

i have managed to identify X Y Z being A.B', A'.B, A'B' respectively.
Have slightly drown a circuit diagram but my doubt is on the relationship of Z is it supposed to be attached to the output of X and Y?

 

[Harald Kapp]

Z is it supposed to be attached to the output of X and Y?

You can either define Z = f(A,B), as you did, or Z = f(X,Y) as you asked.
Using the correct boolean operations both methods will produce the right output.
The difference is in the timing: Assume some arbitrary runtime T for the calculation of a boolean function f(). What is the runtime for Z = F(A,B) expressed in terms of T and what is the runtime of Z = f(X,Y), also expressed in terms of T? Hint: X = f(A,B) and y = f(A,B).
f() indicates the required boolean operation which are of course different for each output.

 

[bertus]

Hello,

Here is the question in full:



In the case A=B , both are either 0 or 1.

Bertus

 

[timmy1521]

Hello,

Here is the question in full:

View attachment 48015

In the case A=B , both are either 0 or 1.

Bertus

yeah i was thinking in that question they have only picked were both are 0 to reference the relationship where A=B.
.

 

[timmy1521]

You can either define Z = f(A,B), as you did, or Z = f(X,Y) as you asked.
Using the correct boolean operations both methods will produce the right output.
The difference is in the timing: Assume some arbitrary runtime T for the calculation of a boolean function f(). What is the runtime for Z = F(A,B) expressed in terms of T and what is the runtime of Z = f(X,Y), also expressed in terms of T? Hint: X = f(A,B) and y = f(A,B).
f() indicates the required boolean operation which are of course different for each output.

ok thanks

 

[AnalogKid]

Have slightly drown a circuit diagram

Please post your schematic.

ak