High-speed systolic architectures for finite field inversion
暂无分享,去创建一个
[1] R. McEliece. Finite field for scientists and engineers , 1987 .
[2] Kazuyoshi Takagi,et al. A VLSI Algorithm for Division in GF(2m) Based on Extended Binary GCD Algorithm , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[3] Zhiyuan Yan,et al. New Systolic Architectures for Inversion and Division in GF(2^m) , 2003, IEEE Trans. Computers.
[4] Stephen B. Wicker,et al. Reed-Solomon Codes and Their Applications , 1999 .
[5] R. McEliece. Finite Fields for Computer Scientists and Engineers , 1986 .
[6] Kiyomichi Araki,et al. Fast Inverters over Finite Field Based on Euclid's Algorithm , 1989 .
[7] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .
[8] Chien-Ming Wu,et al. Systolic VLSI realization of a novel iterative division algorithm over GF(2/sup m/): a high-speed, low-complexity design , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).
[9] C.-L. Wang,et al. Hardware-efficient systolic architecture for inversion and division in GF(2m) , 1998 .
[10] H. T. Kung. Why systolic architectures? , 1982, Computer.
[11] Zhiyuan Yan,et al. High-speed systolic architectures for finite field inversion and division , 2004, GLSVLSI '04.
[12] H. T. Kung,et al. Systolic VLSI Arrays for Polynomial GCD Computation , 1984, IEEE Transactions on Computers.