Systolic integer divider for Sunar-Koc ONB type II multiplier

Description

This thesis focuses on the Binary Integer Modulo-Division Algorithm that is essential for the
permutation process in Sunar-Koc ONB Type II Multiplier and also for other general purposes.
This thesis explains the new algorithm developed based on the systolic array architecture which gives a systematic approach to the iterative process for the Modulo-Division. The scheduling and projection timing functions are proposed for the processor array allocation and the matlab code has been implemented to verify the efficiency of the algorithm. The thesis also explores the possibility of word based algorithm for design optimisation. / Graduate / 0544 / 0984 / [e-mail]

Links & Downloads

1. http://hdl.handle.net/1828/7882
2. B.Sunar and C. Ko c, \An e cient optimal normal basis type II multiplier," IEEE Transactions on Computers, pp. 83{87, Jan. 2001.
3. F. Gebali and A. Ibrahim, \Systolic array architectures for sunar-ko c optimal normal basis type II multiplier," IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI)SYSTEMS, Oct. 2015.
4. F. Gebali, Algorithms and Parallel Computing. Wiley, Apr. 2011.
5. R. Lidl and H. Niederreiter, Introduction to Finite Fields and TheirApplications. New York: Cambridge University Press, 1994.
6. E. Mastrovito, VLSI Architectures for Multiplication over Finite Field GF(2m). Springer-Verlag, 1988.
7. J. Omura and J. Massey, \Computational method and apparatus for nite eld arithmetic," May 1986.
8. A. Reyhani-Masoleh and M. A. Hasan, \A new construction of massey-omura parallel multiplier over GF(2m)," IEEE Transactions on Computers, pp. 511{ 520, 2002.
9. L. Gao and G. E. Sobelman, \Improved VLSI designs for multiplication and inversion in GF(2m) over normal bases," in In Proc. of the 13th Annual IEEE International ASIC/SOC Conference, pp. 97{101, 2000.
10. A. Reyhani-Masoleh and M. A. Hasan, \Low complexity word-level sequential normal basis multipliers," IEEE Transactions on Computers, pp. 98{110, 2005.
11. A. Reyhani-Masoleh and M. A. Hasan, \Low complexity sequential normal basis multipliers over GF(2m)," in in Proc. of the 16th IEEE Symposium on Computer Arithmetic, pp. 188{195, 2003.
12. J.-S. Horng, I.-C. JOU, and C.-Y. Lee, \Low-complexity multiplexer-based nor- mal basis multiplier over GF(2m)," Zhejiang University Science, pp. 834{842, 2009.
13. N. I. of Standards and Technology, Digital Signature Standard: FIPS Publication 186-4. pub-NIST, Jan. 2000.

Tags

Integer

Modulo

Divider

Binary

Sunar-Koc

Systematic

Systolic

algorithm

Additional Fields

Identifer	oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/7882
Date	06 April 2017
Creators	Muralidhar, Shubha
Contributors	Gebali, Fayez
Source Sets	University of Victoria
Language	English, English
Detected Language	English
Type	Thesis
Rights	Available to the World Wide Web, http://creativecommons.org/licenses/by-nc-nd/2.5/ca/