Topic
Upper and lower bounds
About: Upper and lower bounds is a research topic. Over the lifetime, 56902 publications have been published within this topic receiving 1143379 citations. The topic is also known as: majoring or minoring element.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.
Abstract: This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ? isclosely approximated by C - ?(V/n) Q-1(?) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.
3,242 citations
TL;DR: In this paper, a general theory of dissipative dynamical systems is presented, where dissipativeness is defined in terms of an inequality involving the storage function and the supply function, which is bounded from below by the available storage and from above by the required supply.
Abstract: The first part of this two-part paper presents a general theory of dissipative dynamical systems. The mathematical model used is a state space model and dissipativeness is defined in terms of an inequality involving the storage function and the supply function. It is shown that the storage function satisfies an a priori inequality: it is bounded from below by the available storage and from above by the required supply. The available storage is the amount of internal storage which may be recovered from the system and the required supply is the amount of supply which has to be delivered to the system in order to transfer it from the state of minimum storage to a given state. These functions are themselves possible storage functions, i.e., they satisfy the dissipation inequality. Moreover, since the class of possible storage functions forms a convex set, there is thus a continuum of possible storage functions ranging from its lower bound, the available storage, to its upper bound, the required supply. The paper then considers interconnected systems. It is shown that dissipative systems which are interconnected via a neutral interconnection constraint define a new dissipative dynamical system and that the sum of the storage functions of the individual subsystems is a storage function for the interconnected system. The stability of dissipative systems is then investigated and it is shown that a point in the state space where the storage function attains a local minimum defines a stable equilibrium and that the storage function is a Lyapunov function for this equilibrium. These results are then applied to several examples. These concepts and results will be applied to linear dynamical systems with quadratic supply rates in the second part of this paper.
3,124 citations
01 Jan 1962
TL;DR: The theory of automata is shown not capable of representing the actual physical flow of information in the solution of a recursive problem and a theory of communication is proposed that yields a means of representation that with equal rigor and simplicity accomplishes more than the theory of synchronous automata.
Abstract: Diese Arbeit befasst sich mit den begrifflichen Grundlagen einer Theorie der Kommunikation. Die Aufgabe dieser Theorie soll es sein, moglichst viele Erscheinungen bei der Informationsubertragung und Informationswandlung in einheitlicher und exakter Weise zu beschreiben.
The theory of automata is shown not capable of representing the actual physical flow of information in the solution of a recursive problem. The argument proceeds as follows:
1. We assume the following postulates:
a) there exists an upper bound on the speed of signals;
b) there exists an upper bound on the density with which information can be stored.
2. Automata of fixed, finite size can recognize, at best, only iteratively defined classes of input sequences. (See Kleene (11) and Copi, Elgot, and Wright (8).)
3. Recursively defined classes of input sequences that cannot be defined iteratively can be recognized only by automata of unbounded size.
4. In order for an automaton to solve a (soluble) recursive problem, the possibility must be granted that it can be extended unboundedly in whatever way might be required.
5. Automata (as actual hardware) formulated in accordance with automata theory will, after a finite number of extensions, conflict with at least one of the postulates named above.
Suitable conceptual structures for an exact theory of communication are then discussed, and a theory of communication proposed.
All of the really useful results of automata theory may be expressed by means of these new concepts. Moreover, the results retain their usefulness and the new nrocedure has definite advantages over the older ones.
The proposed representation differs from each of the presently known theories concerning information on at least one of the following essential points:
1. The existence of a metric is assumed for either space nor time nor for other physical magnitudes.
2. Time is introduced as a strictly local relation between states.
3. The objects of the theory are discrete, and they are combined and produced only by means of strictly finite techniques.
The following conclusions drawn from the results of this work may be cited as of some practical interest:
1. The tolerance requirements for the response characteristics of computer components can be substantially weakened if the computer is suitably structured.
2. It is possible to design computers structurally in such a way that they are asynchronous, all parts operating in parallel, and can be extended arbitrarily without interrupting their computation.
3. For complicated organizational processes of any given sort the theory yields a means of representation that with equal rigor and simplicity accomplishes more than the theory of synchronous automata.
2,523 citations
TL;DR: This paper presents a new approach for robust MPC synthesis that allows explicit incorporation of the description of plant uncertainty in the problem formulation, and shows that the feasible receding horizon state-feedback control design robustly stabilizes the set of uncertain plants.
2,329 citations
TL;DR: The results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.
Abstract: Consider a Gaussian multiple-access channel shared by K users who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms. The uncoded probability of error achievable by optimum multiuser detectors is investigated. It is shown that the K -user maximum-likelihood sequence detector consists of a bank of single-user matched filters followed by a Viterbi algorithm whose complexity per binary decision is O(2^{K}) . The upper bound analysis of this detector follows an approach based on the decomposition of error sequences. The issues of convergence and tightness of the bounds are examined, and it is shown that the minimum multiuser error probability is equivalent in the Iow-noise region to that of a single-user system with reduced power. These results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.
2,300 citations