I'm trying to implement a recursive implementation of the following function
**We are allowed to use also \[ Multiplexer(2^n : 1) \] gates.
If anyone has any idea and wants to share it I'd be glad to hear :)
Have a great day!
Depending on the choice of choice for a logic circuit, 4-bit input (N), connected, given three
is doing one of the operations.
a) F = 4N + X
b) F = MOD (N, X)
c) F = ABS (2N - 3X + 5)
* MOD is modulo operation.
** ABS is absolute value operation.
*** The value of X is accepted as 2 if the son of...
I am working on something similar and would appreciate if you could drop the vi.
Moderator Edit: Thread split off from this: