<p> This thesis studies the multiple description vector quantization with lattice codebooks
(MDLVQ).</p> <p> The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is
optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prove, under the assumption of high resolution, that the algorithm is optimal for K = 2. The optimality holds for many commonly used good lattices of any dimensions, over the entire range of achievable central distortions given the side entropy rate. The optimality is in terms of minimizing the expected distortion given the side description loss rate and given the side entropy rate. We conjecture it to be optimal for K > 2 in general.</p> <p> We also made progress in the analysis of MDLVQ performance. The first exact closed form expression of the expected distortion was derived for K = 2. For K > 2, we improved the current asymptotic expression of the expected distortion.</p> / Thesis / Master of Applied Science (MASc)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/21853 |
| Date | 06 1900 |
| Creators | Huang, Xiang |
| Contributors | Wu, Xiaolin, Electrical and Computer Engineering |
| Source Sets | McMaster University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0022 seconds