Generating gaussian pseudorandom noise with binary sequences
Abstract: Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the applicability of uniform pseudorandom binary generators in combination with the Central Limit Theorem to propose an easy to implement, efficient and flexible algorithm that leverages the properties of the pseudorandom binary generator used as an input, specially with respect to the correlation measure of higher order, to guarantee the quality of the generated samples. Our main result provides a relationship between the pseudorandomness of the input and the statistical moments of the output. We propose a design based on the combination of pseudonoise sequences commonly used on wireless communications with known hardware implementation, which can generate sequences with guaranteed statistical distribution properties sufficient for many real life applications and simple machinery. Initial computer simulations on this construction show promising results in the quality of the output and the computational resources in terms of required memory and complexity.
- J. S. Malik and A. Hemani, “Gaussian random number generation: A survey on hardware architectures,” ACM Computing Surveys (CSUR), vol. 49, no. 3, pp. 1–37, 2016.
- A. Alimohammad, S. F. Fard, B. F. Cockburn, and C. Schlegel, “A compact and accurate gaussian variate generator,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 16, no. 5, pp. 517–527, 2008.
- J. E. Marengo, D. L. Farnsworth, and L. Stefanic, “A geometric derivation of the irwin-hall distribution,” International Journal of Mathematics and Mathematical Sciences, vol. 2017, 2017.
- S. Wainberg and J. Wolf, “Subsequences of pseudorandom sequences,” IEEE Transactions on Communication Technology, vol. 18, no. 5, pp. 606–612, 1970.
- Z. Chen, A. I. Gómez, D. Gómez-Pérez, and A. Tirkel, “Correlation measure, linear complexity and maximum order complexity for families of binary sequences,” Finite Fields and Their Applications, vol. 78, no. nil, p. 101977, 2022.
- A. I. Gómez, D. Gomez-Perez, and A. Tirkel, “Correlation measure of binary sequence families with trace representation,” in Arithmetic of Finite Fields, S. Mesnager and Z. Zhou, Eds. Cham: Springer International Publishing, 2023, pp. 313–319.
- M. Kang, “Fpga implementation of gaussian-distributed pseudo-random number generator,” in 6th International Conference on Digital Content, Multimedia Technology and its Applications. IEEE, 2010, pp. 11–13.
- C. Condo and W. Gross, “Pseudo-random gaussian distribution through optimised lfsr permutations,” Electronics Letters, vol. 51, no. 25, pp. 2098–2100, 2015.
- G. Cotrina, A. Peinado, and A. Ortiz, “Gaussian pseudorandom number generator based on cyclic rotations of linear feedback shift registers,” Sensors, vol. 20, no. 7, p. 2103, 2020.
- ——, “Gaussian pseudorandom number generator using linear feedback shift registers in extended fields,” Mathematics, vol. 9, no. 5, p. 556, 2021.
- K. Gyarmati, “On a family of pseudorandom binary sequences,” Periodica Mathematica Hungarica, vol. 49, pp. 45–63, 2004.
- I. Song and S. Lee, “Explicit formulae for product moments of multivariate gaussian random variables,” Statistics & Probability Letters, vol. 100, pp. 27–34, 2015.
- I. Song, “A proof of the explicit formula for product moments of multivariate gaussian random variables,” arXiv preprint arXiv:1705.00163, 2017.
- H. Davenport and P. Erdos, “The distribution of quadratic and higher residues,” Publ. Math. Debrecen, vol. 2, no. 3-4, pp. 252–265, 1952.
- D. V. Sarwate and M. B. Pursley, “Crosscorrelation properties of pseudorandom and related sequences,” Proceedings of the IEEE, vol. 68, no. 5, pp. 593–619, 1980.
- J. Folláth, “Construction of pseudorandom binary sequences using additive characters over gf (2 k),” Periodica Mathematica Hungarica, vol. 57, no. 1, pp. 73–81, 2008.
- J. K. Tugnait, “Detection of non-gaussian signals using integrated polyspectrum,” IEEE transactions on signal processing, vol. 42, no. 11, pp. 3137–3149, 1994.
- D. R. Green, “The utility of higher-order statistics in gaussian noise suppression,” Ph.D. dissertation, Naval Postgraduate School, 2003.
- J. Lindholm, “An analysis of the pseudo-randomness properties of subsequences of long m-sequences,” IEEE Transactions on Information Theory, vol. 14, no. 4, pp. 569–576, 1968.
- H. F. Jordan and D. C. Wood, “On the distribution of sums of successive bits of shift-register sequences,” IEEE Transactions on Computers, vol. 100, no. 4, pp. 400–408, 1973.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.