{"id":"https://openalex.org/W1982912928","doi":"https://doi.org/10.1109/tc.1983.1676281","title":"Time-Space Tradeoffs on Back-to-Back FFT Algorithms","display_name":"Time-Space Tradeoffs on Back-to-Back FFT Algorithms","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W1982912928","doi":"https://doi.org/10.1109/tc.1983.1676281","mag":"1982912928"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1983.1676281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676281","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5107147528","display_name":"Carlson","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Carlson","raw_affiliation_strings":["Department Electrical and Computer Engineering, University of Massachusetts, Amherst, MA, USA","Department Electrical and Computer Science, Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Department Electrical and Computer Engineering, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Department Electrical and Computer Science, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5107147528"],"corresponding_institution_ids":["https://openalex.org/I24603500","https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10969277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"C-32","issue":"6","first_page":"585","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8194941878318787},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7341993451118469},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6563653945922852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6001476049423218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5411055088043213},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5373133420944214},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.48993510007858276},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4732551872730255},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45723968744277954},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4555571675300598},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.43412038683891296},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4285353422164917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3877415060997009},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.37877345085144043},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.2817455530166626},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.22447851300239563},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1434275209903717}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8194941878318787},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7341993451118469},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6563653945922852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6001476049423218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5411055088043213},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5373133420944214},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.48993510007858276},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4732551872730255},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45723968744277954},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4555571675300598},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.43412038683891296},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4285353422164917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3877415060997009},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.37877345085144043},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.2817455530166626},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.22447851300239563},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1434275209903717},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1983.1676281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676281","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/W1530008367","https://openalex.org/W1976284552","https://openalex.org/W2011849452","https://openalex.org/W2031569058","https://openalex.org/W2035081987","https://openalex.org/W2045064738","https://openalex.org/W2066947547","https://openalex.org/W2119106791","https://openalex.org/W2134224523","https://openalex.org/W2134316164","https://openalex.org/W2341677999","https://openalex.org/W2532640196","https://openalex.org/W2751862591","https://openalex.org/W2911480877","https://openalex.org/W4301441647","https://openalex.org/W6757921438"],"related_works":["https://openalex.org/W2149121524","https://openalex.org/W2144412928","https://openalex.org/W2554524608","https://openalex.org/W2977460836","https://openalex.org/W4362564158","https://openalex.org/W2113951268","https://openalex.org/W2031343199","https://openalex.org/W1984254719","https://openalex.org/W2076787260","https://openalex.org/W3046688035"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"the":[3,36,45],"performance":[4],"of":[5,8,38,44,60,66],"back-to-back":[6,56,68],"applications":[7,65],"a":[9,22,30,67],"fast":[10],"Fourier":[11],"transform":[12],"algorithm":[13],"with":[14],"respect":[15],"to":[16],"computational":[17],"time":[18,39],"and":[19,40,75],"space.":[20],"Using":[21],"well-known":[23],"pebble":[24],"game":[25],"as":[26,72],"an":[27,54],"analysis":[28],"technique,":[29],"lower":[31,62],"bound":[32,63],"is":[33,43],"derived":[34],"on":[35,64],"product":[37],"space,":[41],"which":[42],"form":[46],"T":[47],"\u00b7":[48],"S":[49],"=":[50],"\u03a9(n2":[51],"log2n)":[52],"for":[53],"n-input":[55],"FFT.":[57],"The":[58],"implications":[59],"this":[61],"FFT":[69],"circuit,":[70],"such":[71],"polynomial":[73],"multiplication":[74],"permutation":[76],"graphs,":[77],"are":[78],"also":[79],"discussed.":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}