.png){kind=icon}
返回
A Low-Complexity Three-Error-Correcting BCH Decoder for Optical Transport Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2012.2208678.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The forward error correction for 100-Gbit/s optical transport network has received much attention recently. Studies showed that product codes that employ three-error-correcting Bose-Chaudhuri-Hocquenghem (BCH) codes can achieve better performance than other BCH or Reed-Solomon codes. For such codes, the Peterson algorithm can be used to compute the error locator polynomial, and its roots can be found directly using a lookup table (LUT). However, the size of the LUT is quite large for finite fields of high order. In this brief, a novel approach is proposed to reduce the LUT size by at least four times through making use of the properties of the error locator polynomial and normal basis representation of finite field elements. Moreover, hybrid representation of finite field elements is adopted to minimize the complexity of the involved computations. For a (1023, 993) BCH decoder over GF(2(10)), the proposed design can lead to at least 28% complexity reduction.
Keyword:
BCH codes
normal basis
Peterson's algorithm
three-error correcting
VLSI design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Flower herbivory and seed predation in Silene vulgaris (Caryophyllaceae): effects of pollination and phenology.png)
Ecography
EcographyIF0
PREAI
分享收藏
没有更多内容
没有更多内容