SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort

Hamed Sheidaeian*, Behrouz Zolfaghari, Saadat Pour Mozaffari

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルICNIT 2010 - 2010 International Conference on Networking and Information Technology
ページ24-28
ページ数5
DOI
出版ステータスPublished - 2010
外部発表はい
イベント2010 International Conference on Networking and Information Technology, ICNIT 2010 - Manila, Philippines
継続期間: 2010 6月 112010 6月 12

出版物シリーズ

名前ICNIT 2010 - 2010 International Conference on Networking and Information Technology

Conference

Conference2010 International Conference on Networking and Information Technology, ICNIT 2010
国/地域Philippines
CityManila
Period10/6/1110/6/12

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「SPIDERS: Swift prime implicant derivation through exhaustive rotation and sort」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル