Pseudo‐random Gaussian distribution through optimised LFSR permutations

2015/11/06 by C. Condo, Carlo Condo, Warren J. Gross +1 · 1 citation
Computer Science · #Algorithms and Data Compression #Error Correcting Code Techniques #Chaos-based Image/Signal Encryption

paper · pdf · doi:10.1049/el.2015.3418

Abstract

Efficient hardware solutions to generate Gaussian‐distributed random numbers are required in many applications. Linear feedback shift registers (LFSRs) are a low‐complexity implementation of an approximated uniform pseudo‐random distribution: multiple LFSRs can be used in combination to approximate a Gaussian distribution with a low complexity cost. The technique proposed in this work exploits the same principle but relies on a single LFSR and ad‐hoc permutations of its bits to obtain an accurate approximation of a Gaussian distribution with low maximum autocorrelation, leading to a very low complexity implementation of a Gaussian pseudo‐random number generator.

Cited by

• All-optical pseudo noise sequence generator using a micro-ring resonator. [europepmc]

Related

• LFSR based RNG on low cost FPGA for QKD applications
• Pseudo-random generators using linear feedback shift registers with output extraction
• Generating gaussian pseudorandom noise with binary sequences
• Revisiting LFSMs
• An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence