Digital design, logic gates, Boolean algebra

n-BIT MAXIMUM VALUE SELECTOR

Consider a simple device that takes two n-bit unsigned magnitude binary inputs A and B representing two numeric values ranging from zero to (2^n) - 1. The n inputs for A are represented by input variables A(n-1) through A0. Values for B and C are represented similarly. The n-bit output C of the device will be the GREATER of the two binary values presented on the n-but inputs A and B.

Realize a new solution for a 2-bit maximum value selector that uses two 1-bit 16-to- mul plex ers (one to implement CI and one to implement CO). You may use no other discrete logic devices. Simulate your design, test it Again consider a 2-bit maximum value selector. Realize a solution to this design that uses only 1-bit 2-to-1 multiplexers. You may use as many of these multiplexers as you wish, but you may use NO other logic device. Simulate your design, test it Realize a new implementation for your 2-bit maximum value selector that uses only NAND gates. You may use as many NAND gates as you wish. but may use NO other discrete logic devices. Simulate your design, test