Register

#k-map

631 views
0 0 votes
what is cyclic prime implicant ?

1 Answer

Best answer
1 1 vote

https://www.youtube.com/watch?v=0KpLQfo3MVk

A prime implicants table is said to be cyclic if 

1: it does not have any essential prime implicants which implies that there are two 'x's' in every column

2: there are no dominance relations amongst the rows and columns 

• selected by
Voting & Accepting an answer helps improve the community
← Previous · Programming executio...Next → · made easy test serie...
← Previous in category · Full AdderNext in category → · Made Easy
Position:
Show:

Related questions

1 1 vote
1 1 answer
740
740 views
Harsh Mehta asked Oct 5, 2017
740 views
#K-Map
The function f(A, B, C, D) = Σm(0, 1, 4, 6, 7, 8, 10, 14, 15). The number of prime implicants and essential prime implicants are (a) 6, 1(b) 6,2 (c) 7, 1 (d) 7, 2 Explai...
2 2 votes
1 answers 1 answer
2.3k
2.3k views
Harsh Mehta asked Oct 5, 2017
2,326 views
#K-Map
Minimum size of ROM required to implement following set of Boolean equations isF1 (w,x,y,z) = Σm( 0,1,2,5,7,12,13,15 )F2 (w,x,y,z) = Σm( 0,5,6,9, 13,15 )F3 (w,x,y,z) = Σm...
3 3 votes
3 3 answers
220
220 views
GO Classes asked Jun 12
220 views
GO Classes DPP | GATE CS | Digital Logic | K-map Simplification
For the Boolean function $\mathrm{F}(\mathrm{A},\mathrm{B},\mathrm{C},\mathrm{D})=\Pi _M(0,2,9,13)+\mathrm{d}(8,10,12)$, which of the following is the minimal POS form us...
4 4 votes
4 4 answers
264
264 views
GO Classes asked Jun 12
264 views
GO Classes DPP | GATE CS | Digital Logic | K-map Simplification
For the Boolean function $\mathrm{F}(\mathrm{A},\mathrm{B},\mathrm{C},\mathrm{D})=\Pi _M(3,6,7,12,14)$, which of the following is a correct minimal POS form using K-map?$...