Novel Radix Finite Field Multiplier for GF(2m)

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology

Volumn 15, Issue 3, 1997, Pages 233-245

  Mekhallalati, M C ^a,c,d   Ashur, A S ^a,g,h   Ibrahim, M K ^a,b,e,f  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b DE MONTFORT UNIVERSITY   (United Kingdom)

^c KING SAUD UNIVERSITY   (Saudi Arabia)

^d University of Nottingham ^*  (United Kingdom)

^e NEWCASTLE UNIVERSITY   (United Kingdom)

^f Dept Electronics and Elec and Eng

^g UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^h UNIVERSITY OF TRIPOLI   (Libyan Arab Jamahiriya)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DIGITAL ARITHMETIC;

DIGITAL-SERIAL MULTIPLICATION ARCHITECTURE; FINITE FIELD MULTIPLICATION;

MULTIPLYING CIRCUITS;

EID: 0031100680     PISSN: 13875485     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. C.L. Wang and J.L. Lin, "Systolic array implementation of multipliers for finite fields," IEEE Transaction on Circuit and Sy stems, Vol. 38, No. 7, pp. 796-800, July 1991.
2. M) multiplier and squarer architectures," Proc. of the IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP'95, pp. 2747-2750.
3. M. Morii, M. Kasahara, and D. Whiting, "Efficient bit-serial multiplication and the discrete-time Winer-Hopf equation over finite fields," IEEE Transactions on Information Theory, Vol. 35, No. 6, pp. 1177-1183, Nov. 1989.
4. E.R. Berlekemp, Algebric Coding Theory, McGraw-Hill, New York, 1968.
5. E.J. Mc-Williams and N.J. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York, 1977.
6. W.W. Peterson and E.J. Weldon, Jr., Error-Correcting Codes, MIT Press, Cambridge, MA, 1972.
7. n multiplier structure: A structured design methodology," IEE Proc., Pt-E, Vol. 140, No. 4, pp. 185-190, July 1993.
8. m)," IEEE Transaction on Computers, Vol. C-33, pp. 357-360, April 1984.
9. C.W. Wu and M.K. Chang, "Bit-level systolic arrays for finite-field multiplication," Journal of VLSI Signal Processing, Vol. 10, pp. 85-92, 1995.
10. m)," IEEE Transaction on Computers, Vol. 37, No. 6, pp. 749-751, June 1988.
11. m)," Proc. IEEE International Symposium on Circuits and Systems, ICAS'95, Vol. 3, pp. 2000-2003, 1995.
12. m)," IEEE Transaction on Computers, Vol. 41, No. 8, pp. 972-980, Aug. 1992.
13. m)," IEEE Journal on Selected Areas in Communication, Vol. SAC-4, No. 1, pp. 62-65, Jan. 1986.
14. S. Bandyopadhyay and A. Sengupta, "Algorithms for multiplication in Galois field for implementation using systolic arrays," IEE. Proc., Pt-E, Vol. 135, No. 6, pp. 336-339, Nov. 1988.
15. m)," IEE Proc. Pt-E, Vol. 139, No. 3, pp. 230-236, May 1992.
16. m) Multiplication and division over the dual basis," IEEE Transaction on Computers, Vol. 45, No. 3, pp. 319-327, March 1996.
17. m)," Electronics Letters, Vol. 31, No. 22, pp.1893-1894, Oct. 1995.
18. K. Hwang, Computer Arithmetic: Principle, Architecture, and Design, John Wiley & Sons, New York, 1979.
19. I.S. Hsu, T.K. Truong, L.J. Deutsh, and I.S. Reed, "A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases," IEEE Transaction on Computers, Vol. 37, No. 6, pp. 735-739, June 1988.