Results 1  10
of
325
Algebraic Properties of Cellular Automata
, 1984
"... This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary c ..."
Abstract

Cited by 84 (2 self)
 Add to MetaCart
This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary conditions evolving according to the rule Ö(x) = x + x
RandomPattern Coverage Enhancement and Diagnosis for LSSD Logic SelfTest
 IBM Journal of Research and Development
, 1983
"... Embedded linear feedback shift registers can be used for logic component selftest. The issue of test coverage is addressed by circuit modification, where necessary, of randompatternresistant fault nodes. Also given is a procedure that supports netlevel diagnosis for structured logic in the prese ..."
Abstract

Cited by 72 (1 self)
 Add to MetaCart
Embedded linear feedback shift registers can be used for logic component selftest. The issue of test coverage is addressed by circuit modification, where necessary, of randompatternresistant fault nodes. Also given is a procedure that supports netlevel diagnosis for structured logic in the presence of random testpattern generation and signature analysis.
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
 CORNBINATORICA
, 1986
"... Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs ..."
Abstract

Cited by 58 (13 self)
 Add to MetaCart
Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs are proved using the eigenvalues of their adjacency matrices. These graphs enable us to improve previous results on a parallel sorting problem that arises in structural modeling, by describing an explicit algorithm to sort n elements in k time units using O(n ~k) parallel processors, where, e.g., cq=7/4, ~q8/5, 0q=26/17 and ~q=22/15. Our approach also yields several applications to Ramsey Theory and other extremal problems in
Evaluating the Error Probability in Lightwave Systems with Chromatic Dispersion, Arbitrary Pulse Shape and Preand Postdetection Filtering
 J. Lightw. Technol
, 2000
"... Abstract—A novel approach to analytically evaluate the bit error probability in optically preamplified directdetection systems is presented, which can take into account the effects of pulse shaping, chirping, filtering at the transmitter and the receiver, both pre and postdetection, chromatic dis ..."
Abstract

Cited by 54 (9 self)
 Add to MetaCart
(Show Context)
Abstract—A novel approach to analytically evaluate the bit error probability in optically preamplified directdetection systems is presented, which can take into account the effects of pulse shaping, chirping, filtering at the transmitter and the receiver, both pre and postdetection, chromatic dispersion, and ASE noise. The method is computationally very fast in that the saddle point integration method for solving the resulting line integral of a particular moment generating function is adopted. A closedform approximation for the bit error probability is also provided, which is within 0.01 dB from the exact numerical results. I.
Chaotic Complex Spreading Sequences for Asynchronous CDMA  Part II: Some Theoretical Performance Bounds
 IEEE Transaction on Circuit and Systems I: Fundamental Theory and Applications
, 1998
"... Abstract — This paper and its companion are devoted to the evaluation of the impact of chaosbased techniques on communications systems with asynchronous code division multiple access. Sequences obtained by repeating a truncated and quantized chaotic time series are compared with classical msequenc ..."
Abstract

Cited by 49 (2 self)
 Add to MetaCart
Abstract — This paper and its companion are devoted to the evaluation of the impact of chaosbased techniques on communications systems with asynchronous code division multiple access. Sequences obtained by repeating a truncated and quantized chaotic time series are compared with classical msequences and Gold sequences by means of a performance index taken from communication theory which is here defined and thoroughly discussed. This analysis reveals that, unlike conventional sequences, chaotic spreading codes can be generated for any number of users and allocated bandwidth. Numerical simulations are reported, showing that systems based on chaotic spreading sequences perform generally better than the conventional ones. Some analytical tools easing the comprehension of these advantages are here summarized and proved in Part II where formal arguments are developed and discussed to ensure general applicability of chaotic spreading codes. Index Terms — Chaosbased communication systems, codedivision multiple access, sequence generation.
GAC  the Criterion for Global Avalanche Characteristics of Cryptographic Functions
 Journal of Universal Computer Science
, 1995
"... Abstract: We show that some widely accepted criteria for cryptographic functions, including the strict avalanche criterion (SAC) and the propagation criterion, have various limitations in capturing properties of vital importance to cryptographic algorithms, and propose a new criterion called GAC tom ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
(Show Context)
Abstract: We show that some widely accepted criteria for cryptographic functions, including the strict avalanche criterion (SAC) and the propagation criterion, have various limitations in capturing properties of vital importance to cryptographic algorithms, and propose a new criterion called GAC tomeasure the global avalanche characteristics of cryptographic functions. We also introduce two indicators related to the new criterion, one forecasts the sumofsquares while the other the absolute avalanche characteristics of a function. Lower and upper bounds on the two indicators are derived, and two methods are presented to construct cryptographic functions that achieve nearly optimal global avalanche characteristics. Category: E.3 1 Why the GAC In 1985, Webster and Tavares introduced the concept of the strict avalanche criterion (SAC) when searching for principles for designing DESlike data encryption algorithms [Web85, WT86]. A function is said to satisfy the SACif complementing asingle bit results inthe output ofthe function being complemented
SPRNG: A Scalable Library for Pseudorandom Number Generation
"... In this article we present background, rationale, and a description of the Scalable Parallel Random
Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not conside ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
In this article we present background, rationale, and a description of the Scalable Parallel Random
Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods such as the leapfrog or blocking methods. We describe in detail
parameterized versions of the following pseudorandom number generators: (i) linear congruential
generators, (ii) shiftregister generators, and (iii) laggedFibonacci generators. We briey describe
the methods, detail some advantages and disadvantages of each method, and recount results from
number theory that impact our understanding of their quality in parallel applications.
SPRNG was designed around the uniform implementation of dierent families of parameterized random number
generators. We then present a short description of
SPRNG. The description contained within this
document is meant only to outline the rationale behind and the capabilities of SPRNG. Much more
information, including examples and detailed documentation aimed at helping users with putting
and using SPRNG on scalable systems is available at the URL:
http://sprng.cs.fsu.edu/RNG. In this description of SPRNG we discuss the random number generator library as well as the suite of
tests of randomness that is an integral part of SPRNG. Random number tools for parallel Monte
Carlo applications must be subjected to classical as well as new types of empirical tests of ran
domness to eliminate generators that show defects when used in scalable environments.
Neural mechanisms for encoding binocular disparity: receptive field position versus phase
 J Neurophysiol
, 1999
"... mechanisms for encoding binocular disparity: receptive field position ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
mechanisms for encoding binocular disparity: receptive field position
A Practical Method for Approaching the Channel Capacity of Constrained Channels
, 1997
"... A new coding technique is proposed that translates user information into a constrained sequence using very long codewords. Huge error propagation resulting from the use of long codewords is avoided by reversing the conventional hierarchy of the error control code and the constrained code. The new te ..."
Abstract

Cited by 36 (10 self)
 Add to MetaCart
A new coding technique is proposed that translates user information into a constrained sequence using very long codewords. Huge error propagation resulting from the use of long codewords is avoided by reversing the conventional hierarchy of the error control code and the constrained code. The new technique is exemplified by focusing on (d; k)constrained codes. A storageeffective enumerative encoding scheme is proposed for translating user data into long dk sequences and vice versa. For dk runlengthlimited codes, estimates are given of the relationship between coding efficiency versus encoder and decoder complexity. We will show that for most common d; k values, a code rate of less than 0.5% below channel capacity can be obtained by using hardware mainly consisting of a ROM lookup table of size 1 kbyte. For selected values of d and k, the size of the lookup table is much smaller. The paper is concluded by an illustrative numerical example of a rate 256=466, (d =2,k= 15) code, which provides a serviceable 10% increase in rate with respect to its traditional rate 1=2, (2; 7) counterpart. Index TermsConstrained code, enumerative coding, recording code, runlengthlimited. I.