Results 1  10
of
1,631
Finite alphabet control and estimation
 International Journal of Control, Automation and Systems
"... Abstract: In many practical problems in signal processing and control, the signal values are often restricted to belong to a finite number of levels. These questions are generally referred to as “finite alphabet ” problems. There are many applications of this class of problems including: onoff cont ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract: In many practical problems in signal processing and control, the signal values are often restricted to belong to a finite number of levels. These questions are generally referred to as “finite alphabet ” problems. There are many applications of this class of problems including: on
On Finite Alphabets and Infinite Bases
, 2007
"... Van Glabbeek (1990) presented the linear time – branching time spectrum of behavioral semantics. He studied these semantics in the setting of the basic process algebra BCCSP, and gave finite, sound and groundcomplete, axiomatizations for most of these semantics. Groote (1990) proved for some of van ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
by giving a finite sound and groundcomplete axiomatization that is ωcomplete, or negatively by proving that such a finite basis for the equational theory does not exist. We prove that in case of a finite alphabet with at least two actions, failure semantics affords a finite basis, while for ready
REVERSALS AND TRANSPOSITIONS OVER FINITE ALPHABETS
 VOL. 19, NO. 1, PP. 224–244 C ○ 2005 SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
, 2005
"... Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NPhard, while for “dense” instan ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NPhard, while for “dense
Nonintersecting Subspaces Based on Finite Alphabets
, 2003
"... Two subspaces of a vector space are here called “nonintersecting” if they meet only in the zero vector. The following problem arises in the design of noncoherent multipleantenna communications systems. How many pairwise nonintersecting Mtdimensional subspaces of an mdimensional vector space V ove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A ⊆ F? The most important case is when F is the field of complex numbers C; then Mt is the number of antennas. If A = F = GF(q) it is shown that the number of nonintersecting
1On Finite Alphabet Compressive Sensing
"... Abstract—This paper considers the problem of compressive sensing over a finite alphabet, where the finite alphabet may be inherent to the nature of the data or a result of quantization. There are multiple examples of finite alphabet based static as well as timeseries data with inherent sparse struc ..."
Abstract
 Add to MetaCart
Abstract—This paper considers the problem of compressive sensing over a finite alphabet, where the finite alphabet may be inherent to the nature of the data or a result of quantization. There are multiple examples of finite alphabet based static as well as timeseries data with inherent sparse
DETECTION OF SPARSE SIGNALS UNDER FINITEALPHABET CONSTRAINTS
"... In this paper, we solve the problem of detecting the entries of asparsefinitealphabet signal from a limited amount of data, for instance obtained by compressive sampling. While existing methods either rely on the sparsity property, the finitealphabet property, or none of those properties to solve t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
the underdetermined system of linear equations, we capitalize on both the sparsity and the finitealphabet features of the signal. The problem is first formulated in a Bayesian framework to incorporate the prior knowledge of sparsity, which is then shown to be solvable using sphere decoding (SD
On finite alphabets and infinite bases III: Simulation
 Proc. CONCUR’06, LNCS 4137
, 2006
"... Abstract. This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a fin ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a
Construction of Resilient Functions Over a Finite Alphabet
, 1996
"... : We extend the notions of correlationimmune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform c ..."
Abstract
 Add to MetaCart
: We extend the notions of correlationimmune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform
1Universal Divergence Estimation for Finitealphabet Sources
"... We study universal estimation of divergence from the realizations of two unknown finitealphabet sources. We present two algorithms using techniques from data compression. The first divergence estimator applies the BurrowsWheeler block sorting transform to the concatenation of the two realizations; ..."
Abstract
 Add to MetaCart
We study universal estimation of divergence from the realizations of two unknown finitealphabet sources. We present two algorithms using techniques from data compression. The first divergence estimator applies the BurrowsWheeler block sorting transform to the concatenation of the two realizations
Universal divergence estimation for finitealphabet sources
 IEEE Trans. Inf. Theory
, 2006
"... Abstract—This paper studies universal estimation of divergence from the realizations of two unknown finitealphabet sources. Two algorithms that borrow techniques from data compression are presented. The first divergence estimator applies the Burrows–Wheeler block sorting transform to the concatenat ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract—This paper studies universal estimation of divergence from the realizations of two unknown finitealphabet sources. Two algorithms that borrow techniques from data compression are presented. The first divergence estimator applies the Burrows–Wheeler block sorting transform
Results 1  10
of
1,631