{"id":"https://openalex.org/W2110945399","doi":"https://doi.org/10.1109/arith.1985.6158934","title":"Algorithm partition for a fixed-size VLSI architecture using space-time domain expansion","display_name":"Algorithm partition for a fixed-size VLSI architecture using space-time domain expansion","publication_year":1985,"publication_date":"1985-06-01","ids":{"openalex":"https://openalex.org/W2110945399","doi":"https://doi.org/10.1109/arith.1985.6158934","mag":"2110945399"},"language":"en","primary_location":{"id":"doi:10.1109/arith.1985.6158934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.1985.6158934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1985 IEEE 7th Symposium on Computer Arithmetic (ARITH)","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/A5103519385","display_name":"H.D. Cheng","orcid":"https://orcid.org/0000-0001-7415-6030"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. D. Cheng","raw_affiliation_strings":["School of Electrical Engineering, Purdue University, West Lafayette, IN, USA","School of Electrical Engineering Purdue University West Lafayette, IN 47907"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical Engineering Purdue University West Lafayette, IN 47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101731463","display_name":"K. S. Fu","orcid":"https://orcid.org/0009-0008-6139-509X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. S. Fu","raw_affiliation_strings":["School of Electrical Engineering, Purdue University, West Lafayette, IN, USA","School of Electrical Engineering Purdue University West Lafayette, IN 47907"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical Engineering Purdue University West Lafayette, IN 47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103519385"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":6.2993,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.96632061,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"126","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.7016899585723877},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.668595016002655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.584605872631073},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5637171268463135},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5134152173995972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4986560344696045},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.453153133392334},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.437455952167511},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40439674258232117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3501301407814026},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14799126982688904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07371792197227478}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.7016899585723877},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.668595016002655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.584605872631073},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5637171268463135},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5134152173995972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4986560344696045},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.453153133392334},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.437455952167511},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40439674258232117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3501301407814026},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14799126982688904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07371792197227478},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/arith.1985.6158934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.1985.6158934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1985 IEEE 7th Symposium on Computer Arithmetic (ARITH)","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":12,"referenced_works":["https://openalex.org/W31792265","https://openalex.org/W114716186","https://openalex.org/W1556423202","https://openalex.org/W1666015432","https://openalex.org/W2017369466","https://openalex.org/W2026227831","https://openalex.org/W2034363187","https://openalex.org/W2054633003","https://openalex.org/W2062348801","https://openalex.org/W2104734478","https://openalex.org/W2171603032","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2359423766","https://openalex.org/W1600485007","https://openalex.org/W2364216866","https://openalex.org/W2362009423","https://openalex.org/W2614633957","https://openalex.org/W2391894074","https://openalex.org/W2070131906","https://openalex.org/W1546475804","https://openalex.org/W2365750584","https://openalex.org/W2172176943"],"abstract_inverted_index":{"The":[0],"space-time":[1,77],"domain":[2,78],"expansion":[3,79],"method":[4,34,80],"has":[5],"recently":[6],"been":[7],"used":[8,67,125],"to":[9,24,47,68,75,126],"transform":[10],"a":[11,15,19,49,56,60],"computational":[12,57],"task":[13],"with":[14],"recursive":[16,71],"formula":[17],"into":[18],"VLSI":[20,52,88],"architecture.":[21,53],"In":[22],"addition":[23],"its":[25],"simplicity":[26],"and":[27,59,107,120],"completeness,":[28],"an":[29,45],"important":[30],"advantage":[31],"of":[32,43,114],"this":[33],"is":[35],"that":[36],"it":[37,82],"can":[38,64,83],"easily":[39,66],"solve":[40],"the":[41,76,128],"problem":[42,73],"partitioning":[44],"algorithm":[46],"fit":[48],"fixed":[50],"size":[51],"We":[54],"propose":[55],"model":[58],"partition":[61,69],"rule":[62],"which":[63],"be":[65,84],"any":[70],"computation":[72],"suited":[74],"so":[81],"solved":[85],"on":[86],"fixed-size":[87],"architectures.":[89],"Several":[90],"examples,":[91],"such":[92],"as":[93],"partitioned":[94,98,104,108],"vector":[95],"inner":[96],"product,":[97],"comparators":[99],"in":[100],"relational":[101],"database":[102],"management,":[103],"matrix":[105],"multiplications,":[106],"transitive":[109],"closure":[110],"computation,":[111],"parallel":[112],"recognition":[113],"general":[115],"context-free":[116],"languages,":[117],"string":[118],"matching":[119],"dynamic":[121],"time-warp":[122],"pattern-matching":[123],"are":[124],"illustrate":[127],"proposed":[129],"method.":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}