Fast Time-Recursive Block Correlators for Pseudorandom Sequences

DOI10.1109/TCSI.2012.2230593MaRDI QIDQ4956806zbMATH OpenFDO

Authors David Akopian, Phanikrishna Sagiraju, Brent Nowak

Publication date 2 September 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCSI.2012.2230593

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On a Fast Version of a Pseudorandom Generator
• Efficient pseudorandom correlation generators from ring-LPN
• Fast and efficient construction of an unbiased random sequence
• scientific article; zbMATH DE number 177547
• A Fast Derandomization Scheme and Its Applications
• Time-analysis of pseudorandom bit generators
• On the correlation of pseudorandom binary sequences with composite moduli
• Correlated pseudorandomness from expand-accumulate codes
• Fast pseudorandom functions based on expander graphs
• Formation of pseudorandom sequences with improved autocorrelation properties

Cited in

(1)

• X-Block: An Efficient LFSR Reseeding-Based Method to Block Unknowns for Temporal Compactors

This page was built for publication: Fast Time-Recursive Block Correlators for Pseudorandom Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956806)