An efficient hardware implementation of high quality AWGN generator using Box-Muller method

• Published in: 11th International Symposium on Communications and Information Technologies, ISCIT 2011 pp. 449 - 454
• Main Authors: Malik, J. S., Malik, J. N., Hemani, A., Gohar, N. D.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2011
• Subjects: Accuracy; Algorithm design and analysis; Approximation error; AWGN; Box Muller Algorithm; Gaussian; Generators; Hardware; Normal; Polynomials; Random Number Generator; piecewise polynomial techniques; AWGN; Gaussian random numbers; high quality AWGN generator; piecewise polynomial approximation; shift registers; linear feedback shift registers; Box-Muller method; hardware implementation
• ISBN: 9781457712944; 1457712946
• DOI: 10.1109/ISCIT.2011.6090035

Box Muller (BM) algorithm is extensively used for generation of high quality Gaussian Random Numbers (GRNs) in hardware. Most efficient published implementation of BM method utilizes transformation of 32-bit data path to 16 bits and use of first degree piece-wise polynomial approximation to compute logarithmic and square root functions. In this work, we have performed extensive error analysis to show that coefficient memory for polynomial approximation can be reduced by more than 35 percent without compromising on quality of generated Gaussian samples. This also reduces complexity of corresponding address generator, which requires most hardware resources. We have also used more efficient and statistically accurate skip-ahead Linear Feedback Shift Registers to generate uniformly distributed numbers for the BM algorithm. Complete hardware implementation utilizes only 407 slices, 03 DSP blocks and 1.5 memory blocks on Xilinx Virtex-4 XC4VLX15 operating at 230 MHz while providing a tail accuracy of 6.6σ. This is better in terms of accuracy and hardware utilization than any of the previously reported architecture.