Algorithm for choosing the optimal set of configurable self-timed logic gates

Бесплатный доступ

The article describes the developed algorithm for choosing the optimal set of new configurable strictly self-timed (SST) logic elements, which takes into account complex characteristics, such as: the number of transistors, area, time delay and power consumption. The following proposed universal logic elements are considered as options as part of a configurable logic block of programmable logic integrated circuits (FPGAs): SST function generator based on standard logic elements of the uncommitted logic array - ULA, SST function generator based on universal logic element of programmable logic integrated circuits - FPGA (LUT-ST), SST generator of function systems based on the decoding of the water set DC LUT-ST and SST equivalent of a programmable logic matrix - PLM (DNF-LUT-ST).

Еще

Self-timed circuits, ula, pld, complexity

Короткий адрес: https://sciup.org/147246577

IDR: 147246577   |   DOI: 10.17072/1993-0550-2020-3-85-90

Статья научная