1 |
New bounding techniques for channel codes over quasi-static fading channelsHu, Jingyu 01 April 2005 (has links)
This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the demanding need for higher capacity and more reliable wireless communication systems. Although there have been some published results on analyzing the performance of channel codes over QSFCs, most of them produced quite loose performance upper bounds. In this thesis, the general Gallager bounding approach which provides convergent upper bounds of coded systems over QSFCs is addressed first. It is shown that previous Gallager bounds employing trivial low SNR bounds tended to be quite loose. Then improved low instantaneous SNR bounds are derived for two classes of convolutional codes including turbo codes. Consequently, they are combined with the classical Union-Chernoff bound to produce new performance upper bounds for simple convolutional and turbo codes over single-input single-output (SISO) QSFCs. The new bound provides a much improved alternative to characterizing the performance of channel codes over QSFCs over the existing ones. Next the new bounding approach is extended to cases of serially concatenated space-time block codes, which show equivalence with SISO QSFCs. Tighter performance bounds are derived for this coding scheme for two specific cases: first a convolutional code, and later a turbo code. Finally, the more challenging cases of multiple-input multiple-output (MIMO) QSFCs are investigated. Several performance upper bounds are derived for the bit error probability of different cases of space-time trellis codes (STTC) over QSFCs using a new and tight low SNR bound. Also included in this work is an algorithm for computing the unusual information eigenvalue spectrum of STTCs.
|
2 |
New bounding techniques for channel codes over quasi-static fading channelsHu, Jingyu 01 April 2005 (has links)
This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the demanding need for higher capacity and more reliable wireless communication systems. Although there have been some published results on analyzing the performance of channel codes over QSFCs, most of them produced quite loose performance upper bounds. In this thesis, the general Gallager bounding approach which provides convergent upper bounds of coded systems over QSFCs is addressed first. It is shown that previous Gallager bounds employing trivial low SNR bounds tended to be quite loose. Then improved low instantaneous SNR bounds are derived for two classes of convolutional codes including turbo codes. Consequently, they are combined with the classical Union-Chernoff bound to produce new performance upper bounds for simple convolutional and turbo codes over single-input single-output (SISO) QSFCs. The new bound provides a much improved alternative to characterizing the performance of channel codes over QSFCs over the existing ones. Next the new bounding approach is extended to cases of serially concatenated space-time block codes, which show equivalence with SISO QSFCs. Tighter performance bounds are derived for this coding scheme for two specific cases: first a convolutional code, and later a turbo code. Finally, the more challenging cases of multiple-input multiple-output (MIMO) QSFCs are investigated. Several performance upper bounds are derived for the bit error probability of different cases of space-time trellis codes (STTC) over QSFCs using a new and tight low SNR bound. Also included in this work is an algorithm for computing the unusual information eigenvalue spectrum of STTCs.
|
3 |
Mathematical Modeling and Dynamic Recovery of Power SystemsGarcia Hilares, Nilton Alan 19 May 2023 (has links)
Power networks are sophisticated dynamical systems whose stable operation is essential to modern society. We study the swing equation for networks and its linearization (LSEN) as a tool for modeling power systems. Nowadays, phasor measurement units (PMUs) are used across power networks to measure the magnitude and phase angle of electric signals. Given the abundant data that PMUs can produce, we study applications of the dynamic mode decomposition (DMD) and Loewner framework to power systems. The matrices that define the LSEN model have a particular structure that is not recovered by DMD. We thus propose a novel variant of DMD, called structure-preserving DMD (SPDMD), that imposes the LSEN structure upon the recovered system. Since the solution of the LSEN can potentially exhibit interesting transient dynamics, we study the transient growth for the exponential matrix related to the LSEN. We follow Godunov's approach to get upper bounds for the transient growth and also analyze the relationship of such bounds with classical bounds based on the spectrum, numerical range, and pseudospectra. We show how Godunov's bounds can be optimized to bound the solution operator at a given time. The Loewner framework provides a tool for identifying a dynamical system from tangential measurements. The singular values of Loewner matrices guide the discovery of the true order of the underlying system. However, these singular values can exhibit rapid decay when the interpolation points are far from the poles of the system. We establish a range of bounds for this decay of singular values and apply this analysis to power systems. / Doctor of Philosophy / Power networks are sophisticated dynamical systems whose stable operation is essential to modern society. We study a mathematical model called the LSEN to understand and recover the dynamics of power networks. The LSEN model defines some matrices that have special structures dictated by the application. We propose a novel method to recover matrices with this desired structure from data. We also study some properties of the solution of the LSEN model related to the exponential of a matrix, connecting classical results with the particular approach that we follow. In the system identification context, we also study bounds on the singular values of Loewner matrices to understand the interplay between the data (measurements of the system) and mathematical artifacts (poles of the system).
|
4 |
Algorithms, measures and upper bounds for satisfiability and related problemsWahlström, Magnus January 2007 (has links)
The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. Better methods of analysis may have an impact not only on these bounds, but on the nature of the algorithms as well. The most classic method of analysis of the running time of DPLL-style ("branching" or "backtracking") recursive algorithms consists of counting the number of variables that the algorithm removes at every step. Notable improvements include Kullmann's work on complexity measures, and Eppstein's work on solving multivariate recurrences through quasiconvex analysis. Still, one limitation that remains in Eppstein's framework is that it is difficult to introduce (non-trivial) restrictions on the applicability of a possible recursion. We introduce two new kinds of complexity measures, representing two ways to add such restrictions on applicability to the analysis. In the first measure, the execution of the algorithm is viewed as moving between a finite set of states (such as the presence or absence of certain structures or properties), where the current state decides which branchings are applicable, and each branch of a branching contains information about the resultant state. In the second measure, it is instead the relative sizes of the modelled attributes (such as the average degree or other concepts of density) that controls the applicability of branchings. We adapt both measures to Eppstein's framework, and use these tools to provide algorithms with stronger bounds for a number of problems. The problems we treat are satisfiability for sparse formulae, exact 3-satisfiability, 3-hitting set, and counting models for 2- and 3-satisfiability formulae, and in every case the bound we prove is stronger than previously known bounds.
|
5 |
On the numerical solution of continuous coupled algebraic Riccati equationsRajasingam, Prasanthan 01 May 2016 (has links)
In this dissertation we first derive a new unified upper solution bound for the continuous coupled algebraic Riccati equation, which arises from the optimal control of a Markovian jump linear system. In particular, we address the issue of rank deficiency with the control matrices. In the case of rank deficiency the existing matrix upper bounds are inapplicable. Moreover, our new result is not restricted to rank deficiency cases only. It now contains the existing results as special cases. Next, an iterative refinement is presented to improve our new unified matrix upper solution bounds. In particular, this iterative refinement determines a monotonically decreasing sequence of upper bounds for the solution of the continuous coupled algebraic Riccati equation. We formulate a new iterative algorithm by modifying this iterative refinement. We also prove that this new algorithm generates a monotonically decreasing sequence of matrix upper solution bounds that converges to the maximal solution of the continuous coupled algebraic Riccati equation. Furthermore, we prove the convergence of an accelerated Riccati iteration which computes a positive semidefinite solution of the continuous coupled algebraic Riccati equation. In particular, we establish sufficient conditions for the convergence of this algorithm. We also prove that for particular initial values this algorithm determines a monotonically increasing sequence of positive semidefinite matrices that converge to the minimal solution of the continuous coupled algebraic Riccati equation. Additionally, we show that for specific initial values this algorithm generates a monotonically decreasing sequence that converges to the maximal solution of the continuous coupled algebraic Riccati equation. In addition, we prove that this accelerated Riccati iteration converges faster than the Riccati iteration. Finally, we formulate a weighted modified accelerated Riccati iteration which is a more generalized Riccati type iteration. All of the existing Riccati iterations are now the special cases of this algorithm. Furthermore, we establish sufficient conditions for the convergence of this algorithm and we prove the monotonic convergence of the sequence generated by this algorithm. We also discuss how the weight and other quantities affect the rate of convergence of this algorithm. Illustrative numerical examples are also presented.
|
6 |
Bornes garanties de l'erreur locale en élastoplasticité / Local strict upper bounds in elastoplasticityBlaysat, Benoît 08 December 2011 (has links)
Ce travail présente une méthode générale fournissant des bornes garanties de l'erreur de discrétisation sur une quantité locale issue d'un calcul éléments finis. Formulée dans un cadre général, la méthode est illustrée sur un cas 2D d'élastoplasticité. Le cadre non-linéaire de cette implémentation a soulevé des problèmes d'un type nouveau au sein de la thématique de vérification. Après avoir défini les problèmes miroir et central, nous proposons des solutions pour les résoudre.La mise en place de l'outil introduit est détaillée. Ainsi, des bornes garanties de l'erreur locale sur une composante de la déformation plastique sont calculées. Une première étude sur des cas académiques est présentée avant de s'intéresser à un cas plus complexe. Enfin une amélioration de la méthode est introduite, permettant l'obtention de bornes plus pertinentes. / This work presents a general method providing good control on the discretization error on a local quantity of a finite element solution. Formulated using a general formulation, this method is illustrated in a 2D case of elastoplasticity. Nonlinear part of this implementation has raised issues of a new type in the subject of verification. Mirror and the central problems are defined, and we offer solutions for both.The implementation of this tool is introduced in detail. Thus, the guarantees bounds of the local error on a component of plastic deformation are calculated. An initial study on academic case is presented before focusing on a more complex one. Finally an improved method is introduced, allowing the calculation of more relevant bounds.
|
7 |
Optimización lineal entera mixta aplicada a problemas de planificación estratégica en electricidadAngulo Cárdenas, Alejandro Alberto January 2015 (has links)
Doctor en Sistemas de Ingeniería / En esta tesis se presentan los resultados del trabajo desarrollado por el autor durante el
periodo en que fue estudiante de doctorado en el Departamento de Industrias de la Universidad
de Chile. El trabajo se centra en la aplicación de técnicas de optimización entera-mixtas
a problemas de planificación estratégica del sector eléctrico, donde el problema de corto plazo
correspondiente al predespacho de unidades de generación en sistemas térmicos es el tema
central en estudio.
En lo relativo al modelamiento del problema de predespacho de unidades, se considera
el análisis de las distintas formulaciones entera-mixtas disponibles en la literatura junto con
una nueva basada en un formulaciones extendidas tipo red. Se investiga su desempeño sobre
un conjunto de instancias reales desde el punto de vista de su eficiencia computacional al
ser resueltas con softwares comerciales. Lo anterior incluye análisis de tiempos de solución,
nodos utilizados e iteraciones de simplex realizadas para distintas tolerancias requeridas. Los
experimentos muestran la calidad de la aproximación propuesta, siendo esta completamente
competitiva respecto a las ya documentadas. Este resultado era esperable, dada la estructura
totalmente unimodular de gran parte de la formulación propuesta, pero para nada justificable
debido al tamaño de la misma. Lo anterior muestra que el efecto del preproceso de los
softwares comerciales puede ser fundamental en algunas formulaciones.
Por otro lado, respecto a la función objetivo del problema de predespacho de unidades, que
por lo general se representa como una función cuadrática de la generación, se presenta una
nueva manera de linealizar su comportamiento de modo que su inclusión en una formulación
entera-mixta lineal tradicional sea eficiente. Esto último debe entenderse a partir de la necesidad
que el tamaño de la aproximación no crezca de manera desmedida si el error requerido
para la misma decrece. Si bien ya existía la posibilidad de hacer esto mediante la aplicación
de la aproximación desarrollada por Ben-Tal y Nemirovsky para conos de segundo orden [2],
acá se presenta un método alternativo, con mejores propiedades numéricas, un orden de magnitud
mejor en calidad de aproximación, y cuya aplicación a problemas reales de predespacho
de unidades genera mejores resultados respecto de las aproximaciones tradicionales.
Por último, con el fin de mejorar el desempeño de la formulación entera-mixta presentada,
se realiza el análisis poliedral de una de sus subestructuras esperando identificar desigualdades
válidas que permitan mejorar su cota dual. Esta subestructura corresponde al knapsack semicontinuo
con restricciones adicionales del tipo generalized upper bound. Se demuestra que bajo
supuestos simples es posible identificar facetas tipo generalized flow cover en espacios restringidos
de dimensión inferior. Luego se llevan estas desigualdades al espacio original utilizando
procedimientos de lifting multidimensional independiente de la secuencia [38, 27, 16, 17] y se
iii
prueba que con supuestos adicionales también son facetas allí. Experimentos computacionales
en instancias derivadas de problemas de UC muestran su eficiencia, donde más de un 50%
del gap integral del nodo raíz se reduce aplicando en promedio solo tres de estos cortes.
Además, en este contexto, también se ha implementado un solver ad-hoc para la solución
eficiente de las relajaciones lineales de la formulación tipo red, con un speed-up del orden de
4x a 8x respecto a CPLEX barrier optimizer, pero que aún no está documentado.
|
8 |
Problém Online Labelingu / The Online Labeling ProblemBulánek, Jan January 2014 (has links)
A sorted array is a fundamental algorithmic concept. Its on-line variant gives rise to the online labeling problem. In the online labeling problem we are given an array of size m and a stream of n integers from the universe {1, ..., r} coming in an arbitrary order. Our task is to maintain all received items in the array in sorted order. The inserted items do not have to be stored consecutively in the array. Since the final order of the items is not known until we see all the items, moves of already inserted items are allowed but should be minimized. We present two algorithms which together provide an optimal solution for almost all values of m as a function of n. We provide tight lower bounds for almost all ranges of m. We introduce a notion of the limited universe and prove lower bounds also in that setting. Some of our lower bounds also apply to randomized algorithms. Powered by TCPDF (www.tcpdf.org)
|
9 |
Obere und untere Schranken für eingeschränkte Parity-Branchingprogramme / Upper and Lower Bounds for Restricted Parity Branching ProgramsBrosenne, Henrik 18 April 2006 (has links)
No description available.
|
10 |
Techniques de coopération appliquées aux futurs réseaux cellulaires / Cooperation strategies for next generation cellular systemsCardone, Martina 24 April 2015 (has links)
Une qualité de service uniforme pour les utilisateurs mobiles et une utilisation distribuée du spectre représentent les ingrédients clés des réseaux cellulaires de prochaine génération. Dans ce but, la coopération au niveau de la couche physique entre les nœuds de l’infrastructure et les nœuds du réseau sans fil a émergé comme une technique à fort potentiel. La coopération s’appuie sur les propriétés de diffusion du canal sans fil, c’est-à-dire que la même transmission peut être entendue par plusieurs nœuds, ouvrant ainsi la possibilité pour les nœuds de s’aider à transmettre les messages à leur destination finale. La coopération promet aussi d’offrir une façon nouvelle et intelligente de gérer les interférences, au lieu de simplement les ignorer et les traiter comme du bruit. Comprendre comment concevoir ces systèmes radio coopératifs, afin que les ressources disponibles soient pleinement utilisées, est d’une importance fondamentale. L’objectif de cette thèse est de mener une étude du point de vue de la théorie de l’information, pour des systèmes sans fil pertinents dans la pratique, où les nœuds de l’infrastructure coopèrent en essayant d’améliorer les performances du réseau. Les systèmes radio avec des relais semi-duplex ainsi que les scénarios où une station de base aide à servir les utilisateurs mobiles associés à une autre station de base, sont les réseaux sans fil coopératifs étudiés dans cette thèse. Le but principal est la progression vers la caractérisation de la capacité de ces systèmes sans fil au moyen de dérivation de nouvelles bornes supérieures pour les performances et la conception de nouvelles stratégies de transmission permettant de les atteindre. / A uniform mobile user quality of service and a distributed use of the spectrum represent the key-ingredients for next generation cellular networks. Toward this end, physical layer cooperation among the network infrastructure and the wireless nodes has emerged as a potential technique. Cooperation leverages the broadcast nature of the wireless medium, that is, the same transmission can be heard by multiple nodes, thus opening up the possibility that nodes help one another to convey the messages to their intended destination. Cooperation also promises to offer novel and smart ways to manage interference, instead of just simply disregarding it and treating it as noise. Understanding how to properly design such cooperative wireless systems so that the available resources are fully utilized is of fundamental importance.The objective of this thesis is to conduct an information theoretic study on practically relevant wireless systems where the network infrastructure nodes cooperate among themselves in an attempt to enhance the network performance in many critical aspects, such as throughput, robustness and coverage. Wireless systems with half-duplex relay stations as well as scenarios where a base station overhears another base station and consequently helps serving this other base station's associated mobile users, represent the wireless cooperative networks under investigation in this thesis. The prior focus is to make progress towards characterizing the capacity of such wireless systems by means of derivation of novel outer bounds and design of new provably optimal transmission strategies.
|
Page generated in 0.0616 seconds