Reduced-complexity cyclotomic FFT and its application to Reed-Solomon decoding

被引：1
|
作者：
Chen, Ning [1 ]
Yan, Zhiyuan [1 ]
机构：
[1] Lehigh Univ, Dept Elect & Comp Engn, Bethlehem, PA 18015 USA
来源：
2007 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS, VOLS 1 AND 2 | 2007年
关键词：
discrete Fourier transforms; Galois fields; Reed-Solomon codes; complexity theory; optimization;
D O I：
10.1109/SIPS.2007.4387627
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Cyclotomic fast Fourier transform (CFFT) was recently proposed and shown to be efficient for lengths up to 511. In this paper, we propose a novel algorithm to reduce the additive complexity of CFFT. When used in transform-domain Reed-Solomon decoders, our improved CFFT reduces the complexity of the transform portion by up to 72%.
引用
收藏
页码：657 / 662
页数：6
相关论文
共 50 条
  • [1] Reduced-Complexity Reed-Solomon Decoders Based on Cyclotomic FFTs
    Chen, Ning
    Yan, Zhiyuan
    IEEE SIGNAL PROCESSING LETTERS, 2009, 16 (04) : 279 - 282
  • [2] Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes
    Kurzweil, Hans
    Seidl, Mathis
    Huber, Johannes B.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [3] Reduced-Complexity Decoders of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms
    Wu, Xuebin
    Yan, Zhiyuan
    Lin, Jun
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) : 3920 - 3925
  • [4] Reduced-complexity implementation of algebraic soft-decision decoding of Reed-Solomon codes
    Xia, HT
    Cruz, JR
    2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL V, PROCEEDINGS: DESIGN AND IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS INDUSTRY TECHNOLOGY TRACKS MACHINE LEARNING FOR SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING SIGNAL PROCESSING FOR EDUCATION, 2004, : 33 - 36
  • [5] Reduced complexity decoding of polar codes with Reed-Solomon kernel
    Trifonov, Peter
    2018 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2018,
  • [6] COMPLEXITY OF DECODING REED-SOLOMON CODES
    JUSTESEN, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) : 237 - 238
  • [7] Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation
    Zhang, Wei
    Wang, Hao
    Pan, Boyang
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (05) : 974 - 978
  • [8] Reduced complexity interpolation for soft-decoding of Reed-Solomon codes
    Ahmed, A
    Koetter, R
    Shanbhag, NR
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 385 - 385
  • [9] Reduced complexity interpolation architecture for soft-decision Reed-Solomon decoding
    Zhang, Xinmiao
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2006, 14 (10) : 1156 - 1161
  • [10] Reduced-Complexity Multiplicity Assignment Algorithm and Architecture for Low-Complexity Chase Decoder of Reed-Solomon Codes
    Peng, Xingru
    Zhang, Wei
    Ji, Wenjie
    Liang, Zhibin
    Liu, Yanyan
    IEEE COMMUNICATIONS LETTERS, 2015, 19 (11) : 1865 - 1868
12345