Presentation 2001/3/23
Automatic Synthesis of Multiple Constant Multiplication Circuits Using Genetic Algorithms
Yosuke ISOO, Hisamichi TOYOSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In multiple constant multiplication (MCM) computational complexity can be reduced by substitution of multiplications for shifts and additions. This circuit structure can be represented as a directed acyclic graph (DAG). However, synthesis of MCM so as to minimize computational complexity is known as an NP complete problem. Therefore, an effective tool for optimization of circuit synthesis is needed. In this paper, we propose an automatic synthesis method of MCM circuits by GA. The novel idea is that the chromosome to represent DAG is composed of stack type operators. As the chromosome is formed with a sequence of simple symbols, the similar method to a conventional GA can be employed.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Multiple constant multiplication circuit / Genetic algorithm / Stack type operator / Optimization of computational cost
Paper # CAS2000-132,DSP2000-190,CS2000-152
Date of Issue

Conference Information
Committee CS
Conference Date 2001/3/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Communication Systems (CS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Automatic Synthesis of Multiple Constant Multiplication Circuits Using Genetic Algorithms
Sub Title (in English)
Keyword(1) Multiple constant multiplication circuit
Keyword(2) Genetic algorithm
Keyword(3) Stack type operator
Keyword(4) Optimization of computational cost
1st Author's Name Yosuke ISOO
1st Author's Affiliation Faculty of Electrical Engineering, Kanagawa University()
2nd Author's Name Hisamichi TOYOSHIMA
2nd Author's Affiliation Faculty of Electrical Engineering, Kanagawa University
Date 2001/3/23
Paper # CAS2000-132,DSP2000-190,CS2000-152
Volume (vol) vol.100
Number (no) 722
Page pp.pp.-
#Pages 6
Date of Issue