{"id":"https://openalex.org/W2112153691","doi":"https://doi.org/10.3233/sat190084","title":"Generating and Searching Families of FFT Algorithms","display_name":"Generating and Searching Families of FFT Algorithms","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2112153691","doi":"https://doi.org/10.3233/sat190084","mag":"2112153691"},"language":"en","primary_location":{"id":"doi:10.3233/sat190084","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190084","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190084?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190084","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190084?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190084","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044324204","display_name":"Steve Haynal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steve Haynal","raw_affiliation_strings":["Research and Development, SofterHardware, College Place WA 99324, USA. E-mail:\u00a0steve@softerhardware.com","SofterHardware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research and Development, SofterHardware, College Place WA 99324, USA. E-mail:\u00a0steve@softerhardware.com","institution_ids":[]},{"raw_affiliation_string":"SofterHardware","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050232354","display_name":"Heidi Haynal","orcid":null},"institutions":[{"id":"https://openalex.org/I167046903","display_name":"Walla Walla University","ror":"https://ror.org/02x559v43","country_code":"US","type":"education","lineage":["https://openalex.org/I167046903"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Heidi Haynal","raw_affiliation_strings":["Department of Mathematics and Computer Science, Walla Walla University, College Place WA 99324, USA. E-mail:\u00a0heidi.haynal@wallawalla.edu","Walla Walla University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Walla Walla University, College Place WA 99324, USA. E-mail:\u00a0heidi.haynal@wallawalla.edu","institution_ids":["https://openalex.org/I167046903"]},{"raw_affiliation_string":"Walla Walla University","institution_ids":["https://openalex.org/I167046903"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1567809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"4","first_page":"145","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9977999925613403,"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.9977999925613403,"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/T10142","display_name":"Formal Methods in Verification","score":0.9919000267982483,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9876000285148621,"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.7839076519012451},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.698472261428833},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.6480538249015808},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5552173852920532},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5300276875495911},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.521609902381897},{"id":"https://openalex.org/keywords/power-of-two","display_name":"Power of two","score":0.486978143453598},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.45127102732658386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4506899118423462},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44168853759765625},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.43630585074424744},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4176546335220337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3783770203590393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3457869291305542},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.25662797689437866},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.15272659063339233},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.14011156558990479}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7839076519012451},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.698472261428833},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.6480538249015808},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552173852920532},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5300276875495911},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.521609902381897},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.486978143453598},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.45127102732658386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4506899118423462},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44168853759765625},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.43630585074424744},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4176546335220337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3783770203590393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3457869291305542},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.25662797689437866},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.15272659063339233},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.14011156558990479},{"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}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3233/sat190084","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190084","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190084?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190084","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1103.5740","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1103.5740","pdf_url":"https://arxiv.org/pdf/1103.5740","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2112153691","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1103.5740.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.7261","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.7261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume7/JSAT7_13_Haynal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.771.9254","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.771.9254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1103.5740.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1103.5740","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1103.5740","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.3233/sat190084","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190084","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190084?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190084","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2112153691.pdf","grobid_xml":"https://content.openalex.org/works/W2112153691.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W81665625","https://openalex.org/W92576581","https://openalex.org/W200555411","https://openalex.org/W216432568","https://openalex.org/W1484326688","https://openalex.org/W1487564550","https://openalex.org/W1498992687","https://openalex.org/W1517466399","https://openalex.org/W1548812055","https://openalex.org/W1553068379","https://openalex.org/W1579437898","https://openalex.org/W1926206757","https://openalex.org/W1989739006","https://openalex.org/W2000181170","https://openalex.org/W2002306823","https://openalex.org/W2022846948","https://openalex.org/W2036812077","https://openalex.org/W2048051309","https://openalex.org/W2049807270","https://openalex.org/W2057361103","https://openalex.org/W2061097805","https://openalex.org/W2061171222","https://openalex.org/W2091968063","https://openalex.org/W2095210125","https://openalex.org/W2105888199","https://openalex.org/W2106788917","https://openalex.org/W2110737535","https://openalex.org/W2115207428","https://openalex.org/W2116758077","https://openalex.org/W2123119012","https://openalex.org/W2125775646","https://openalex.org/W2135031801","https://openalex.org/W2142785340","https://openalex.org/W2145890086","https://openalex.org/W2154211329","https://openalex.org/W2168353136","https://openalex.org/W2168847677","https://openalex.org/W2169691387","https://openalex.org/W2916441570","https://openalex.org/W3164587034","https://openalex.org/W6629892034","https://openalex.org/W6659718218","https://openalex.org/W6664827099","https://openalex.org/W6673423232","https://openalex.org/W6676402990","https://openalex.org/W6682643679","https://openalex.org/W6814292443"],"related_works":["https://openalex.org/W1780286488","https://openalex.org/W2752686629","https://openalex.org/W1540185243","https://openalex.org/W2034514464","https://openalex.org/W24901277","https://openalex.org/W2232711356","https://openalex.org/W3107664768","https://openalex.org/W1608495767","https://openalex.org/W2502050660","https://openalex.org/W2092594959","https://openalex.org/W1591525908","https://openalex.org/W2056748176","https://openalex.org/W2186590034","https://openalex.org/W1508811963","https://openalex.org/W2067507719","https://openalex.org/W3118044975","https://openalex.org/W3038599687","https://openalex.org/W2521894912","https://openalex.org/W364413708","https://openalex.org/W2025086084"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"question":[2],"of":[3,14,92],"longstanding":[4],"theoretical":[5],"interest":[6],"is":[7],"to":[8,20,60,74],"prove":[9],"the":[10,31,35,62,75],"lowest":[11],"exact":[12],"count":[13,78],"real":[15,50],"additions":[16],"and":[17,56,70],"multiplications":[18],"required":[19],"compute":[21],"a":[22,53,95],"power-of-two":[23],"discrete":[24],"Fourier":[25],"transform":[26],"(DFT).":[27],"For":[28],"35":[29],"years":[30],"split-radix":[32,76],"algorithm":[33],"held":[34],"record":[36],"by":[37,67,79],"requiring":[38],"just":[39],"4n":[40],"log":[41],"2":[42],"n":[43,89],"-6n":[44],"+":[45],"8":[46],"arithmetic":[47],"operations":[48],"on":[49],"numbers":[51],"for":[52,94],"size-n":[54,96],"DFT,":[55],"was":[57],"widely":[58],"believed":[59],"be":[61],"best":[63],"possible.":[64],"Recent":[65],"work":[66],"Van":[68],"Buskirk":[69],"Lundy":[71],"demonstrated":[72],"improvements":[73],"operation":[77],"using":[80],"multiplier":[81],"coefficients":[82],"or":[83],"\"twiddle":[84],"factors\"":[85],"that":[86],"are":[87],"not":[88],"th":[90],"roots":[91],"unity":[93],"DFT.":[97]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}