{"id":"https://openalex.org/W4206737727","doi":"https://doi.org/10.23919/eusipco54536.2021.9616225","title":"Lifting-based Alternatives to the FFT for Computing the 4-, 8-, and 16-point Discrete Fourier Transforms","display_name":"Lifting-based Alternatives to the FFT for Computing the 4-, 8-, and 16-point Discrete Fourier Transforms","publication_year":2021,"publication_date":"2021-08-23","ids":{"openalex":"https://openalex.org/W4206737727","doi":"https://doi.org/10.23919/eusipco54536.2021.9616225"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco54536.2021.9616225","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco54536.2021.9616225","pdf_url":null,"source":{"id":"https://openalex.org/S4363607854","display_name":"2021 29th European Signal Processing Conference (EUSIPCO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th European Signal Processing Conference (EUSIPCO)","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/A5014665694","display_name":"Marek Parfieniuk","orcid":"https://orcid.org/0000-0002-4436-8849"},"institutions":[{"id":"https://openalex.org/I245364917","display_name":"University of Bia\u0142ystok","ror":"https://ror.org/01qaqcf60","country_code":"PL","type":"education","lineage":["https://openalex.org/I245364917"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Parfieniuk","raw_affiliation_strings":["Institute of Computer Science, University of Bialystok, Bialystok, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bialystok, Bialystok, Poland","institution_ids":["https://openalex.org/I245364917","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014665694"],"corresponding_institution_ids":["https://openalex.org/I245364917","https://openalex.org/I4210087266"],"apc_list":null,"apc_paid":null,"fwci":0.172,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42847549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2184","last_page":"2188"},"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.9994000196456909,"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.9994000196456909,"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/T10323","display_name":"Analog and Mixed-Signal Circuit Design","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9961000084877014,"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.734755277633667},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.7184478044509888},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.5932353734970093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5457950234413147},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5321126580238342},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.515784502029419},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.514956533908844},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.504245400428772},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4934948682785034},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45699378848075867},{"id":"https://openalex.org/keywords/dft-matrix","display_name":"DFT matrix","score":0.44992056488990784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43016862869262695},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4294450283050537},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4209510385990143},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.41344061493873596},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3759252727031708},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3411324620246887},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.3031875491142273},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.19812312722206116},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.18089765310287476},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1674935221672058},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.14476823806762695},{"id":"https://openalex.org/keywords/square-matrix","display_name":"Square matrix","score":0.12326738238334656}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.734755277633667},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.7184478044509888},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.5932353734970093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5457950234413147},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5321126580238342},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.515784502029419},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.514956533908844},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.504245400428772},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4934948682785034},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45699378848075867},{"id":"https://openalex.org/C103945485","wikidata":"https://www.wikidata.org/wiki/Q5204933","display_name":"DFT matrix","level":5,"score":0.44992056488990784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43016862869262695},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4294450283050537},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4209510385990143},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.41344061493873596},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3759252727031708},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3411324620246887},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.3031875491142273},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.19812312722206116},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.18089765310287476},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1674935221672058},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.14476823806762695},{"id":"https://openalex.org/C69044650","wikidata":"https://www.wikidata.org/wiki/Q2739329","display_name":"Square matrix","level":4,"score":0.12326738238334656},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/eusipco54536.2021.9616225","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco54536.2021.9616225","pdf_url":null,"source":{"id":"https://openalex.org/S4363607854","display_name":"2021 29th European Signal Processing Conference (EUSIPCO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2062610407","https://openalex.org/W2084466783","https://openalex.org/W2091477520","https://openalex.org/W2117188745","https://openalex.org/W2128016371","https://openalex.org/W2135031801","https://openalex.org/W2145890086","https://openalex.org/W2163083927","https://openalex.org/W2523354626","https://openalex.org/W2943838215","https://openalex.org/W2981534867","https://openalex.org/W3147354744"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W1984254719","https://openalex.org/W2149121524","https://openalex.org/W2028911956","https://openalex.org/W2134128809","https://openalex.org/W1974963296","https://openalex.org/W1952542430","https://openalex.org/W2031515099","https://openalex.org/W2034310980","https://openalex.org/W2161738160"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,47,98],"novel":[4],"approach":[5],"to":[6,107,142,160],"efficiently":[7],"compute":[8],"the":[9,16,37,54,59,64,70,134,162],"4-,":[10],"8-,":[11],"and":[12,28,66,85,90,109,174],"16-point":[13],"variants":[14],"of":[15,30,36,52,69,81,95,100,136,138,147,171,176],"Discrete":[17],"Fourier":[18],"Transform":[19],"(DFT).":[20],"Our":[21],"solution":[22],"requires":[23],"as":[24,33,112,130,166],"many":[25],"(non-trivial)":[26],"multiplications":[27,126,144],"additions":[29],"real":[31,65],"numbers":[32],"fast":[34],"algorithms":[35],"<tex":[38],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbf{FFT}$</tex>":[40],"family.":[41],"However,":[42],"we":[43,61],"saved":[44],"operations":[45],"in":[46,113,123,133,164],"completely":[48],"different":[49],"way.":[50],"Instead":[51],"factorizing":[53],"complex":[55],"matrix":[56],"that":[57],"describes":[58],"transform,":[60],"consider":[62],"separately":[63],"imaginary":[67],"parts":[68,74],"DFT":[71,163],"matrix.":[72],"Both":[73],"are":[75,88,127],"rank-deficient":[76],"matrices,":[77],"which":[78,124,149],"contain":[79],"pairs":[80],"linearly":[82],"dependent":[83],"rows":[84,108],"columns,":[86,110],"but":[87],"structured":[89],"symmetric.":[91],"We":[92],"factorize":[93],"each":[94],"them":[96],"into":[97],"product":[99],"sparse":[101],"matrices":[102],"by":[103,145,153],"applying":[104],"shear":[105],"transforms":[106],"similarly":[111],"two-side":[114],"diagonalization.":[115],"The":[116],"obtainable":[117],"factorizations":[118],"describe":[119],"data":[120],"flow":[121],"graphs":[122],"non-trivial":[125],"well":[128],"grouped,":[129],"they":[131,167],"occur":[132],"midst":[135],"sequences":[137],"lifting":[139],"steps":[140],"related":[141],"trivial":[143],"powers":[146],"2,":[148],"can":[150],"be":[151,158],"implemented":[152],"bit-shifting.":[154],"Such":[155],"schemes":[156],"could":[157],"used":[159],"implement":[161],"hardware,":[165],"offer":[168],"alternative":[169],"possibilities":[170],"modularization,":[172],"pipelining,":[173],"folding":[175],"digital":[177],"circuits.":[178]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}