Abstract
Algorithm description, block diagram, and complete C source code for a fast Gaussian noise generator which uses only integer operations and table lookups are presented. The algorithm achieves its speed of computation by using table lookups to eliminate the need for evaluating transcendental functions. The lookup table requires only 32768 bytes of memory-a small size, even for a personal computer. By using a larger lookup table, the quantization step size can be decreased and the range of coverage increased. Implementation on a Motorola 68020 processor, the generator produced a million Gaussian numbers in 12 s, which is ten times faster than a floating-point random number generator executed with a Motorola 68020-68881 combination. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
