Please use this identifier to cite or link to this item:
Title: High performance FPGA implementation of the mersenne twister
Authors: Chandrasekaran, S
Amira, A
Issue 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.
ISBN: 978-0-7695-3110-6
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

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.