62 research outputs found
Structural decomposition as a tool for the optimization of an FPGA-based implementation of a mealy FSM
FPGA-based implementing fsm for emc
The method of synthesis and implementation into FPGAs of Mealy FSMs is proposed. Synthesis is based on structural decomposition of initial circuit. FSM states are divided by classes and encoded separately in each class. The states are decoded in the second-level circuit. It leads to implementation of FSM in double-level structure where utilization of both, LUTs and embedded memory blocks, is applied. It leads to balanced usage of hardware resources of an FPGA de-vice. The method targets blocks for electromagnetic compatibility of radiotechnical devices
SC-based control architectures for EMC
Two new architectures are discussed which targets at implementing LUT-based circuits of control units. Each of them leads to different circuit of Mealy finite state machine. Depending on characteristics of an FSM, one of these approaches provides minimum LUT count. The methods target FSM providing control for electromagnetic compatibility of radiotechnical devices
Three approaches for orgaization of control units for EMC
Three new approaches are analysed targeting at implementing FPGA-based circuits of control units. Each of them leads to a unique architecture of a control unit. Depending on characteristics of a control unit, one of these approaches provides minimum hardware consumption. The methods target control blocks for electromagnetic compatibility of radiotechnical device
Hardware reduction for compositional microprogram control unit dedicated for CPLD systems
Use of control unit properties in CPLD systems
W artykule przedstawiono metodę syntezy mikroprogramowalnego układu sterującego z użyciem wbudowanych bloków pamięci, która jest ukierunkowana na zmniejszenie rozmiaru układu sterującego poprzez zastosowanie transformacji kodów klas pseudorównoważnych w pamięci. Podejście takie pozwala uzyskać uproszczoną formę funkcji przejścia części adresowej układu, dzięki któremu możliwa jest redukcja zasobów sprzętowych potrzebnych do implementacji jednostki sterującej w układach programowalnych typu CPLD bez zmniejszenia wydajności systemu cyfrowego.A method for decreasing the number of programmable array logic (PAL) macrocells in a logic circuit of the Moore finite-state-machine (FSM) is proposed. Programmable logic devices are nowadays widely used for implementation of control units (CU). The problem of CU optimization is still actual in computer science and its solution enables reduce the cost of the system. This method is based on use of free outputs of embedded memory blocks to represent the code of the class of pseudoequivalent states. The proposed approach allows minimizing the hardware without decreasing the digital system performance. An example of application of the proposed method is given. A control unit of any digital system can be implemented as the Moore FSM. Recent achievements in semiconductor technology have resulted in development of such sophisticated VLSI chips as field-programmable logic arrays (FPGA) and complex programmable logic devices (CPLD). Very often CPLD are used to implement complex controllers. In CPLD, logic functions are implemented using programmable array logic macrocells. One of the issues of the day is decrease in the number of PAL macrocells required for implementation of the FSM logic circuit. A proper state assignment can be used to solve this problem. The peculiarities of Moore FSM are existence of pseudoequivalent states and dependence of microoperations only on FSM internal states. The peculiarity of CPLD is a wide fan-in of PAL macrocell. It allows using different sources for representation of a current state code
Reduction of a microprogrammable Moore automaton logic circuit with encoding the sets of output variables
W artykule została przedstawiona metoda syntezy mikroprogramowanego automatu Moore'a implementowanego w układach nano-PLA. Metoda ta jest ukierunkowana na redukcję zasobów sprzętowych, potrzebnych do implementacji automatu Moore'a. Jest ona oparta na przedstawieniu następnego kodu stanu jako konkatenacji kodu klasy zbioru wyjściowych zmiennych i kodu wierzchołka. Takie podejście pozwala wyeliminować zależność między stanami i wyjściowymi zmiennymi, a także zmniejszyć liczbę linii w tabeli przejść automatu Moore'a do odpowiedniej liczby linii w równoważnym automacie Mealy’ego.The model of a microprogrammable Moore automaton is often used during the digital control systems realization [1 – 3]. The development of microelectronics has led to appearance of different programmable logic devices [7, 8] which are used for implementing micro-programmable automaton (MPA) logic circuits. One of the important problems of Moore MPA synthesis is the decrease of chip space occupied by the MPA logic circuit. The methods of solution of this problem depend strongly on logic elements used for implementing the MPA logic circuit [2 – 4]. In this paper we discuss the case when nanoelectronic programmable logic arrays (PLA) are used for implementing the Moore MPA logic circuit. The proposed method is based on representation of the next state code as a concatenation of code for the class of collection of output variables and code of the vertex (Fig. 2). In this method the classes of the pseudoequivalent states are used [1, 9]. Such an approach allows reducing the number of rows of the Moore MPA structure table up to the value of the equivalent Mealy MPA. As a result the area of the matrices generating input memory functions is optimized
- …
