56,468 research outputs found
Characterization of Information Channels for Asymptotic Mean Stationarity and Stochastic Stability of Non-stationary/Unstable Linear Systems
Stabilization of non-stationary linear systems over noisy communication
channels is considered. Stochastically stable sources, and unstable but
noise-free or bounded-noise systems have been extensively studied in
information theory and control theory literature since 1970s, with a renewed
interest in the past decade. There have also been studies on non-causal and
causal coding of unstable/non-stationary linear Gaussian sources. In this
paper, tight necessary and sufficient conditions for stochastic stabilizability
of unstable (non-stationary) possibly multi-dimensional linear systems driven
by Gaussian noise over discrete channels (possibly with memory and feedback)
are presented. Stochastic stability notions include recurrence, asymptotic mean
stationarity and sample path ergodicity, and the existence of finite second
moments. Our constructive proof uses random-time state-dependent stochastic
drift criteria for stabilization of Markov chains. For asymptotic mean
stationarity (and thus sample path ergodicity), it is sufficient that the
capacity of a channel is (strictly) greater than the sum of the logarithms of
the unstable pole magnitudes for memoryless channels and a class of channels
with memory. This condition is also necessary under a mild technical condition.
Sufficient conditions for the existence of finite average second moments for
such systems driven by unbounded noise are provided.Comment: To appear in IEEE Transactions on Information Theor
Low-Latency Short-Packet Transmissions: Fixed Length or HARQ?
We study short-packet communications, subject to latency and reliability
constraints, under the premises of limited frequency diversity and no time
diversity. The question addressed is whether, and when, hybrid automatic repeat
request (HARQ) outperforms fixed-blocklength schemes with no feedback (FBL-NF)
in such a setting. We derive an achievability bound for HARQ, under the
assumption of a limited number of transmissions. The bound relies on
pilot-assisted transmission to estimate the fading channel and scaled
nearest-neighbor decoding at the receiver. We compare our achievability bound
for HARQ to stateof-the-art achievability bounds for FBL-NF communications and
show that for a given latency, reliability, number of information bits, and
number of diversity branches, HARQ may significantly outperform FBL-NF. For
example, for an average latency of 1 ms, a target error probability of 10^-3,
30 information bits, and 3 diversity branches, the gain in energy per bit is
about 4 dB.Comment: 6 pages, 5 figures, accepted to GLOBECOM 201
Substantiation of chamber parameters under combined open-cast and underground mining of graphite ore deposits
The move from open-cast to combined mining method of developing Zavalyevsky deposit of graphite is considered in the paper. The selection of chamber dimension satisfying conditions of long-term stability is one of the questions for scientific substantiation of the move to combined mining method of deposit development.
With this purpose physical and mechanical properties of graphite and enclosing rocks are determined. Stress and strain condition of rocks around the chambers using the method of finite elements is studied
An Exact Formula for the Average Run Length to False Alarm of the Generalized Shiryaev-Roberts Procedure for Change-Point Detection under Exponential Observations
We derive analytically an exact closed-form formula for the standard minimax
Average Run Length (ARL) to false alarm delivered by the Generalized
Shiryaev-Roberts (GSR) change-point detection procedure devised to detect a
shift in the baseline mean of a sequence of independent exponentially
distributed observations. Specifically, the formula is found through direct
solution of the respective integral (renewal) equation, and is a general result
in that the GSR procedure's headstart is not restricted to a bounded range, nor
is there a "ceiling" value for the detection threshold. Apart from the
theoretical significance (in change-point detection, exact closed-form
performance formulae are typically either difficult or impossible to get,
especially for the GSR procedure), the obtained formula is also useful to a
practitioner: in cases of practical interest, the formula is a function linear
in both the detection threshold and the headstart, and, therefore, the ARL to
false alarm of the GSR procedure can be easily computed.Comment: 9 pages; Accepted for publication in Proceedings of the 12-th
German-Polish Workshop on Stochastic Models, Statistics and Their
Application
- …