다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Information processing letters, v.111 no.21/22, 2011년, pp.1044 - 1047
Chiou, C.W. (Department of Computer Science & Information Engineering, Ching Yun University, 229, Chien-Hsin Rd., Chung-Li 320, Taiwan, ROC) , Lee, C.Y. , Yeh, Y.C.
AI-Helper
Polynomial basis multipliers are realized by conventional AND and XOR gates. In this study, polynomial basis multiplier is implemented by multiplexers rather than traditional AND and XOR gates. Two bits are processed at the same time. The proposed multiplexer-based multiplier saves about...
MacWilliams 1977 The Theory of Error-Correcting Codes
Lidl 1994 Introduction to Finite Fields and Their Applications
Blahut 1985 Fast Algorithms for Digital Signal Processing
Inform. and Comput. Itoh 83 21 1989 10.1016/0890-5401(89)90045-X Structure of parallel multipliers for a class of fields GF(2m)
IEEE Trans. Comput. Lee 50 5 385 2001 10.1109/12.926154 Bit-parallel systolic multipliers for GF(2m) fields defined by all-one and equally-spaced polynomials
IEEE Trans. Comput. Hasan 41 8 962 1992 10.1109/12.156539 Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)
Inform. and Comput. Bartee 6 79 1963 Computation with finite fields
10.1007/3-540-51083-4_67 E.D. Mastrovito, VLSI architectures for multiplication over finite field GF(2m), in: T. Mora (Ed.), Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Proc. Sixth Int. Conf., AAECC-6, Rome, July 1988, pp. 297-309.
E.D. Mastrovito, VLSI architectures for computations in Galois fields, Ph.D. thesis, Linkoping Univ., Dept. of Electrical Eng., Linkoping, Sweden, 1991.
IEEE Trans. Comput. Koc 47 3 353 1998 10.1109/12.660172 Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
IEE Proc. Comput. Digit. Tech. Lee 150 1 39 2003 10.1049/ip-cdt:20030061 Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
IEEE Trans. Comput. Paar 45 7 856 1996 10.1109/12.508323 A new architecture for a parallel finite field multiplier with low complexity based on composite fields
IEEE Trans. Comput. Paar 47 2 162 1998 10.1109/12.663762 Efficient multiplier architectures for Galois Fields GF(24n)
Electron. Lett. Chiou 39 24 1709 2003 10.1049/el:20031050 Low complexity finite field multiplier using irreducible trinomials
J.L. Massey, J.K. Omura, Computational method and apparatus for finite field arithmetic, U.S. Patent Number 4,587,627, May 1986.
IEEE Trans. Comput. Reyhani-Masoleh 51 5 511 2002 10.1109/TC.2002.1004590 A new construction of Massey-Omura parallel multiplier over GF(2m)
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Lee E88-A 11 3169 2005 10.1093/ietfec/e88-a.11.3169 Efficient design of low-complexity bit-parallel systolic Hankel multipliers to implement multiplication in normal and dual bases of GF(2m)
IEEE Trans. Comput. Wu 47 11 1223 1998 10.1109/12.736433 New low-complexity bit-parallel finite field multipliers using weakly dual bases
IEEE Trans. Inform. Theory Berlekamp IT-28 869 1982 10.1109/TIT.1982.1056591 Bit-serial Reed-Solomon encoders
Comput. Electr. Engrg. Lee 31 7 444 2005 10.1016/j.compeleceng.2005.09.002 Low-complexity bit-parallel dual basis multipliers using the modified Booth？s algorithm
Quart. J. Mech. Appl. Math. Booth 4 236 1951 10.1093/qjmam/4.2.236 A signed binary multiplication technique
Proc. IRE Macsorley 49 1 67 1961 10.1109/JRPROC.1961.287779 High speed arithmetic in binary computers
IEEE Trans. Comput. Pekmestzi 48 1 15 1999 10.1109/12.743408 Multiplexer-based array multipliers
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.