期刊文献+

Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2^m)

Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2^m)
下载PDF
导出
摘要 An error tolerant hardware efficient verylarge scale integration (VLSI) architecture for bitparallel systolic multiplication over dual base, which canbe pipelined, is presented. Since this architecture has thefeatures of regularity, modularity and unidirectionaldata flow, this structure is well suited to VLSIimplementations. The length of the largest delay pathand area of this architecture are less compared to the bitparallel systolic multiplication architectures reportedearlier. The architecture is implemented using Austria Micro System's 0.35 μm CMOS (complementary metaloxide semiconductor) technology. This architecture canalso operate over both the dual-base and polynomialbase. An error tolerant hardware efficient verylarge scale integration (VLSI) architecture for bitparallel systolic multiplication over dual base, which canbe pipelined, is presented. Since this architecture has thefeatures of regularity, modularity and unidirectionaldata flow, this structure is well suited to VLSIimplementations. The length of the largest delay pathand area of this architecture are less compared to the bitparallel systolic multiplication architectures reportedearlier. The architecture is implemented using Austria Micro System's 0.35 μm CMOS (complementary metaloxide semiconductor) technology. This architecture canalso operate over both the dual-base and polynomialbase.
出处 《Journal of Electronic Science and Technology of China》 2009年第4期336-342,共7页 中国电子科技(英文版)
关键词 Bit parallel error correction finitfield Reed-Solomon (RS) codes SYSTOLIC very large scalintegration (VLSI) testing Bit parallel, error correction, finitfield, Reed-Solomon (RS) codes, systolic, very large scalintegration (VLSI) testing
  • 相关文献

参考文献19

  • 1T. A. Gulliver, M. Serra, and V. K. Bhargava, "The generation of primitive polynomials in GF(2") with independent roots and their application for power residue codes, VLSI testing and finite field multipliers using normal bases," Intl. d. Electronics, vol. 71, no. 4, pp. 559-576, 1991. 被引量:1
  • 2R. E. Blahut, Fast Algorithms for Digital Signal Processing, Reading, Mass: Addison Wesley, 1985. 被引量:1
  • 3E. R. Berlekamp, "Bit-serial Reed-Solomon encoders," IEEE Trans. Inf. Theory, 1982, vol. 28, no. 6, pp. 869-874, 1982. 被引量:1
  • 4I. S. Hsu, T. K. Truong, L. J. Deutsch, and I. S. Reed, "A comparison of VLSI architectures of finite field multipliers using dual, normal or standard bases," IEEE Trans. on Computers, vol. 37, no. 6, pp. 735-737, 1988. 被引量:1
  • 5C. H. Kim, C. P. Hong, and S. Kwon, "A digit-serial multiplier for finite field GF(2")," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 13, no. 4, pp. 467-483, 2005. 被引量:1
  • 6M. K. Hasan and V. K. Bhargava, "Division and bit-serial multiplication over GF(q~ ," IEE Proc. E, vol. 139, no. 3, pp. 230-236, 1992. 被引量:1
  • 7K. W. Kim, K. J. Lee, and K. Y. Yoo, "A new digit-serial systolic multiplier for finite fields GF(2^m)," in Proe. of 2001 Intl. Conf. on Info-Tech and Info-Net, Beijing, 2001, pp. 128-133. 被引量:1
  • 8C. S. Yeh, I. S. Reed, and T. K. Truong, "Systolic multi-pliers for finite fields GF(2^m)," IEEE Trans. on Computers, vol. 33, no. 4, pp. 357-360, 1984. 被引量:1
  • 9L. S. Reed and X. Chen, Error-Control Coding for Data Networks, Norwell, USA: Kluwer Academic, 1999. 被引量:1
  • 10S. T. J. Fenn, M. Benaissa, and D. Taylor: "Dual basis systolic multipliers for GF(2"~),'' lEE Comp. Digit. Tech., vol. 144, no. 1, pp. 43-46, 1997. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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