This paper studies sufficient conditions on information rate and control for stability of remote LTI systems connected over noisy forward and reverse (feedback) channels. In particular we consider discrete memoryless (DMC), Gaussian and erasure channels. We study zero-delay, time-invariant coding and decoding policies with memoryless control. For Gaussian channels we provide an achievable regio...

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of the random binning technique used by Gel’fand and Pinsker for the problem with non-causal channel state information at the encoder in point to point communi...

Abstract—It has been widely recognized that bistable behavior of random access protocols may suddenly deteriorate the performance of the system due to the unexpected slip into an undesired stable operating point. The catastrophe theory succeeds in presenting the bistable region of random access protocols, where packet retransmissions occur in a memoryless manner. In this correspondence, the sta...

In this paper, three existing reduction techniques are applied to different Orthogonal Freqency Division Multiplexing (OFDM) in Continuous Phase Modulation (CPM) mappers. particularly, selecteive mapping (SLM), partial transmit sequence (PTS), and clippling and filtering (CF) techniques are investigated. The analysis was performed for an OFDM system with CPM mappers with 128 and subcarriers. it...

The firstand second-order optimum achievable exponents in the simple hypothesis testing problem are investigated. The optimum achievable exponent for type II error probability, under the constraint that the type I error probability is allowed asymptotically up to ε, is called the ε-optimum exponent. In this paper, we first give the second-order ε-optimum exponent in the case where the null hypo...

It is shown that the capacity C'b of a stationary nonanticipatory channel with respect to block coding is at least as great as the capacity C~ of the channel with respect to sliding block coding. For several types of stationary nonanticipatory channels (namely, ergodic channels, channels with additive random noise, and averaged channels whose components are discrete memoryless channels), it is ...

For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. AugustinLegendre capacity, center, and radius are introduced and proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing bounds with polynomial prefactors are derived for codes on two families of channels: ...

The finite horizon control of time-invariant linear systems with a finite number of point and distributed time delays is considered. The controller is obtained by solving coupled Riccati-type partial differential equations. The solutions to these equations and the resulting controllers are approximated by series expansions in powers of the largest delay. Unlike the infinite horizon case, these ...

A simple two-state Markov chain A Markov chain, named after Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized as memoryless: the next state depends only on the current state and not on the sequence of events that preceded it. This specific kind of "memoryless...