Realize the digital filter described by the following difference equation: y[n] = x[n] + 2x[n-1] + ... + 8x[n-7] Make assumptions wherever necessary.

For the K-map where the X input is down and the Y input is across, which one of these is a simplified expression? F(x,y)=y F(x,y)=x'+y' F(x,y)=x+y' F(x,y)=(xy)' F(x,y)=x+y F(x,y)=xy

Simplify the following function with a map, then implement it with a two-level NAND circuit. ?(?, ?, ?, ?) = ??′?′ + ?′? + ??? + ??′? + ?′?′?′

bottom set the low-order b bits of x to 1; the others to 0. For example, if b is 3, x should be 7. Pay special attention to the edge cases: if b is 32 x should be −1; if b is 0 x should be 0. Do not use in your solution. Provided input(s): b