Generating Cyclic-Random Sequences in a Constrained Space for In-System Validation

DOI10.1109/TC.2016.2560840MaRDI QIDQ2985164zbMATH OpenFDO

Authors Xiaobing Shi, Nicola Nicolici

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2016.2560840

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Secure Random Number Generation in Continuous Variable Systems
• Random generation with cycle type restrictions
• Generation of pseudorandom sequence using regula-falsi method
• Linear-time generation of uniform random derangements encoded in cycle notation
• Producing reliable initialization and test of sequential circuits with pseudorandom vectors
• Efficient generation of random derangements with the expected distribution of cycle lengths
• Synthesis of pseudorandom test pattern generators
• Pseudorandom sequence generators based on shift registers over finite chain rings

Cited in

(1)

• Random generation with cycle type restrictions

This page was built for publication: Generating Cyclic-Random Sequences in a Constrained Space for In-System Validation

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