๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

High-level synthesis using a genetic algorithm

โœ Scribed by Kenji Ohmori

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
186 KB
Volume
83
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper proposes high-level synthesis using a genetic algorithm that can realize register transfer level circuits from behavioral descriptions. Until now this type of synthesis problem has been separated into scheduling and allocation problems, and the two problems have been solved separately. This procedure has a difficulty that the process may easily fall into a local solution.This paper proposes a simultaneous solution of those problems, so that a circuit better than in the conventional algorithm can be synthesized. The proposed approach, on the other hand, has the disadvantage that the computation time tends to be longer, since the length of the chromosome is increased. To avoid this difficulty, several measures are used such as modification of a faulty gene and discrimination among circuits requiring the same number of resources. A result better than in the conventional approach is obtained for the benchmark problem.

๐Ÿ“œ SIMILAR VOLUMES

Protein structure alignment using a gene
Protein structure alignment using a genetic algorithm
โœ Joseph D. Szustakowski; Zhiping Weng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 342 KB ๐Ÿ‘ 2 views

We have developed a novel, fully automatic method for aligning the three-dimensional structures of two proteins. The basic approach is to first align the proteins' secondary structure elements and then extend the alignment to include any equivalent residues found in loops or turns. The initial secon

Project scheduling using a genetic algor
Project scheduling using a genetic algorithm with adaptable changing genetic operators
โœ Tomoya Ikeuchi; Yoshitomo Ikkai; Dai Araki; Takenao Ohkawa; Norihisa Komoda ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 1 views

Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa

Solving a timetabling problem using hybr
Solving a timetabling problem using hybrid genetic algorithms
โœ Lars Vestergaard Kragelund ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 179 KB ๐Ÿ‘ 1 views

All over the world, human resources are used on all kinds of different scheduling problems, many of which are time-consuming and tedious. Scheduling tools are thus very welcome. This paper presents a research project, where Genetic Algorithms (GAs) are used as the basis for solving a timetabling pro

Synchronous machine parameters estimatio
Synchronous machine parameters estimation using a new genetic-based algorithm
โœ Khaled M. El-Naggar; Hosam K. M. Youssef ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 103 KB ๐Ÿ‘ 1 views

A new genetic-based algorithm (GA) for estimating synchronous machine parameters from frequency tests is presented in this paper. GAs are general search techniques based on biological concepts and are very suitable for solving optimization problems. The proposed method uses a set of digital measurem