{"id":"https://openalex.org/W2063328551","doi":"https://doi.org/10.1145/1993886.1993930","title":"Fast fourier transforms over poor fields","display_name":"Fast fourier transforms over poor fields","publication_year":2011,"publication_date":"2011-06-08","ids":{"openalex":"https://openalex.org/W2063328551","doi":"https://doi.org/10.1145/1993886.1993930","mag":"2063328551"},"language":"en","primary_location":{"id":"doi:10.1145/1993886.1993930","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993886.1993930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th international symposium on Symbolic and algebraic computation","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/A5011303374","display_name":"Alexey Pospelov","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexey Pospelov","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011303374"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11823807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"289","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9993000030517578,"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/T11435","display_name":"Polynomial and algebraic computation","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/T11130","display_name":"Coding theory and cryptography","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8928377032279968},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.8806446194648743},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.7956891059875488},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.6567354202270508},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5881734490394592},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5690618753433228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5470404028892517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543810248374939},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.5051587224006653},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4858364760875702},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.43387794494628906},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4214437007904053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3481701612472534},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.2714919447898865},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.1925230324268341},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.11514171957969666},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11170288920402527},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.10309264063835144}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8928377032279968},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.8806446194648743},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.7956891059875488},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.6567354202270508},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5881734490394592},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5690618753433228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5470404028892517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543810248374939},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.5051587224006653},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4858364760875702},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.43387794494628906},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4214437007904053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3481701612472534},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.2714919447898865},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.1925230324268341},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.11514171957969666},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11170288920402527},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.10309264063835144}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993886.1993930","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993886.1993930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W658467096","https://openalex.org/W1526245840","https://openalex.org/W1559375430","https://openalex.org/W1561337879","https://openalex.org/W1562183207","https://openalex.org/W1907666253","https://openalex.org/W1966904279","https://openalex.org/W1996933093","https://openalex.org/W2018850949","https://openalex.org/W2024577968","https://openalex.org/W2028444458","https://openalex.org/W2034013822","https://openalex.org/W2042527476","https://openalex.org/W2061171222","https://openalex.org/W2062604976","https://openalex.org/W2083368929","https://openalex.org/W2084801848","https://openalex.org/W2104070031","https://openalex.org/W2154220188","https://openalex.org/W2158359807","https://openalex.org/W2163717605","https://openalex.org/W2170835539","https://openalex.org/W2347133766","https://openalex.org/W2613956024","https://openalex.org/W2904838066","https://openalex.org/W4296980820","https://openalex.org/W4301223506"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2031343199","https://openalex.org/W2016307700","https://openalex.org/W2203752361","https://openalex.org/W2158015410","https://openalex.org/W2017578039","https://openalex.org/W333228003","https://openalex.org/W2134128809","https://openalex.org/W2081556720","https://openalex.org/W1952542430"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,33,50],"new":[3],"algebraic":[4,27],"algorithm":[5,48],"for":[6,44],"computing":[7],"the":[8,30,37,54,65],"discrete":[9],"Fourier":[10],"transform":[11],"over":[12],"arbitrary":[13],"fields.":[14],"It":[15],"computes":[16],"DFTs":[17],"of":[18,32,36,53,64],"infinitely":[19],"many":[20],"orders":[21],"n":[22],"in":[23],"O(n":[24],"log":[25],"n)":[26],"operations,":[28],"while":[29],"complexity":[31],"straightforward":[34],"application":[35],"known":[38],"FFT":[39,56],"algorithms":[40],"can":[41],"be":[42],"\u03a9(n1.5)":[43],"such":[45],"n.":[46],"Our":[47],"is":[49,59],"novel":[51],"combination":[52],"classical":[55],"algorithms,":[57],"and":[58],"never":[60],"slower":[61],"than":[62],"any":[63],"latter.":[66]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}