{"id":"https://openalex.org/W2007201803","doi":"https://doi.org/10.1109/pccc.2014.7017080","title":"A novel algorithm for sparse FFT pruning and its applications to OFDMA technology","display_name":"A novel algorithm for sparse FFT pruning and its applications to OFDMA technology","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2007201803","doi":"https://doi.org/10.1109/pccc.2014.7017080","mag":"2007201803"},"language":"en","primary_location":{"id":"doi:10.1109/pccc.2014.7017080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2014.7017080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5075094341","display_name":"Shakeel S. Abdulla","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shakeel S. Abdulla","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","Department of Electrical and Computer Engineering, University of Texas Austin, TX 78712, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014061593","display_name":"Haewoon Nam","orcid":"https://orcid.org/0000-0001-9847-7023"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Haewoon Nam","raw_affiliation_strings":["Department of Electronics and Communication Engineering, Hanyang University, Ansan, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, Hanyang University, Ansan, South Korea","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068070739","display_name":"Jacob A. Abraham","orcid":"https://orcid.org/0000-0002-5336-5631"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacob A. Abraham","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","Department of Electrical and Computer Engineering, University of Texas Austin, TX 78712, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"7"},"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.9998999834060669,"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.9998999834060669,"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/T11873","display_name":"PAPR reduction in OFDM","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.90338134765625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7991328239440918},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6480727195739746},{"id":"https://openalex.org/keywords/baseband","display_name":"Baseband","score":0.6454193592071533},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.601632833480835},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.5943215489387512},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.584093451499939},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4999063014984131},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.4823269546031952},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.4689120054244995},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42044714093208313},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.20180004835128784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14098766446113586},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.12689915299415588},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09649896621704102}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.90338134765625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7991328239440918},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6480727195739746},{"id":"https://openalex.org/C65165936","wikidata":"https://www.wikidata.org/wiki/Q575784","display_name":"Baseband","level":3,"score":0.6454193592071533},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.601632833480835},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.5943215489387512},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.584093451499939},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4999063014984131},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4823269546031952},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.4689120054244995},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42044714093208313},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.20180004835128784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14098766446113586},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.12689915299415588},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09649896621704102},{"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","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/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pccc.2014.7017080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2014.7017080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hanyang.ac.kr:20.500.11754/79370","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/7017080/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401328","display_name":"The Royal Society of Chemistry\u2019s Journals, Books and Databases (The Royal Society of Chemistry)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2751430930","host_organization_name":"Royal Society of Chemistry","host_organization_lineage":["https://openalex.org/I2751430930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1486092146","https://openalex.org/W1588000377","https://openalex.org/W2010351709","https://openalex.org/W2015346536","https://openalex.org/W2061171222","https://openalex.org/W2094766145","https://openalex.org/W2103310688","https://openalex.org/W2111755292","https://openalex.org/W2154410416","https://openalex.org/W2154543331","https://openalex.org/W2296520333","https://openalex.org/W2539811224","https://openalex.org/W6665874098","https://openalex.org/W6729279412"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2977460836","https://openalex.org/W2356814585","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W4246835537","https://openalex.org/W1984254719","https://openalex.org/W2144032791","https://openalex.org/W2185259940"],"abstract_inverted_index":{"This":[0,56,80],"paper":[1,57],"proposes":[2],"novel":[3],"DIF":[4],"and":[5,53,66,91],"DIT,":[6],"FFT":[7,38,89],"algorithms":[8],"that":[9,33],"utilizes":[10],"data":[11],"sparsity":[12,25,111],"information":[13,112],"to":[14,36,73,102],"acheive":[15],"sub-optimal":[16],"computational":[17,64],"complexity":[18,65],"over":[19],"traditional":[20],"radix-2":[21],"FFT.":[22],"Using":[23],"the":[24,30,37,44,48,60,63,110],"information,":[26],"a":[27],"map":[28,52],"of":[29,47,62,77],"relavant":[31],"nodes":[32],"would":[34,100],"contribute":[35],"sum":[39],"is":[40,82],"first":[41],"derived.":[42],"Then":[43],"second":[45],"part":[46],"algorithm":[49,81,105],"traverses":[50],"this":[51,104],"performs":[54],"computation.":[55],"also":[58],"provides":[59],"analysis":[61],"how":[67],"it":[68],"can":[69,113],"be":[70,101,114],"tied":[71],"in":[72,106,116],"existing":[74],"frame":[75],"work":[76],"OFDMA":[78,107],"baseband.":[79],"well":[83],"suited":[84],"for":[85,93],"hardware":[86],"efficient":[87],"in-place":[88],"computations":[90],"especially":[92],"large":[94],"size":[95],"FFTs.":[96],"The":[97],"best":[98],"application":[99],"use":[103],"basebands":[108],"where":[109],"known":[115],"advance.":[117]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}