期刊文献+

10G EPON中面积优化的RS(255,223)解码器设计 被引量:1

An Area-Efficient Design of RS(255,223) Decoder for 10GEPON
下载PDF
导出
摘要 提出了一种面积优化的RS(reed-solomon)解码器的设计方法.其运用一种改进的ME(Modified Euclide-an)算法求解关键方程模块,其它模块采用迭代结构.该方法减少了解码器中伽罗法域乘法器的使用,缩减了硬件规模.基于TSMC 90nm标准单元库的实现结果显示该文设计的解码器规模约为24000门,与同类设计相比规模最大可缩减36%. This paper presents a new area-efficient implementation for Reed-solomon(RS)decoder.By using modified euclidean arithmetic to implement the equation solving circuits and the folding architecture for other modules,this method has decreased GF multipliers and simplify the hardware structure.Based on the TSMC 90nm standard cell library,the proposed RS decoder consists of about 24000gates,which is about 36%smaller than the same kind of conventional ones.
出处 《微电子学与计算机》 CSCD 北大核心 2013年第7期163-166,共4页 Microelectronics & Computer
关键词 里德所罗门码 ME算法 RS(255 223) 10G EPON Reed-Solomon ME RS(255 223) 10GEPON
  • 相关文献

参考文献7

  • 1IEEE. I.AN/MAN standards committee of the IEEE computer society[S]. New York, IEEE 802. 3av-2009.
  • 2Dusan Suvakovic. Compact highly-utilized reed lomon decoder architectures for optical access networks[C]// IEEE Globecom 2011 ( C. U) SA: Houston, 2011 : 1-6.
  • 3袁强,胡钢.GPON中FEC编解码器的研究与实现[D].成都:电子科技大学,2009.
  • 4胡庆生,王志功,张军,肖洁.2.5Gb/s Reed-Solomon译码器的VLSI优化实现[J].电路与系统学报,2005,10(2):57-65. 被引量:3
  • 5I.ee Hanho. High-speed VLSI decoder [J]. IEEE Trans on Very Large Integration (VLSI) Systems, 2003, 11 (2) : 288-294.
  • 6I,ee H. Modifed euclidean algorithm block for high- speed reed- solomon decoder[J]. IEE Electro nics I.etters, 2001,37(14) :903-904.
  • 7Jensen K. Colored petrinets basic concepts, analysis methods and practical use[M]. Monogra phs in Theo- retical Computer Science(Volume l:Basic Concepts). Berlin/Heidelberg/New York Springer-Verlag, 1997.

二级参考文献13

  • 1Lee Hanho. High-Speed VLSI Architecture for Parallel Reed-Solomon Decoder [J]. IEEE Trans. On VLSI, 2003-04, 11(2): 288-294.
  • 2Song Leilei, Yu Men-Lin. 10-and40Gb/s Forward Error Correction Devices for Optical Communications [J]. IEEE J of SSC, 2002-11, 37(11):1565-1573.
  • 3Chang Hsie-Chia, Lin Chien-Ching, Lee Chen-yi. A Low-power Reed-Solomon Decoder For STM-16 Optical Communications [A]. Proc.IEEE Asia Pacific Conf. on ASICs [C]. 2002. 351-354.
  • 4Mastrovito E D. VLSI design for multiplication over finite fields GF (2m) [A]. Lecture Notes in Computer Science [C]. Springer-Verlag,Berlin, 1989-03, 357: 297-309.
  • 5Song L, Parhi K K. Low complexity modified Mastrovito multipliers over finite fields GF (2^m) [A]. IEEE International Symposium on Circuits and Systems [C]. Orlando, FL. 1999. 508-512.
  • 6Zhang T, Parhi K K. Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials [J]. IEEE Trans on Computers, 2001, 1(50): 734-749.
  • 7PAAr C. A new architecture for a parallel finite field multiplier with low complexity based on composite Fields [J]. IEEE Trans. On Computers, 1996, 45(7): 856-861.
  • 8Paar C. Optimmized Arithmetic for Reed-Solomon Encoders [A]. Proc. IEEE Int. Sym. Information Theory [C]. 1997. 250.
  • 9Lee Hanho. An Area-Efficient Euclidean Algorithm Block for Reed-Solomon Decoder [A]. Proc. ISVLSI'03 [C]. 2003. 209-210.
  • 10Shao H M, Truong T K, Deutsch L J, et al. A VLSI Design of A Pipeline Reed-Solomon Decoder [J]. IEEE Trans. on Computers, 1985, 34(5):393-403.

共引文献2

同被引文献6

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部