期刊文献+

一种支持预搜索的面积紧凑型BCH并行译码电路

An area-efficient parallel BCH decoder supporting foresighted error search
下载PDF
导出
摘要 在支持预搜索的面积紧凑型BCH并行译码电路中,采用双路选通实现结构,在校正子运算电路的输入端完成被纠码序列与有限域常量的乘法,简化了电路结构;在实现IBM迭代算法时,为了压缩实现面积,复用一个有限域GF(2n)上的二输入乘法器,一轮迭代运行多拍运算;设计了全组合逻辑预搜索模块,加快了BCH截短码的搜索速度。同现有技术相比,该译码电路实现面积紧凑且关键路径短。综合与静态时序分析结果表明,对于512字节的信息元和8-bit的纠错能力,该译码器在80MHz工作频率下符合时序要求;在TSMC0.18μm工艺库下仅需约14800门,满足目前大容量存储设备对数据可靠性和成本控制的要求。 An area-efficient parallel BCH decoder that supports foresighted error search is presented in this paper. For simplifying syndrome operation circuit, the diplexers are used to do multiplication between receiving sequence and constants of Galois field. Within the inversionless Berlekamp-Massey architecture, a finite-field multiplier is used repeatedly to perform multi-clock-cycle operations in each round of iteration, which contributes to the area-efficient implementation. A foresighted error search module is added to Chien search circuit to improve error search speed of shortened BCH code. Compared with the existing techniques, the proposed BCH decoder bears compact area and short critical path. Based on TSMC 0.181am standard cell library, this BCH decoder for 8-bit correction per 512Bytes only costs 14800 gates under 80MHz clock, which can meet the error control requirements of current mass-storage devices.
出处 《电路与系统学报》 CSCD 北大核心 2009年第2期50-55,73,共7页 Journal of Circuits and Systems
基金 国家863计划超大规模集成电路设计专项资助项目(2005AA1Z1080)
关键词 大容量存储 BCH码 Inversionless Berlekamp—Massey算法 预搜索 并行译码 mass-storage, BCH code, Inversionless Berlekamp-Massey algorithm, foresighted error search, parallel decoding
  • 相关文献

参考文献6

  • 1Burton H. Inversionless decoding of binary BCH codes [J]. IEEE Transactions on Information Theory, 1971, 17 (4): 464-466.
  • 2Reed I S, Shih M T. VLSI design of inverse - free Berlekamp-Massey algorithm [J]. In lEE Proceedings on Computers and Digital Techniques, 1991, 138(5): 295-298.
  • 3张军,王志功,胡庆生,肖洁.高速Berlekamp-Massey算法结构及电路实现[J].电路与系统学报,2006,11(4):85-89. 被引量:5
  • 4Chen Y, Parhi K K. Area efficient parallel decider architecture for long BCH codes [A]. IEEE Proceedings on ICASSP 2004 [C]. 2004. 73 -76.
  • 5Chang H C, Shung C B. New serial architecture for the Berlekamp-Massey algorithm [J]. IEEE Transactions on Communications, 1999, 47(4): 481-483.
  • 6Blauht R E. Theory and Practice of Error Control Codes [M]. London: Addison Wesley Publishing Company, 1983, Chap. 5-6.

二级参考文献6

  • 1R E Blauht, Theory and Practice of Error Control Codes [M], Addison Wesley, 1983.
  • 2Burton H. Inversionless decoding of binary BCH codes [J]. IEEE Transactions on Information Theory, 1971,17(4): 464-466.
  • 3Reed I S,Shih M T. VLSI design of inverse-free Berlekamp-Massey algorithm [J]. In lEE Proceedings on Computers and Digital Techniqoes, 1991, 138(5): 295-298.
  • 4Hsie-Chia Chang, Shung C B.New serial architecture for the Berlekamp-Massey algorithm [J]. IEEE Transactions on Communications, 1999,47(4): 481-483.
  • 5Sarwate D V, Shanbhag N R. High-speed architectures for Reed-Solomon decoders [J]. IEEE Transactions on VLSI Systems, 2001, 9(5):641-655.
  • 6Strollo A G M, Petra N, De Caro D, Napoli E. An area-efficient high-speed Reed-Solomon decoder in 0.25 um CMOS [A]. In ESSCIRC 2004.Proceeding of the 30th European [C]. 2004. 479-482.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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