An Expanding Products Algorithm of Logic Functions Optimization

Qiu, Jianlin; Gu, Xianfeng; Chen, Jianping; Peng, Hailin; Li, Fen; Bo, Wang

doi:10.1109/csie.2009.731

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction and Basic Concepts1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

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