A Gaussian noise generator for hardware-based simulations

被引:53
作者
Lee, DU [1 ]
Luk, W
Villasenor, JD
Cheung, PYK
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London, England
[2] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
[3] Univ London Imperial Coll Sci Technol & Med, Dept Elect & Elect Engn, London, England
基金
英国工程与自然科学研究理事会;
关键词
algorithms implemented in hardware; error-checking; gate arrays; simulation;
D O I
10.1109/TC.2004.106
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Hardware simulation offers the potential of improving code evaluation speed by orders of magnitude over workstation or PC-based simulation. We describe a hardware-based Gaussian noise generator used as a key component in a hardware simulation system, for exploring channel code behavior at very low bit error rates (BERs) in the range of 10(-9) to 10(-10). The main novelty is the design and use of nonuniform piecewise linear approximations in computing trigonometric and logarithmic functions. The parameters of the approximation are chosen carefully to enable rapid computation of coefficients from the inputs while still retaining high fidelity to the modeled functions. The output of the noise generator accurately models a true Gaussian Probability Density Function (PDF) even at very high sigma values. Its properties are explored using: 1) several different statistical tests, including the chi-square test and the Anderson-Darling test, and 2) an application for decoding of Low-Density Parity-Check (LDPC) codes. An implementation at 133MHz on a Xilinx Virtex-II XC2V4000-6 FPGA produces 133 million samples per second, which is seven times faster than a 2.6GHz Pentium-IV PC; another implementation on a Xilinx Spartan-IIE XC2S300E-7 FPGA at 62MHz is capable of a three times speedup. The performance can be improved by exploiting parallelism: An XC2V4000-6 FPGA with nine parallel instances of the noise generator at 105MHz can run 50 times faster than a 2.6GHz Pentium-IV PC. We illustrate the deterioration of clock speed with the increase in the number of instances.
引用
收藏
页码:1523 / 1534
页数:12
相关论文
共 56 条
[1]   AN ALIAS METHOD FOR SAMPLING FROM THE NORMAL-DISTRIBUTION [J].
AHRENS, JH ;
DIETER, U .
COMPUTING, 1989, 42 (2-3) :159-170
[2]   Very-high radix CORDIC vectoring with scalings and selection by rounding [J].
Antelo, E ;
Lang, T ;
Bruguera, JD .
14TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1999, :204-213
[3]   COMPARISON OF MULTIVARIATE NORMAL GENERATORS [J].
BARR, DR ;
SLEZAK, NL .
COMMUNICATIONS OF THE ACM, 1972, 15 (12) :1048-&
[4]  
BERGSTROM AR, 1997, ECONOMETRIC THEORY, V13
[5]   Design of high speed AWGN communication channel emulator [J].
Boutillon, E ;
Danger, JL ;
Ghazel, A .
ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING, 2003, 34 (02) :133-142
[6]   A NOTE ON THE GENERATION OF RANDOM NORMAL DEVIATES [J].
BOX, GEP ;
MULLER, ME .
ANNALS OF MATHEMATICAL STATISTICS, 1958, 29 (02) :610-611
[7]   The market model of interest rate dynamics [J].
Brace, A ;
Gatarek, D ;
Musiela, M .
MATHEMATICAL FINANCE, 1997, 7 (02) :127-155
[8]   OPTIMAL CURVE FITTING WITH PIECEWISE LINEAR FUNCTIONS [J].
CANTONI, A .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (01) :59-&
[9]  
CAO J, 2001, P 15 IEEE S COMP AR
[10]  
*CEL LTD, 2002, RM100330 CEL LTD