2008/11/02 by Ning Chen, Zhiyuan Yan
Computer Science · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Digital Filter Design and Implementation #cs.IT #math.IT
paper · pdf · doi:10.1109/lsp.2009.2014292
15 pages, shortened version submitted to IEEE Signal Processing Letters
arxiv created 2008/11/02 · openalex publication_date 2009/02/26 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/29
In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal components are constrained, based on their properties as well as a common subexpression elimination algorithm. Our partial CFFTs achieve smaller computational complexities than previously proposed partial CFFTs. Utilizing our CFFTs in both transform- and time-domain Reed-Solomon decoders, we achieve significant complexity reductions.