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)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/22902 |
| Date | January 2018 |
| Creators | Elzouki, Dania |
| Contributors | Dumitrescu, Sorina, Chen, Jun, Electrical and Computer Engineering |
| Source Sets | McMaster University |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0025 seconds