tailieunhanh - Báo cáo toán học: " Pseudorandom recursions II"

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học được đăng trên tạp chí toán học quốc tế đề tài: Pseudorandom recursions II | EURASIP Journal on Embedded Systems SpringerOpen0 This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text HTML versions will be made available soon. Pseudorandom recursions II EURASIP Journal on Embedded Systems 2012 2012 1 doi 1687-3963-2012-1 Laszlo Hars Laszlo@ Gyorgy Petruska petruskg@ ISSN 1687-3963 Article type Research Submission date 25 July 2011 Acceptance date 1 February 2012 Publication date 1 February 2012 Article URL http content 2012 1 1 This peer-reviewed article was published immediately upon acceptance. It can be downloaded printed and distributed freely for any purposes see copyright notice below . For information about publishing your research in EURASIP Journal on Embedded Systems go to http authors instructions For information about other SpringerOpen publications go to http 2012 Hars and Petruska licensee Springer. This is an open access article distributed under the terms of the Creative Commons Attribution License http licenses by which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Pseudorandom recursions II Laszlo Hars 1 and Gyorgy Petruska2 1CPU Technology Pleasanton CA 94588 USA 2Purdue University Fort Wayne IN USA Corresponding author lhars@ Email address GP petruskg@ Abstract We present our earlier results not included in Hars and Petruska due to space and time limitations as well as some updated versions of those and a few more recent pseudorandom number generator designs. These tell a systems designer which computer word lengths are suitable for certain high-quality pseudorandom number generators and which constructions of a large family of designs provide long cycles the most important property of such generators. The employed mathematical tools could help assessing the .