Reduced-Complexity Reed-Solomon Decoders Based on Cyclotomic FFTs

被引：15

作者：

Chen, Ning ^{[1
]}

Yan, Zhiyuan ^{[1
]}

机构：

[1] Lehigh Univ, Dept Elect & Comp Engn, Bethlehem, PA 18015 USA

来源：

IEEE SIGNAL PROCESSING LETTERS | 2009年 / 16卷 / 04期

基金：

美国国家科学基金会;

关键词：

Common subexpression elimination (CSE); decoding; discrete Fourier transforms; Galois fields; Reed-Solomon codes; FOURIER-TRANSFORM; POLYNOMIALS; COMPUTATION; ERASURES; ERRORS; ROOTS;

D O I：

10.1109/LSP.2009.2014292

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：279 / 282

页数：4

共 50 条

[1] Reduced-Complexity Decoders of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms
Wu, Xuebin
Yan, Zhiyuan
Lin, Jun
[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) : 3920 - 3925
[2] Reduced-complexity cyclotomic FFT and its application to Reed-Solomon decoding
Chen, Ning
Yan, Zhiyuan
[J]. 2007 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS, VOLS 1 AND 2, 2007, : 657 - 662
[3] Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation
Zhang, Wei
Wang, Hao
Pan, Boyang
[J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (05) : 974 - 978
[4] On the Average Complexity of Reed-Solomon List Decoders
Cassuto, Yuval
Bruck, Jehoshua
McEliece, Robert J.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2336 - 2351
[5] Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes
Kurzweil, Hans
Seidl, Mathis
Huber, Johannes B.
[J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
[6] Reduced-complexity implementation of algebraic soft-decision decoding of Reed-Solomon codes
Xia, HT
Cruz, JR
[J]. 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
[7] A parametrical architecture for Reed-Solomon decoders
Petre, ME
Masera, G
[J]. SIXTH GREAT LAKES SYMPOSIUM ON VLSI, PROCEEDINGS, 1996, : 81 - 84
[8] 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
[J]. IEEE COMMUNICATIONS LETTERS, 2015, 19 (11) : 1865 - 1868
[9] Low hardware complexity key equation solver chip for Reed-Solomon decoders
Baek, Jaehyun
Sunwoo, Myung H.
[J]. 2007 IEEE ASIAN SOLID-STATE CIRCUITS CONFERENCE, PROCEEDINGS OF TECHNICAL PAPERS, 2007, : 51 - 54
[10] High-Speed Low-Complexity Architecture for Reed-Solomon Decoders
Lu, Yung-Kuei
Shieh, Ming-Der
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (07): : 1824 - 1831

← 1 2 3 4 5 →