A REDUCED OFFSET BASED METHOD FOR FAST COMPUTATION OF THE PRIME IMPLICANTS COVERING A GIVEN CUBE
Küçük Resim Yok
Tarih
2012
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ICIC INTERNATIONAL
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In order to generate prime implicants for a cube of a logic function, most logic minimization methods expand this cube by one at a time removing the literals from it. However, there is an intractable problem of determining the order of literals to be removed from the cube and checking whether a tentative literal removal is acceptable. In order to avoid this problem, the reduced offset method was developed. This method uses the positional-cube notation where every reduced off-cube of an n-variable function is represented by two n-bit strings. However, unfortunately, the conversion of such reduced cubes to the associated prime implicants has the time complexity worse than exponential. To avoid this problem, in this study, the method representing every reduced cube by a single n-bit string and a set of bitwise operations to be performed on such strings are proposed. The theoretical and experimental estimations show that this approach can significantly improve the quality of results and reduce the space and time complexities of the logic minimization process 2 times and up to 3.5 times, respectively.
Açıklama
Anahtar Kelimeler
Logic minimization, Prime implicant, Reduced offset, Cube notation
Kaynak
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL
WoS Q Değeri
N/A
Scopus Q Değeri
Q3
Cilt
8
Sayı
6
