{"id":"https://openalex.org/W2005142275","doi":"https://doi.org/10.1049/ip-cdt:20010666","title":"Low power state assignment and flipflop selection for finite state machine synthesis\u2014a genetic algorithmic approach","display_name":"Low power state assignment and flipflop selection for finite state machine synthesis\u2014a genetic algorithmic approach","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2005142275","doi":"https://doi.org/10.1049/ip-cdt:20010666","mag":"2005142275"},"language":"en","primary_location":{"id":"doi:10.1049/ip-cdt:20010666","doi":"https://doi.org/10.1049/ip-cdt:20010666","is_oa":false,"landing_page_url":"https://doi.org/10.1049/ip-cdt:20010666","pdf_url":null,"source":{"id":"https://openalex.org/S4210175938","display_name":"IEE Proceedings - Computers and Digital Techniques","issn_l":"1350-2387","issn":["1350-2387","1359-7027"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEE Proceedings - Computers and Digital Techniques","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000580868","display_name":"Subhrendu Chattopadhyay","orcid":"https://orcid.org/0000-0003-1765-5444","observed_orcids":["https://orcid.org/0000-0003-1765-5444"]},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. Chattopadhyay","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology, , India","Department of Computer Science, and Engineering, Indian Institute of Technology Guwahati, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology, , India","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, and Engineering, Indian Institute of Technology Guwahati, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000580868"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":1.602,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.82461808,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"148","issue":"4","first_page":"147","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.4738999903202057,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.4738999903202057,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.4065000116825104,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.08839999884366989,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/finite-state-machine-synthesis","display_name":"finite state machine synthesis","score":0.9789999723434448},{"id":"https://openalex.org/keywords/state-assignment","display_name":"state assignment","score":0.9369999766349792},{"id":"https://openalex.org/keywords/low-power-design","display_name":"low power design","score":0.859000027179718},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8090000152587891},{"id":"https://openalex.org/keywords/energy-consumption-reduction","display_name":"energy consumption reduction","score":0.6679999828338623},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.5450000166893005}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5999313592910767},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5965279340744019},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5726240277290344},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5432243943214417},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5103461146354675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5050817131996155},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.47225016355514526},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4644451439380646},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.46160048246383667},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.45969831943511963},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45221462845802307},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.4146888852119446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3845396935939789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27185237407684326},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16993039846420288},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1049/ip-cdt:20010666","doi":"https://doi.org/10.1049/ip-cdt:20010666","is_oa":false,"landing_page_url":"https://doi.org/10.1049/ip-cdt:20010666","pdf_url":null,"source":{"id":"https://openalex.org/S4210175938","display_name":"IEE Proceedings - Computers and Digital Techniques","issn_l":"1350-2387","issn":["1350-2387","1359-7027"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEE Proceedings - Computers and Digital Techniques","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1511688816","https://openalex.org/W1578597091","https://openalex.org/W2106157873","https://openalex.org/W2116018641","https://openalex.org/W2148262721","https://openalex.org/W2893332016","https://openalex.org/W3131896285"],"related_works":["https://openalex.org/W2163460941","https://openalex.org/W2074844414","https://openalex.org/W2085447363","https://openalex.org/W2375514364","https://openalex.org/W2159490551","https://openalex.org/W1975029631","https://openalex.org/W2545214838","https://openalex.org/W2155491583","https://openalex.org/W1967489712","https://openalex.org/W2801506272"],"abstract_inverted_index":{"Current":[0],"renewed":[1],"emphasis":[2],"for":[3,40,44,204],"more":[4,126],"aggressive":[5],"logic":[6],"designs":[7],"with":[8,83,117,131],"lesser":[9],"area,":[10],"delay,":[11],"and":[12,59,136,163,172],"power":[13,52,89,127,156],"demands":[14],"exploration":[15],"of":[16,30,37,46,70,100,105,134,161,168,176,182,196],"alternative":[17],"avenues":[18],"that":[19,76,114],"could":[20],"lead":[21],"to":[22,143],"better":[23],"designs,":[24],"albeit":[25],"at":[26],"the":[27,35,74,98,115,121,129,144,149,169,173,180,183,193,200,206],"higher":[28],"cost":[29],"computation.":[31],"The":[32,103,166],"author":[33],"explores":[34],"avenue":[36],"genetic":[38,184,197],"algorithm":[39,150,185,198],"a":[41,67,132,159,209],"holistic":[42],"view":[43],"synthesis":[45],"finite":[47],"state":[48,57,81],"machine":[49],"(FSM)":[50],"targeting":[51],"reduction":[53,87],"by":[54,112],"incorporating":[55],"both":[56],"assignment":[58],"sequential":[60,122],"element":[61,123],"selection.":[62],"Exhaustive":[63],"experimentation":[64],"performed":[65],"on":[66,84],"large":[68],"suite":[69],"benchmarks":[71],"has":[72,109],"established":[73,179],"fact":[75],"this":[77,188],"tool":[78],"results":[79],"in":[80,88,97,147,186,208],"encodings":[82],"average":[85],"46.08%":[86],"requirement":[90],"over":[91],"NOVA,":[92],"without":[93],"any":[94],"significant":[95],"increase":[96],"number":[99],"product":[101],"terms.":[102],"effectiveness":[104,181],"judicious":[106],"flipflop":[107,138],"selection":[108],"been":[110],"demonstrated":[111],"showing":[113],"approach":[116,130],"all":[118],"D-flipflops":[119],"as":[120,141],"requires":[124,153],"33.78%":[125],"than":[128],"choice":[133],"D":[135,162],"T":[137,164],"types.":[139],"Moreover,":[140],"compared":[142],"technique":[145],"presented":[146,151],"LPSA,":[148],"here":[152],"38.96%":[154],"less":[155],"when":[157],"using":[158],"mix":[160],"flipflops.":[165],"quality":[167],"solution":[170],"obtained":[171],"high":[174],"rate":[175],"convergence":[177],"have":[178],"solving":[187,205],"particular":[189],"NP-complete":[190],"problem.":[191],"Further,":[192],"inherent":[194],"parallelism":[195],"makes":[199],"proposed":[201],"scheme":[202],"ideal":[203],"problem":[207],"multiprocessor":[210],"environment.":[211]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}
