Brunel University Research Archive (BURA) >
Schools >
School of Engineering and Design >
School of Engineering and Design Research papers >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2468

Title: High performance FPGA implementation of the mersenne twister
Authors: Chandrasekaran, S
Amira, A
Publication Date: 2008
Publisher: IEEE
Citation: IEEE International Symposium on Design, Electronic, Test and Applications DELTA2008, Hong Kong, January 23-25. pp. 482 - 485
Abstract: Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all published architectures to date and occupies only 330 FPGA slices. Partial pipelining and sub-expression simplification has been used to improve throughput per clock cycle. The proposed architecture is implemented on an RC1000 FPGA Development platform equipped with a Xilinx XCV2000E FPGA, and can generate 20 million 32 bit random numbers per second at a clock rate of 24.234 MHz. A through performance analysis has been performed, and it is observed that the proposed architecture clearly outperforms other existing implementations in key comparable performance metrics.
URI: http://bura.brunel.ac.uk/handle/2438/2468
DOI: http://dx.doi.org/10.1109/DELTA.2008.113
ISBN: 978-0-7695-3110-6
Appears in Collections:School of Engineering and Design Research papers
Electronic and Computer Engineering

Files in This Item:

File Description SizeFormat
High performance FPGA implementation of the mersenne twister.pdf337.4 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan