{"id":"https://openalex.org/W2003790405","doi":"https://doi.org/10.1016/s0167-8191(03)00039-5","title":"A parallel 1-D FFT algorithm for the Hitachi SR8000","display_name":"A parallel 1-D FFT algorithm for the Hitachi SR8000","publication_year":2003,"publication_date":"2003-04-07","ids":{"openalex":"https://openalex.org/W2003790405","doi":"https://doi.org/10.1016/s0167-8191(03)00039-5","mag":"2003790405"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-8191(03)00039-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-8191(03)00039-5","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","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/A5100710410","display_name":"Daisuke Takahashi","orcid":"https://orcid.org/0000-0003-1357-5770"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Daisuke Takahashi","raw_affiliation_strings":["Institute of Information Sciences and Electronics, University of Tsukuba, 1-1-1 Tennodai, Tsukuba-shi, Ibaraki 305-8573, Japan","Institute of Information Sciences and Electronics, University of Tsukuba 1-1-1 Tennodai, Tsukuba-shi, Ibaraki 305-8573, Japan"],"affiliations":[{"raw_affiliation_string":"Institute of Information Sciences and Electronics, University of Tsukuba, 1-1-1 Tennodai, Tsukuba-shi, Ibaraki 305-8573, Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"Institute of Information Sciences and Electronics, University of Tsukuba 1-1-1 Tennodai, Tsukuba-shi, Ibaraki 305-8573, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100710410"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":{"value":2680,"currency":"USD","value_usd":2680},"apc_paid":null,"fwci":1.2819,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.80572246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"6","first_page":"679","last_page":"690"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9972000122070312,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9352503418922424},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.7559685707092285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7412624955177307},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7357649803161621},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6988192200660706},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.6476424336433411},{"id":"https://openalex.org/keywords/flops","display_name":"FLOPS","score":0.6429256200790405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5476587414741516},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5299174785614014},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.49761655926704407},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.45806530117988586},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4548493027687073},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.18080878257751465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17124557495117188},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.11814743280410767}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9352503418922424},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.7559685707092285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7412624955177307},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7357649803161621},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6988192200660706},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.6476424336433411},{"id":"https://openalex.org/C3826847","wikidata":"https://www.wikidata.org/wiki/Q188768","display_name":"FLOPS","level":2,"score":0.6429256200790405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5476587414741516},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5299174785614014},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.49761655926704407},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.45806530117988586},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4548493027687073},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.18080878257751465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17124557495117188},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.11814743280410767},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"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.1016/s0167-8191(03)00039-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-8191(03)00039-5","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.5400000214576721,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1492033360","https://openalex.org/W1631114303","https://openalex.org/W1979502974","https://openalex.org/W2019203901","https://openalex.org/W2037026538","https://openalex.org/W2038285282","https://openalex.org/W2041456897","https://openalex.org/W2045836768","https://openalex.org/W2058645184","https://openalex.org/W2061171222","https://openalex.org/W2072597538","https://openalex.org/W2100831835","https://openalex.org/W2127391977","https://openalex.org/W2134572726","https://openalex.org/W2144412928","https://openalex.org/W4256206162","https://openalex.org/W6811683824"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2149121524","https://openalex.org/W2031343199","https://openalex.org/W2144412928","https://openalex.org/W2047042807","https://openalex.org/W2371538653","https://openalex.org/W2042527476","https://openalex.org/W4255785774","https://openalex.org/W2977460836","https://openalex.org/W2061302196"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}