Mathematics and Statistics, Department of
http://hdl.handle.net/1974/6
Queen's University Information2017-09-21T10:14:39ZChannel Optimized Scalar Quantization over Orthogonal Multiple Access Channels with Memory
http://hdl.handle.net/1974/22701
Channel Optimized Scalar Quantization over Orthogonal Multiple Access Channels with Memory
Preusser, Kiraseya
In this thesis, the joint source-channel coding method, channel optimized scalar quantization, is applied to real-valued, correlated data. The data is sent over the orthogonal multiple access channel, with non-binary noisy discrete channels with memory as the two sub-channels. Three different schemes are compared for this system: in the first scheme encoding and decoding are performed independently, in the second scheme encoding is done independently and joint decoding is carried out, and the third scheme is with jointly optimized encoders and joint decoding. The goal is to derive optimality conditions that will result in a lower end-to-end distortion. To this end, necessary optimality conditions for the two latter schemes are fully derived and implemented for the bivariate Gaussian and bivariate Laplacian distributions of varying correlation.\\
The first and second methods are then further compared, by implementing them for an image transmission system. Here the images are first processed with the 2 dimensional discrete cosine transform, and then encoded using channel optimized scalar quantization. At the decoder, two different methods are used, the independent and joint decoder.\\
In addition to comparing the different coding methods, various channels characteristics are exploited. For example, the non-binary noisy discrete channel can be used to model memory and the $2^q$-ary output allows for performance improvement via soft-decision decoding. It is observed that by taking the source correlation into consideration, significant signal-to-distortion ratio gains can be achieved. For example, the highest gain incurred from the third scheme is when the bivariate Gaussian is compressed at rate 2, where the gain in signal-to-distortion ratio due to source correlation is 10.90 dB.
Ensemble Controllability of Linear Control Systems
http://hdl.handle.net/1974/22651
Ensemble Controllability of Linear Control Systems
Adu, Daniel
This thesis is concerned about ensemble controllability. We give an overview of the notions of ensemble controllability, in particular, $L_{2}$-ensemble controllability, and uniform ensemble controllability. We review the results presented in~\cite{UH-MS:14} on uniform ensemble controllability of one-parameter time-invariant linear systems and in~\cite{JSL:11} on $L_{2}$-ensemble controllability. In contrast to the notions in~\cite{UH-MS:14} and~\cite{JSL:11}, we investigate on the possibility to steer an ensemble using constrained control signals in the unit interval, which we call uniform~\emph{null}~ensemble controllability for one-parameter time-invariant linear systems using constrained control signals in the unit interval. We give a necessary as well as a sufficient condition for uniform~\emph{null}~ensemble controllability of one-parameter time-invariant linear systems using constrained control signals in the unit interval. Using tools from complex approximation theory, we show that in the discrete-time scenario, the problem of uniform~\emph{null}~ensemble controllability of one-parameter time-invariant linear systems using control signals in the unit interval is equivalent to polynomial approximation problem.
2017-01-01T00:00:00ZPush-sum Algorithm on Time-varying Random Graphs
http://hdl.handle.net/1974/22039
Push-sum Algorithm on Time-varying Random Graphs
Rezaeinia, Pouya
In this thesis, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push- sum algorithms to such random scenarios. Provided that an ergodicity notion, which we term the directed infinite flow property, holds and the auxiliary states of nodes are uniformly bounded away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a time-varying B-irreducible sequence of probability matrices, we establish convergence rates for the proposed push-sum algorithm.
Global Fluctuations of Random Matrices and the Second-Order Cauchy Transform
http://hdl.handle.net/1974/22033
Global Fluctuations of Random Matrices and the Second-Order Cauchy Transform
Diaz Torres, Mario
In this thesis we study the global fluctuations of random matrices (i.e., the covariance of two traces) from a second-order free probability perspective, putting a particular emphasis on block Gaussian matrices. Our main contributions are threefold.
First, we provide a formula for the second-order Cauchy transform of block Gaussian matrices in terms of the corresponding (matrix-valued) Cauchy transform. In order to do this, we introduce a (matrix-valued) second-order conditional expectation, in the spirit of the conditional expectations in operator-valued free probability theory.
Second, we establish a criterion, based on the positivity of a cluster function, that guarantees the existence of a particular integral representation for the second-order Cauchy transform. This approach is based on some relations between the moments and fluctuation moments of a measure on the plane.
Finally, we prove that under some conditions the covariance of resolvents converges to the second-order Cauchy transform. In fact, these conditions also ensure the convergence of the covariance of analytic linear statistics to a certain contour integral depending on the second-order Cauchy transform. In this context, we make explicit the relation between the notion of second-order limit distribution and the asymptotic Gaussianity of continuously differentiable linear statistics.