An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions

Başçiftçi, Fatih; Kahramanli, Sirzat

doi:10.1109/eurcon.2007.4400396

Cited by 6 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…x y Figure 1. Couple5 0 f SOOC2S 51"" mintemlS andderi�12d implicanis [(x, y, z, w) = I (0,1,2,4,5, 8,9,10,12,13,15) xyzw Iteration3 Figure 6. Essential implicants derived from f{x,y,z,w) Figure 6 shows the essential imp Ii cants derived from f(x,y,z,w) and the simplified form of the function.…”

Section: The Index Sorting Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

Sheidaeian

Zolfaghari

Mozaffari

2010

2010 International Conference on Networking and Information Technology

View full text Add to dashboard Cite

This paper introduces a software tool named SPIDERS which uses a novel iterative algorithm to derive prime implicants from logic functions. The algorithm takes the logic function as a list of binary numbers indicating the minterms to be disjointed. The numbers are first sorted using a special sorting algorithm with a time complexity of order O(n). Then they are rotated and sorted again in each iteration. Thus, the ith iteration of the algorithm places minterms differing only in the ith literal in successive locations of the list. By doing so, prime implicants appear as consecutive blocks of numbers in the list. The SPIDERS algorithm exhaustively derives all prime implicant from the input function during a number of iterations which is equal to the number of logic variables.

show abstract

Section: The Index Sorting Algorithmmentioning

confidence: 99%

“…Therefore, developing techniques and algorithms for logic minimization has been a research focus in recent years [12][13][14][15][16]. This paper proposes an iterative algorithm for implicant derivation which is based on bitwise rotation and sort in each iteration.…”

Section: Introduction and Basic Conceptsmentioning

confidence: 99%