{"id":"https://openalex.org/W2010351709","doi":"https://doi.org/10.1109/dasip.2011.6136869","title":"Efficient FFT pruning algorithm for non-contiguous OFDM systems","display_name":"Efficient FFT pruning algorithm for non-contiguous OFDM systems","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2010351709","doi":"https://doi.org/10.1109/dasip.2011.6136869","mag":"2010351709"},"language":"en","primary_location":{"id":"doi:10.1109/dasip.2011.6136869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasip.2011.6136869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 Conference on Design & Architectures for Signal & Image Processing (DASIP)","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/A5049758849","display_name":"Roberto Airoldi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Roberto Airoldi","raw_affiliation_strings":["Department of Computer Systems, Tampere University of Technology, Tampere, Finland","Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]},{"raw_affiliation_string":"Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056978552","display_name":"Fabio Garzia","orcid":"https://orcid.org/0000-0003-2597-4429"},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Fabio Garzia","raw_affiliation_strings":["Department of Computer Systems, Tampere University of Technology, Tampere, Finland","Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]},{"raw_affiliation_string":"Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035297149","display_name":"Jari Nurmi","orcid":"https://orcid.org/0000-0003-2169-4606"},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jari Nurmi","raw_affiliation_strings":["Department of Computer Systems, Tampere University of Technology, Tampere, Finland","Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]},{"raw_affiliation_string":"Tampere University of Technology, Department of Computer Systems, P.O. Box 553, FIN-33101, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049758849"],"corresponding_institution_ids":["https://openalex.org/I4210133110"],"apc_list":null,"apc_paid":null,"fwci":0.5299,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69157713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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/T10232","display_name":"Optical Network Technologies","score":0.9998000264167786,"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/T11873","display_name":"PAPR reduction in OFDM","score":0.9997000098228455,"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.9034645557403564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7803082466125488},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7500161528587341},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5616179704666138},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.5227596759796143},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.5022006034851074},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.4753831624984741},{"id":"https://openalex.org/keywords/subcarrier","display_name":"Subcarrier","score":0.4715965688228607},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4446464776992798},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41695940494537354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13646167516708374},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.07926532626152039},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06954720616340637}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9034645557403564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7803082466125488},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7500161528587341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5616179704666138},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.5227596759796143},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.5022006034851074},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.4753831624984741},{"id":"https://openalex.org/C198329298","wikidata":"https://www.wikidata.org/wiki/Q586358","display_name":"Subcarrier","level":4,"score":0.4715965688228607},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4446464776992798},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41695940494537354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13646167516708374},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.07926532626152039},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06954720616340637},{"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/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dasip.2011.6136869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasip.2011.6136869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 Conference on Design & Architectures for Signal & Image Processing (DASIP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322426","display_name":"Nokia Foundation","ror":"https://ror.org/0401nzk46"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1562922353","https://openalex.org/W2048272888","https://openalex.org/W2061171222","https://openalex.org/W2090690379","https://openalex.org/W2103310688","https://openalex.org/W2139851586","https://openalex.org/W2153620960","https://openalex.org/W2154543331","https://openalex.org/W2168078104","https://openalex.org/W2296520333","https://openalex.org/W2542473914"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2977460836","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W1984254719","https://openalex.org/W2185259940","https://openalex.org/W2012363129","https://openalex.org/W2144032791"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,15,31,46,58,66,101,106,123,127,138],"study":[4],"of":[5,17,37,48,57,96,109,137],"an":[6,71],"efficient":[7,72],"trade-off":[8,81],"between":[9,82],"memory":[10,54,128],"requirements":[11],"and":[12,84],"performance":[13,44,83],"for":[14,55],"implementation":[16],"FFT":[18,21,32,76,119],"pruning":[19,22,68,140],"algorithm.":[20],"algorithm":[23,33,69,103],"is":[24],"utilized":[25],"in":[26,35,94],"NC-OFDM":[27],"systems":[28],"to":[29,74,117,131],"simplify":[30],"complexity":[34],"presence":[36,95],"subcarrier":[38],"sparseness.":[39],"State-of-the-art":[40],"implementations":[41],"offer":[42],"good":[43],"with":[45],"drawback":[47],"high":[49],"resources":[50,85],"utilization,":[51],"i.e.":[52],"data":[53],"storage":[56],"configuration":[59],"matrix.":[60],"In":[61],"this":[62],"work":[63],"we":[64],"introduce":[65],"partial":[67],"as":[70],"way":[73],"implement":[75],"pruning,":[77],"obtaining":[78],"a":[79,112,132],"balanced":[80],"allocation.":[86],"Cycle":[87],"accurate":[88],"simulation":[89],"results":[90],"showed":[91],"that":[92],"even":[93],"low-medium":[97],"input":[98],"sparseness":[99],"levels":[100],"proposed":[102],"can":[104],"reduce":[105],"computation":[107],"time":[108],"at":[110,122],"least":[111],"20%":[113,133],"factor,":[114],"when":[115],"compared":[116],"traditional":[118],"algorithms":[120],"and,":[121],"same":[124],"time,":[125],"decreases":[126],"utilization":[129],"up":[130],"factor":[134],"over":[135],"state":[136],"art":[139],"algorithms.":[141]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}