Results 1  10
of
218,977
DETERMINISTIC SEQUENCES FOR COMPRESSIVE MIMO CHANNEL ESTIMATION
"... This paper considers the problem of pilot design for compressive multipleinput multipleoutput (MIMO) channel estimation. In particular, we are interested in estimating the channels for multiple transmitters simultaneously when the pilot sequences are shorter than the combined channels. Existin ..."
Abstract
 Add to MetaCart
ing works on this topic demonstrated that tools from compressed sensing theory can yield accurate multichannel estimation provided that each pilot sequence is randomly generated. Here, we propose constructing the pilot sequence for each transmitter from a small set of deterministic sequences. We
Optimum power control for fading CDMA with deterministic sequences
 in Proc. 40th Annu. Allerton Conf. Communications, Control and Computing
, 2002
"... We characterize the optimum power allocation policy that maximizes the information theoretic sum capacity of a code division multiple access (CDMA) system where the users are assigned arbitrary signature sequences in a frequency flat fading environment. We provide an iterative waterfilling algorithm ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
We characterize the optimum power allocation policy that maximizes the information theoretic sum capacity of a code division multiple access (CDMA) system where the users are assigned arbitrary signature sequences in a frequency flat fading environment. We provide an iterative waterfilling
Working Memory and Its Relation to Deterministic Sequence Learning
, 2012
"... Is there a relation between working memory (WM) and incidental sequence learning? Nearly all of the earlier investigations in the role of WM capacity (WMC) in sequence learning suggest no correlations in incidental learning conditions. However, the theoretical view of WM and operationalization of WM ..."
Abstract
 Add to MetaCart
of WMC made strong progress in recent years. The current study related performance in a coordination and transformation task to sequence knowledge in a fourchoice incidental deterministic serial reaction time (SRT) task and a subsequent free generation task. The responsetostimulus interval (RSI
An Efficient Deterministic Sequence for Samplingbased Motion Planners
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
An efficient deterministic sequence for samplingbased motion planners. unpublished
 the IEEE Int. Symp. on Assembly and Task Planning
, 2005
"... This paper presents a deterministic sequence with good and useful features for samplingbased motion planners. On the one hand, the proposed sequence is able to generate samples over a hierarchical grid structure of the Cspace in an incremental lowdispersion manner. On the other hand it allows to l ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper presents a deterministic sequence with good and useful features for samplingbased motion planners. On the one hand, the proposed sequence is able to generate samples over a hierarchical grid structure of the Cspace in an incremental lowdispersion manner. On the other hand it allows
Deterministic Sequencing of Exploration and Exploitation for MultiArmed Bandit Problems 1
"... In the MultiArmed Bandit (MAB) problem, there is a given set of arms with unknown reward models. At each time, a player selects one arm to play, aiming to maximize the total expected reward over a horizon of length T. An approach based on a Deterministic Sequencing of Exploration and Exploitation ( ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
In the MultiArmed Bandit (MAB) problem, there is a given set of arms with unknown reward models. At each time, a player selects one arm to play, aiming to maximize the total expected reward over a horizon of length T. An approach based on a Deterministic Sequencing of Exploration and Exploitation
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 768 (3 self)
 Add to MetaCart
Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have
Optimum power control for CDMA with deterministic sequences in fading channels
 IEEE Transactions on Information Theory
, 2003
"... Abstract—We specify the capacity region for a powercontrolled, fading codedivision multipleaccess (CDMA) channel. We investigate the properties of the optimum power allocation policy that maximizes the informationtheoretic ergodic sum capacity of a CDMA system where the users are assigned arbitr ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
arbitrary signature sequences in a frequency flatfading environment. We provide an iterative waterfilling algorithm to obtain the powers of all users at all channel fade levels, and prove its convergence. Under certain mild conditions on the signature sequences, the optimum power allocation dictates
On Discrete Stochastic Processes Generated by Deterministic Sequences and Multiplication Machines
"... . We consider a discrete stochastic process X = (X 0 ; X 1 ; \Delta \Delta \Delta ) with finite state space f0; 1; \Delta \Delta \Delta ; b \Gamma 1g, which carries the random asymptotic behaviour of the relative frequency in which the digits appear in the expansion in base b of a linear recurrent s ..."
Abstract
 Add to MetaCart
sequence of real numbers. If ae denotes the dominant root of the characteristic polynomial associated with the linear recurrence relation, by a classical result, the stochastic process X does not depend on the recurrence relation whenever ae ? 1 and log b ae is irrational. We prove that this stochastic
Results 1  10
of
218,977