Unformatted text preview: F ): F ( a,b,c,d ) = a b c + b d + abcd + bc d + ad (a) For each implicant in F , indicate if it is reducible. If so, give the expression for the reduced implicant, e.g., “ ab can be reduced to ab c ”. You are to examine reducibility only—do not commit your change on F . (b) Is F irredundant? Is it prime? Is it minimum with respect to single implicant containment? (c) Perform the Irredundant operation on F to ﬁnd a minimal cover M . Indicate the corresponding E r , R t , and R p sets. 3. Find the kernel set for x = cd + a c + abed + b c + abc y = a b + acd + b d + a d + ab e What is the largest common sub-expression that can be extracted from x and y ? cube sheet (origin is located at the lower/left/front corner of the inner-cube) (b) (a) (c)...
View Full Document
- Spring '07
- Initialisms, Binary function, single implicant containment