SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

Hamed Sheidaeian; Behrouz Zolfaghari; Saadat Pour Mozaffari

doi:10.1109/ICNIT.2010.5508566

SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

Hamed Sheidaeian^*, Behrouz Zolfaghari, Saadat Pour Mozaffari

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	ICNIT 2010 - 2010 International Conference on Networking and Information Technology
Pages	24-28
Number of pages	5
DOIs	https://doi.org/10.1109/ICNIT.2010.5508566
Publication status	Published - 2010
Externally published	Yes
Event	2010 International Conference on Networking and Information Technology, ICNIT 2010 - Manila, Philippines Duration: 2010 Jun 11 → 2010 Jun 12

Publication series

Name	ICNIT 2010 - 2010 International Conference on Networking and Information Technology

Conference

Conference	2010 International Conference on Networking and Information Technology, ICNIT 2010
Country/Territory	Philippines
City	Manila
Period	10/6/11 → 10/6/12

Keywords

Index sorting
Logic function minimization

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1109/ICNIT.2010.5508566

Cite this

Sheidaeian, H., Zolfaghari, B., & Mozaffari, S. P. (2010). SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort. In ICNIT 2010 - 2010 International Conference on Networking and Information Technology (pp. 24-28). [5508566] (ICNIT 2010 - 2010 International Conference on Networking and Information Technology). https://doi.org/10.1109/ICNIT.2010.5508566

SPIDERS : Swift prime implicant derivation through exhaustive rotation and sort. / Sheidaeian, Hamed; Zolfaghari, Behrouz; Mozaffari, Saadat Pour.

ICNIT 2010 - 2010 International Conference on Networking and Information Technology. 2010. p. 24-28 5508566 (ICNIT 2010 - 2010 International Conference on Networking and Information Technology).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sheidaeian, H, Zolfaghari, B & Mozaffari, SP 2010, SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort. in ICNIT 2010 - 2010 International Conference on Networking and Information Technology., 5508566, ICNIT 2010 - 2010 International Conference on Networking and Information Technology, pp. 24-28, 2010 International Conference on Networking and Information Technology, ICNIT 2010, Manila, Philippines, 10/6/11. https://doi.org/10.1109/ICNIT.2010.5508566

@inproceedings{8cfe564b28254c988746c3f952b4482a,

title = "SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort",

abstract = "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.",

keywords = "Index sorting, Logic function minimization",

author = "Hamed Sheidaeian and Behrouz Zolfaghari and Mozaffari, {Saadat Pour}",

year = "2010",

doi = "10.1109/ICNIT.2010.5508566",

language = "English",

isbn = "9781424475773",

series = "ICNIT 2010 - 2010 International Conference on Networking and Information Technology",

pages = "24--28",

booktitle = "ICNIT 2010 - 2010 International Conference on Networking and Information Technology",

note = "2010 International Conference on Networking and Information Technology, ICNIT 2010 ; Conference date: 11-06-2010 Through 12-06-2010",

}

TY - GEN

T1 - SPIDERS

T2 - 2010 International Conference on Networking and Information Technology, ICNIT 2010

AU - Sheidaeian, Hamed

AU - Zolfaghari, Behrouz

AU - Mozaffari, Saadat Pour

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Index sorting

KW - Logic function minimization

UR - http://www.scopus.com/inward/record.url?scp=77955614677&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955614677&partnerID=8YFLogxK

U2 - 10.1109/ICNIT.2010.5508566

DO - 10.1109/ICNIT.2010.5508566

M3 - Conference contribution

AN - SCOPUS:77955614677

SN - 9781424475773

T3 - ICNIT 2010 - 2010 International Conference on Networking and Information Technology

SP - 24

EP - 28

BT - ICNIT 2010 - 2010 International Conference on Networking and Information Technology

Y2 - 11 June 2010 through 12 June 2010

ER -

SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this