{"id":"https://openalex.org/W2093444393","doi":"https://doi.org/10.1109/fpt.2007.4439257","title":"Improving Bounds for FPGA Logic Minimization","display_name":"Improving Bounds for FPGA Logic Minimization","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2093444393","doi":"https://doi.org/10.1109/fpt.2007.4439257","mag":"2093444393"},"language":"en","primary_location":{"id":"doi:10.1109/fpt.2007.4439257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2007.4439257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Field-Programmable Technology","raw_type":"proceedings-article"},"type":"article","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/A5071888207","display_name":"Tim Todman","orcid":"https://orcid.org/0000-0003-0524-0786"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Tim Todman","raw_affiliation_strings":["Department of Computing, Imperial College of Science Technology and Medicine, London, UK","Imperial College London, #N#London"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College of Science Technology and Medicine, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, #N#London","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073154481","display_name":"Haofan Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Haofan Fu","raw_affiliation_strings":["Department of Computing, Imperial College of Science Technology and Medicine, London, UK","Imperial College London, #N#London"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College of Science Technology and Medicine, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, #N#London","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083608463","display_name":"Oskar Mencer","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Oskar Mencer","raw_affiliation_strings":["Department of Computing, Imperial College of Science Technology and Medicine, London, UK","Imperial College London, #N#London"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College of Science Technology and Medicine, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, #N#London","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057940557","display_name":"Wayne Luk","orcid":"https://orcid.org/0000-0002-6750-927X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wayne Luk","raw_affiliation_strings":["Department of Computing, Imperial College of Science Technology and Medicine, London, UK","Imperial College London, #N#London"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College of Science Technology and Medicine, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, #N#London","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071888207"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.7025,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7388264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"248"},"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.9998000264167786,"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.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7018755078315735},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6214101314544678},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.5850560069084167},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.5114909410476685},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4977593719959259},{"id":"https://openalex.org/keywords/logic-optimization","display_name":"Logic optimization","score":0.49104857444763184},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.45035916566848755},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.44669482111930847},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4357033967971802},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.42152857780456543},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.4111522138118744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3902495801448822},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3793186545372009},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3676380515098572},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32445818185806274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23055684566497803},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10710787773132324}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7018755078315735},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6214101314544678},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.5850560069084167},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.5114909410476685},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4977593719959259},{"id":"https://openalex.org/C28449271","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Logic optimization","level":4,"score":0.49104857444763184},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.45035916566848755},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.44669482111930847},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4357033967971802},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.42152857780456543},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.4111522138118744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3902495801448822},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3793186545372009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3676380515098572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32445818185806274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23055684566497803},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10710787773132324},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpt.2007.4439257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2007.4439257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Field-Programmable Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1905608265","https://openalex.org/W1985457698","https://openalex.org/W2029948740","https://openalex.org/W2044110884","https://openalex.org/W2099134576","https://openalex.org/W2105715355","https://openalex.org/W2108089272","https://openalex.org/W2108508582","https://openalex.org/W2125803098","https://openalex.org/W2134060873","https://openalex.org/W2136858951","https://openalex.org/W2153905649","https://openalex.org/W2167328871","https://openalex.org/W2427843410","https://openalex.org/W6676083047","https://openalex.org/W6678753650"],"related_works":["https://openalex.org/W2386022279","https://openalex.org/W2101877870","https://openalex.org/W2499931839","https://openalex.org/W2110968362","https://openalex.org/W2053477566","https://openalex.org/W4390345338","https://openalex.org/W4238178324","https://openalex.org/W1939541994","https://openalex.org/W818963952","https://openalex.org/W2146663621"],"abstract_inverted_index":{"We":[0,36,96],"present":[1],"a":[2,38,57,72],"methodology":[3],"for":[4],"improving":[5],"the":[6,21,64,87,106,115],"bounds":[7],"of":[8,14,40,78,120],"combinational":[9],"designs":[10],"implemented":[11],"on":[12,63],"networks":[13],"lookup":[15],"tables,":[16],"moving":[17],"them":[18],"closer":[19],"to":[20,29,45,56,83,100,109,128,137],"theoretical":[22],"minimum.":[23],"Our":[24],"work":[25],"effectively":[26],"extends":[27],"optimality":[28,41,122],"span":[30],"logic":[31,98],"minimization":[32],"and":[33,50,81,85,90,113],"technology":[34],"mapping.":[35],"obtain":[37],"proof":[39],"by":[42],"restricting":[43],"ourselves":[44],"4-input":[46],"look-up":[47],"tables":[48],"(LUTs)":[49],"generating":[51],"all":[52],"possible":[53],"circuits":[54],"up":[55,102],"certain":[58],"area":[59],"or":[60],"latency":[61],"depending":[62],"optimization":[65],"mode.":[66],"Since":[67],"simple-minded":[68],"generation":[69],"would":[70],"take":[71],"long":[73],"time,":[74],"we":[75,125],"develop":[76],"levels":[77],"abstraction":[79],"(steps)":[80],"techniques":[82],"restrict":[84],"order":[86],"search":[88,112,116],"space,":[89],"produce":[91],"results":[92],"in":[93],"practical":[94],"time.":[95],"use":[97],"decomposition":[99],"break":[101],"large":[103],"designs,":[104],"using":[105],"resulting":[107],"trees":[108],"guide":[110],"our":[111],"prune":[114],"space.":[117],"The":[118],"price":[119],"this":[121],"is":[123],"that":[124],"are":[126],"limited":[127],"small":[129],"blocks;":[130],"however,":[131],"such":[132],"blocks":[133],"can":[134],"be":[135],"used":[136],"build":[138],"larger":[139],"designs.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}