Direct root computation architecture for algebraic soft-decision decoding of reed-solomon codes

被引:2
|
作者
Ma, Jun [1 ]
Vardy, Alexander [1 ]
Wang, Zhongfeng [2 ]
Chen, Qinqin [2 ]
机构
[1] Univ Calif San Diego, Dept Elect Engn, La Jolla, CA 92093 USA
[2] Oregon State Univ, Sch EECS, Corvallis, OR 97331 USA
关键词
D O I
10.1109/ISCAS.2007.378492
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Algebraic soft-decision decoding [4] is a recent breakthrough in decoding of Reed-Solomon codes and it achieves significant decoding gain over conventional hard-decision decoding. In the bivariate polynomial factorization step of the new decoding algorithm, solving polynomial equations is required and it may contribute to a significant portion of the overall decoding latency. In this paper, we present a low-latency direct root computation architecture, which should lead to a factorization architecture that is of lower latency and more area efficient.
引用
收藏
页码:1409 / +
页数:2
相关论文
共 50 条