Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

1 Bulletin of the Polish Academy of Sciences. Technical Sciences

1 2006

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: complex programmable logic devices (CPLD)

Sortuj według:

Ogranicz wyniki do:

FSMs state encoding targeting at logic level minimization

100%

Czerwiński R. , Kania D. , Kulisz J.

tom Vol. 54, nr 4

479-487

The paper concerns the problem of stale assignment for finite stale machines (FSM), tar-geting at PAL-based CPLDs implementations. Presented in the paper approach is dedicated to stale encoding of fast automata. The main idea is to determine the number of logic levels of the transition function before the stale encoding process, and keep the constraints during the process. The number of implicants of every single transition function must be known while assigning states, so elements of two level minimization based on Primary and Secondary Merging Conditions are implemented in the algorithm. The method is based on code length extraction if necessary. In one of the most basic stages of the logic synthesis of sequential devices, the elements referring to constraints of PAL-based CPLDs are taken into account.

FSMs state encoding targeting at logic level minimization

75%

Czerwiński R. , Kania D. , Kulisz J.

nr 4