A Design of Cellular Array Parallel Multiplier on Finite Fields GF(2m)


The KIPS Transactions:PartA, Vol. 11, No. 1, pp. 1-10, Feb. 2004
10.3745/KIPSTA.2004.11.1.1,   PDF Download:

Abstract

A cellular array parallel multiplier with parallel-inputs and parallel-outputs for performing the multiplication of two polynomials in the finite fields GF(2m) is presented in this paper. The presented cellular array parallel multiplier consists of three operation parts : the multiplicative MODOP are composed of the basic cells which are designed with AND gates and XOR gates. The IPOP is constructed by XORgates and D flip-flops. This multipliers is simulated by clock period 1us using PSpice. The proposed multiplier is designed by 24 AND gates, 32XOR gates operating time of MODOP using IPOP requires m Unittimes(clock times). Therefore total operating time is M 1 unit times(clock times). The cellular array parallel multiplier is simple and regular for the wire routing and have the properties of concurrency and modularity. Also, it is expansible for the multiplication of two polynomial in the finite fields with very large m.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Gyeong, "A Design of Cellular Array Parallel Multiplier on Finite Fields GF(2m)," The KIPS Transactions:PartA, vol. 11, no. 1, pp. 1-10, 2004. DOI: 10.3745/KIPSTA.2004.11.1.1.

[ACM Style]
Seong Hyeon Gyeong. 2004. A Design of Cellular Array Parallel Multiplier on Finite Fields GF(2m). The KIPS Transactions:PartA, 11, 1, (2004), 1-10. DOI: 10.3745/KIPSTA.2004.11.1.1.