1 |
Flexible Multiple Description Lattice Vector Quantizer with General Number of DescriptionsGao, Zhouyang 11 1900 (has links)
This thesis addresses the design of multiple description lattice vector quantizer (MDLVQ) with a general number L of descriptions, L >= 3.
In the previous work on MDLVQ with L>= 3, once the central and side lattice codebooks are fixed, the decoding quality is determined for all numbers k of received descriptions. Therefore, it is not possible to achieve tradeoffs between the quality of reconstruction for different values of k, 1<= k <= L-1.
In order to overcome the above drawback, we propose two flexible MDLVQ schemes for L >= 3. Our first design employs a different reconstruction method than in prior work and a heuristic index assignment algorithm, which uses L-2 parameters to control the distortions for 2 <= k <= L-1. Experimental results for the cases L=3 and L=4 show that significant tradeoffs are achieved by controlling the parameters mentioned above.
Our second design is based on a structured index assignment. We start with the case L=3 and then generalize the index assignment to any L >= 3. The structured index assignment is able to control the tradeoff by adjusting the sizes of some L-1 subsets of side lattice points. Another important contribution of the thesis is the derivation of analytical expressions of the distortions for the structured index assignment, under the high resolution assumption. These expressions show that a wide range of distortion values can be achieved. / Thesis / Master of Applied Science (MASc)
|
2 |
Lattice-based Robust Distributed Coding Scheme for Correlated SourcesElzouki, Dania January 2018 (has links)
In this thesis we propose two lattice-based robust distributed source coding systems, one for two correlated sources and the other for three correlated sources. We provide a detailed performance analysis under the high resolution assumption. It is shown that, in a certain asymptotic regime, our scheme for two correlated sources achieves the information-theoretic limit of quadratic multiple description coding (MDC) when the lattice dimension goes to infinity, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes is 0.5 bits away from this limit. Our analysis also shows that, under the same asymptotic regime, when the lattice dimension goes to infinity, the proposed scheme for three correlated sources is very close to the theoretical bound for the symmetric quadratic Gaussian MDC problem with single description and all three descriptions decoders. / Thesis / Doctor of Philosophy (PhD)
|
Page generated in 0.1313 seconds