Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,604 papers from all fields of science
Search
Sign In
Create Free Account
Pseudorandomness
Known as:
Pseudorandom
, Pseudo random
, Pseudorandom number
Expand
A pseudorandom process is a process that appears to be random but is not. Pseudorandom sequences typically exhibit statistical randomness while being…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
40 relations
Automatic link establishment
Combined Linear Congruential Generator
Comparison of version control software
Computational complexity theory
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Use of the WECC WAMS in Wide-Area Probing Tests for Validation of System Performance and Modeling
John F. Hauer
,
W. Mittelstadt
,
+4 authors
Daniel J. Trudnowski
IEEE Transactions on Power Systems
2009
Corpus ID: 20671241
During 2005 and 2006, the western electricity coordinating council (WECC) performed three major tests of western system dynamics…
Expand
Highly Cited
2007
Highly Cited
2007
An Improved Method of Content Based Image Watermarking
A. Parthasarathy
,
S. Kak
IEEE transactions on broadcasting
2007
Corpus ID: 8833326
We consider texture, luminance, corner and the edge information in the image to generate a mask that makes the addition of the…
Expand
Highly Cited
2006
Highly Cited
2006
A high-speed 850-nm optical receiver front-end in 0.18-/spl mu/m CMOS
C. Hermans
,
M. Steyaert
IEEE Journal of Solid-State Circuits
2006
Corpus ID: 25614434
A high-speed optical interface circuit for 850-nm optical communication is presented. Photodetector, transimpedance amplifier…
Expand
Highly Cited
2004
Highly Cited
2004
Personalised cryptographic key generation based on FaceHashing
A. Teoh
,
D. Ngo
,
A. Goh
Computers & security
2004
Corpus ID: 8286447
Highly Cited
2002
Highly Cited
2002
A New Robust Watermark Embedding into Wavelet DC Components
S. Joo
,
Young-Ho Suh
,
Jaeho Shin
,
H. Kikuchi
2002
Corpus ID: 62163728
In this paper, we propose a non‐blind watermarking method that embeds a pseudo‐random sequence (watermarks) into wavelet DC…
Expand
Highly Cited
2001
Highly Cited
2001
Distribution of Modular Sums and the Security of the Server Aided Exponentiation
Phong Q. Nguyen
,
I. Shparlinski
,
J. Stern
2001
Corpus ID: 15153227
We obtain some uniformity of distribution results for the values of modular sums of the form $$\sum\limits_{j = 1}^n {a_j x_j…
Expand
Highly Cited
1999
Highly Cited
1999
Low Power BIST by Filtering Non-Detecting Vectors
S. Manich
,
A. Gabarró
,
+7 authors
Marcelino B. Santos
European Test Workshop (Cat. No.PR00390)
1999
Corpus ID: 17848007
In this paper, two techniques to reduce the energy and the average power consumption of the system are proposed. They are based…
Expand
Highly Cited
1999
Highly Cited
1999
On calculating efficient LFSR seeds for built-in self test
C. Fagot
,
O. Gascuel
,
P. Girard
,
C. Landrault
European Test Workshop (Cat. No.PR00390)
1999
Corpus ID: 15409833
Linear Feedback Shift Registers (LFSRs) are commonly used as pseudo-random test pattern generators (TPGs) in BIST schemes. This…
Expand
Highly Cited
1991
Highly Cited
1991
ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHS
LaNae J. Avra
, Proceedings. International Test Conference
1991
Corpus ID: 46399161
This paper describes a technique and program for automatically synthesizing a self-testable data path structure given a scheduled…
Expand
Highly Cited
1991
Highly Cited
1991
Prime-phase sequences with periodic correlation properties better than binary sequences
Vijay Kumar
,
O. Moreno
IEEE Transactions on Information Theory
1991
Corpus ID: 2195138
For the case where p is an odd prime, n>or=2 is an integer, and omega is a complex primitive pth root of unity, a construction is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE