Search from over 60,000 research works

Advanced Search

Systolic random number generation for genetic algorithms

Full text not archived in this repository.
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Bland, I. M. and Megson, G. M. (1996) Systolic random number generation for genetic algorithms. Electronics Letters, 32 (12). pp. 1069-1070. ISSN 0013-5194 doi: 10.1049/el:19960709

Abstract/Summary

A parallel hardware random number generator for use with a VLSI genetic algorithm processing device is proposed. The design uses an systolic array of mixed congruential random number generators. The generators are constantly reseeded with the outputs of the proceeding generators to avoid significant biasing of the randomness of the array which would result in longer times for the algorithm to converge to a solution. 1 Introduction In recent years there has been a growing interest in developing hardware genetic algorithm devices [1, 2, 3]. A genetic algorithm (GA) is a stochastic search and optimization technique which attempts to capture the power of natural selection by evolving a population of candidate solutions by a process of selection and reproduction [4]. In keeping with the evolutionary analogy, the solutions are called chromosomes with each chromosome containing a number of genes. Chromosomes are commonly simple binary strings, the bits being the genes.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/7450
Item Type Article
Refereed Yes
Divisions Science
Uncontrolled Keywords VLSI, genetic algorithms, random number generation systolic array, VLSI processing device, genetic algorithm, parallel hardware, random number generator
Publisher Institution of Engineering and Technology (IET)
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar