Login
 Forum
 
 
Thesis topic proposal
 
Construction of pseudo random number generators using FPGA

THESIS TOPIC PROPOSAL

Institute: University of Debrecen
computer sciences
Doctoral School of Informatics

Thesis supervisor: Tamás Herendi
Location of studies (in Hungarian): University of Debrecen Faculty of Informatics
Abbreviation of location of studies: DE IK


Description of the research topic:

Syllabus
Pseudo random number generators are frequently used in solving theoretical and practical problems. The different applications require different properties from the generators. The most important such properties are distribution, low correlation between the elements produced by the generator and large period length. Practical applications may expect high speed and low resource consumption of the generators.
Inside the subject, several research direction is possible: how to create a sequence (generator) corresponding to the given properties – e.g. uniform distribution, large period length or good approximation of the assumed distribution – or how to construct a sampling algorithm carrying out the theoretical generator with sufficient efficiency – such as speed and resource requirements.
It is important in both reaearch direstions the possibility of massive parallelization, keeping in mind the implementation to FPGA devices.

Bibliography
[1] J. von zur Gathen and J. Gerhard, Modern computer algebra. 3rd ed. Cambridge: Cambridge University Press (2013)
[2] G. Everest, A. vander Poorten, I. Shparlinski and T. Ward, Recurrence sequences. Providence, RI: American Mathematical Society (AMS) (2003)
[3] O. Strauch and S. Porubsky, Distribution of sequences. A sampler. Bern: Peter Lang (2005)
[4] M. B. Gokhale, P. S. Graham, Reconfigurable Computing: Accelerating Computation with Field-Programmable Gate Arrays, Springer (2005)
[5] R. Lidl and H. Niederreiter, Finite fields. 2nd ed. Cambridge: Cambridge Univ. Press (1996)
[6] L. Devroye, Non-uniform random variate generation. Springer-Verlag, (1986)
[7] D. E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms. 3rd ed. Bonn: Addison-Wesley (1998)


Deadline for application: 2019-11-15


2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )