Treffer: Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)
Title:
Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)
Authors:
Source:
Computer arithmeticIEEE transactions on computers. 41(8):962-971
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 1992.
Publication Year:
1992
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Architecture modulaire, Modular architecture, Arquitectura modular, Arithmétique ordinateur, Computers arithmetic, Aritmética ordenador, Carroyage, Squaring, Cuadriculación, Complexité calcul, Computing complexity, Complejidad cálculo, Conception circuit, Circuit design, Concepción circuito, Implémentation, Implementation, Ejecución, Inverse, Inverso, Multiplicateur, Multiplier, Multiplicador, Système informatique, Computer system, Sistema informático, Champ fini
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Victoria, dep. electrical computer eng., Victoria BC V8W 3P6, Canada
ISSN:
0018-9340
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4373824
Database:
PASCAL Archive
Weitere Informationen
Structures for parallel multipliers of a class of fields GF(2m) based on irreducible all one polynomials (AOP) and equally spaced polynomials (ESP) are presented. The structures are simple and modular which is important for hardwave realization. Relationships between an irreducible AOP and the corresponding irreducible ESP's have been exploited to construct ESp based multipliers of large fields by a regular expansion of the basic modules of the AOP based multiplier of a small field.