Article
minBool manual Minimization of Boolean function by the QuineMcCluskey method
 Citations (1)
 Cited In (0)

Conference Paper: Genetic algorithms  synthesis of finite state machines
[Show abstract] [Hide abstract]
ABSTRACT: Genetic algorithms (GAs) are a stochastic, nonderivative optimization method. They use populations of acceptable solutions (genes) of the given problem, which evolve toward optimum. The paper introduces GAs as a method for the synthesis of the activation function of flipflops in finite state machines. The genes in standard GAs are Boolean vectors. When JK and RS flipflops are used in the synthesis of finite state machines, there are undefined variables in the activation signals. When the finite state machine is of high order, the QuineMcClusky method is used, which requires exact values of the variables. At this stage, the GAs are used to find the optimal set of variables, in terms of simplifying the description.Electronics Technology: Meeting the Challenges of Electronics Technology Progress, 2004. 27th International Spring Seminar on; 06/2004
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.