{"id":"https://openalex.org/W2114347330","doi":"https://doi.org/10.1109/sips.2007.4387627","title":"Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding","display_name":"Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2114347330","doi":"https://doi.org/10.1109/sips.2007.4387627","mag":"2114347330"},"language":"en","primary_location":{"id":"doi:10.1109/sips.2007.4387627","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2007.4387627","pdf_url":null,"source":{"id":"https://openalex.org/S4210209284","display_name":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","issn_l":"1520-6130","issn":["1520-6130","2374-7390"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Workshop on Signal Processing Systems","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/A5100446696","display_name":"Ning Chen","orcid":"https://orcid.org/0000-0002-3153-8765"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ning Chen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA. E-mail: nic6@lehigh.edu"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA. E-mail: nic6@lehigh.edu","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101582861","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0000-0003-2286-2771"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiyuan Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA. E-mail: yan@lehigh.edu"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA. E-mail: yan@lehigh.edu","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100446696"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":1.4077,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8561191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"657","last_page":"662"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7393712997436523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6878179907798767},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6678087115287781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5758139491081238},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5080795288085938},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.4877937138080597},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.4625190496444702},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45913368463516235},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.44581225514411926},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.4418722093105316},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.4201873540878296},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.33020010590553284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24930018186569214},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.1394469141960144},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.12030783295631409},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.09312379360198975}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7393712997436523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878179907798767},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6678087115287781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5758139491081238},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5080795288085938},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.4877937138080597},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.4625190496444702},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45913368463516235},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.44581225514411926},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.4418722093105316},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.4201873540878296},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.33020010590553284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24930018186569214},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.1394469141960144},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.12030783295631409},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.09312379360198975},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"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/sips.2007.4387627","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2007.4387627","pdf_url":null,"source":{"id":"https://openalex.org/S4210209284","display_name":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","issn_l":"1520-6130","issn":["1520-6130","2374-7390"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Workshop on Signal Processing Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309129","display_name":"Cystic Fibrosis Foundation Therapeutics","ror":"https://ror.org/00ax59295"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1528935082","https://openalex.org/W1980822076","https://openalex.org/W1992406028","https://openalex.org/W2007158444","https://openalex.org/W2018063252","https://openalex.org/W2073962970","https://openalex.org/W2131011765","https://openalex.org/W2138169871","https://openalex.org/W2164339744"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2977460836","https://openalex.org/W2144412928","https://openalex.org/W4362564158","https://openalex.org/W2155491755","https://openalex.org/W2154006536","https://openalex.org/W2348800014","https://openalex.org/W1820187807","https://openalex.org/W2365391860"],"abstract_inverted_index":{"Cyclotomic":[0],"fast":[1],"Fourier":[2],"transform":[3,47],"(CFFT)":[4],"was":[5],"recently":[6],"proposed":[7],"and":[8],"shown":[9],"to":[10,16,26,51],"be":[11],"efficient":[12],"for":[13],"lengths":[14],"up":[15,50],"511.":[17],"In":[18],"this":[19],"paper,":[20],"we":[21],"propose":[22],"a":[23],"novel":[24],"algorithm":[25],"reduce":[27],"the":[28,43,46],"additive":[29],"complexity":[30,44],"of":[31,45],"CFFT.":[32],"When":[33],"used":[34],"in":[35],"transform-domain":[36],"Reed-Solomon":[37],"decoders,":[38],"our":[39],"improved":[40],"CFFT":[41],"reduces":[42],"portion":[48],"by":[49],"72%.":[52]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}