{"id":"https://openalex.org/W1986504082","doi":"https://doi.org/10.1109/itw.2012.6404732","title":"On the additive complexity of the cyclotomic FFT algorithm","display_name":"On the additive complexity of the cyclotomic FFT algorithm","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W1986504082","doi":"https://doi.org/10.1109/itw.2012.6404732","mag":"1986504082"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2012.6404732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","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/A5016322127","display_name":"Peter Trifonov","orcid":"https://orcid.org/0000-0001-6960-0942"},"institutions":[{"id":"https://openalex.org/I212220629","display_name":"Peter the Great St. Petersburg Polytechnic University","ror":"https://ror.org/02x91aj62","country_code":"RU","type":"education","lineage":["https://openalex.org/I212220629"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Peter Trifonov","raw_affiliation_strings":["Distributed Computing and Networking Department, Saint-Petersburg State Polytechnic University, Saint-Petersburg, Russia","Distributed Computing and Networking Department, Saint-Petersburg State Polytechnic University, Polytechnicheskaya str., 21, office 104, 194021, Russia"],"affiliations":[{"raw_affiliation_string":"Distributed Computing and Networking Department, Saint-Petersburg State Polytechnic University, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I212220629"]},{"raw_affiliation_string":"Distributed Computing and Networking Department, Saint-Petersburg State Polytechnic University, Polytechnicheskaya str., 21, office 104, 194021, Russia","institution_ids":["https://openalex.org/I212220629"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016322127"],"corresponding_institution_ids":["https://openalex.org/I212220629"],"apc_list":null,"apc_paid":null,"fwci":1.2844,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82430175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"537","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.996399998664856,"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/T11130","display_name":"Coding theory and cryptography","score":0.996399998664856,"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.9883999824523926,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8318025469779968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7065436840057373},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6891080737113953},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6839037537574768},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.6608827710151672},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.658719003200531},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5625001788139343},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5604598522186279},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5252670645713806},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5227765440940857},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5008828639984131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4919099807739258},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.4857242703437805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4646202325820923},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45060232281684875},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.4305408298969269},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.4271467924118042},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.2649635970592499},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.15415167808532715},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1013580858707428},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.08229735493659973}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8318025469779968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7065436840057373},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6891080737113953},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6839037537574768},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.6608827710151672},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.658719003200531},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5625001788139343},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5604598522186279},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5252670645713806},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5227765440940857},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5008828639984131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4919099807739258},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.4857242703437805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4646202325820923},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45060232281684875},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.4305408298969269},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.4271467924118042},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.2649635970592499},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.15415167808532715},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1013580858707428},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.08229735493659973},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"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/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2012.6404732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","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":15,"referenced_works":["https://openalex.org/W1528935082","https://openalex.org/W1562183207","https://openalex.org/W1593683169","https://openalex.org/W1655990431","https://openalex.org/W1796097737","https://openalex.org/W1980822076","https://openalex.org/W1992406028","https://openalex.org/W2030571394","https://openalex.org/W2040647299","https://openalex.org/W2114813128","https://openalex.org/W2124312471","https://openalex.org/W2154220188","https://openalex.org/W2169603504","https://openalex.org/W3100826625","https://openalex.org/W6948265142"],"related_works":["https://openalex.org/W2017578039","https://openalex.org/W2158015410","https://openalex.org/W333228003","https://openalex.org/W2134128809","https://openalex.org/W2016307700","https://openalex.org/W2203752361","https://openalex.org/W1974963296","https://openalex.org/W2081556720","https://openalex.org/W2082484042","https://openalex.org/W1952542430"],"abstract_inverted_index":{"The":[0,15,28,39,57],"problem":[1],"of":[2,5,21,47,71,80],"efficient":[3],"evaluation":[4],"the":[6,22,34,48,68,78],"discrete":[7],"Fourier":[8],"transform":[9],"over":[10],"finite":[11],"fields":[12],"is":[13,31,42],"considered.":[14],"techniques":[16],"for":[17,65],"additive":[18],"complexity":[19,79],"reduction":[20,37],"cyclotomic":[23],"FFT":[24],"algorithm":[25],"are":[26],"proposed.":[27],"first":[29],"one":[30,41],"based":[32,43],"on":[33,44],"classical":[35],"simultaneous":[36],"algorithm.":[38],"second":[40],"a":[45,52],"factorization":[46],"presummation":[49],"matrix":[50],"into":[51],"sparse":[53],"and":[54],"block-diagonal":[55],"ones.":[56],"proposed":[58],"methods":[59],"provide":[60],"smaller":[61],"asymptotic":[62],"complexity,":[63],"although":[64],"small-sized":[66],"problems":[67],"required":[69],"number":[70],"operations":[72],"appears":[73],"to":[74],"be":[75],"higher":[76],"than":[77],"computer-optimized":[81],"algorithms.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}