{"id":"https://openalex.org/W1862669548","doi":"https://doi.org/10.1109/icassp.1979.1170655","title":"Parallelism in the computation of the FFT and the WFTA","display_name":"Parallelism in the computation of the FFT and the WFTA","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1862669548","doi":"https://doi.org/10.1109/icassp.1979.1170655","mag":"1862669548"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1979.1170655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1979.1170655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '79. IEEE International Conference on Acoustics, Speech, and Signal Processing","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/A5047458648","display_name":"H. Nawab","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. Nawab","raw_affiliation_strings":["Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006151039","display_name":"James H. McClellan","orcid":"https://orcid.org/0000-0003-0647-9561"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. McClellan","raw_affiliation_strings":["Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047458648"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08274789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"514","last_page":"517"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9941999912261963,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8781222105026245},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.6817135214805603},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6523329019546509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6471329927444458},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6343338489532471},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6304007768630981},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5923716425895691},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5816883444786072},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.5308201313018799},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4456784427165985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3999128043651581},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.2983977496623993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.293035089969635},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1494511067867279},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.07939919829368591},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07254639267921448}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8781222105026245},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.6817135214805603},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6523329019546509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6471329927444458},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6343338489532471},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6304007768630981},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5923716425895691},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5816883444786072},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.5308201313018799},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4456784427165985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3999128043651581},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.2983977496623993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.293035089969635},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1494511067867279},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.07939919829368591},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07254639267921448},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1979.1170655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1979.1170655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '79. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1976381392","https://openalex.org/W1978231058","https://openalex.org/W2059342205","https://openalex.org/W2096207106","https://openalex.org/W2138906987","https://openalex.org/W2585466556","https://openalex.org/W2748015633"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2977460836","https://openalex.org/W2356814585","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W1984254719","https://openalex.org/W2185259940","https://openalex.org/W2012363129","https://openalex.org/W2144032791"],"abstract_inverted_index":{"Arithmetic":[0],"concurrencies,":[1],"such":[2],"as":[3,43],"those":[4],"found":[5],"in":[6,54,68],"special-purpose":[7],"fast":[8],"Fourier":[9,25],"transform":[10,26],"(FFT)":[11],"hard-ware,":[12],"are":[13,19,32],"surveyed":[14],"and":[15,39],"categorized.":[16],"Similar":[17],"structures":[18],"then":[20],"derived":[21],"for":[22,34],"the":[23,35,40,47,60,65],"Winograd":[24],"algorithm":[27],"(WFTA).":[28],"Relative":[29],"time-efficiency":[30],"plots":[31],"obtained":[33],"1024-point":[36],"radix-4":[37],"FFT":[38],"1008-point":[41],"WFTA":[42],"a":[44],"function":[45],"of":[46,49,64],"number":[48],"real":[50],"arithmetic":[51,77],"operations":[52],"executable":[53],"parallel.":[55],"This":[56],"comparison":[57],"shows":[58],"that":[59],"relative":[61],"time":[62],"efficiency":[63],"two":[66],"algorithms":[67],"sequential":[69],"computations":[70],"generally":[71],"carries":[72],"over":[73],"to":[74],"cases":[75],"where":[76],"parallelism":[78],"is":[79],"exploited.":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}