Skip Navigation


The Computer Journal Advance Access originally published online on May 13, 2005
The Computer Journal 2005 48(4):443-450; doi:10.1093/comjnl/bxh099
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
48/4/443    most recent
bxh099v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chattopadhyay, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Area Conscious State Assignment with Flip-Flop and Output Polarity Selection for Finite State Machine Synthesis—A Genetic Algorithm Approach

Santanu Chattopadhyay *

Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, India

This paper presents a genetic algorithm (GA)-based approach for the synthesis of a finite state machine (FSM). Three aspects—state assignment, choice of polarity for the state bits and the polarities of the primary outputs—significantly affect the cost of the combinational logic synthesized for an FSM. Thus, the problems of state assignment, flip-flop polarity selection and output polarity selection have been integrated into a single genetic algorithmic formulation. The experiments performed on a large suite of benchmarks have established the fact that this tool outperforms the existing two-level state assignment algorithms. The quality of the solution obtained and the high rate of convergence have established the effectiveness of the GA in solving this difficult problem.

Received 3 June 2004. revised 17 February 2005.

* Email: santanu{at}ece.iitkgp.ernet.in; c_santanu{at}postmark.net


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.