Joint source-channel coding (JSCC) has been acknowledged to have
superior performance over separate source-channel coding in terms of
coding efficiency, delay and complexity. In the first part of this
thesis, we study a hybrid digital-analog (HDA) JSCC system to
transmit a memoryless Gaussian source over a memoryless Gaussian
channel under bandwidth compression. Information-theoretic upper
bounds on the asymptotically optimal mean squared error distortion
of the system are obtained. An allocation scheme for distributing
the channel input power between the analog and the digital signals
is derived for the HDA system with mismatched channel conditions. A
low-complexity and low-delay version of the system is next designed
and implemented. We then propose an image communication application
demonstrating the effectiveness of HDA coding.
In the second part of this thesis, we consider problems in
information hiding. We begin by considering a single-user joint
compression and private watermarking (JCPW) problem. For memoryless
Gaussian sources and memoryless Gaussian attacks, an exponential
upper bound on the probability of error in decoding the watermark is
derived. Numerical examples show that the error exponent is positive
over a (large) subset of the entire achievable region derived by
Karakos and Papamarcou (2003).
We then extend the JCPW problem to a multi-user setting. Two
encoders independently embed two secret information messages into
two correlated host sources subject to a pair of tolerable
distortion levels. The (compressed) outputs are subject to multiple
access attacks. The tradeoff between the achievable watermarking
rates and the compression rates is studied for discrete memoryless
host sources and discrete memoryless multiple access channels. We
derive an inner bound and an outer bound with single-letter
characterization for the achievable compression and watermarking
rate region. We next consider a problem where two correlated sources
are separately embedded into a common host source. A single-letter
sufficient condition is established under which the sources can be
successfully embedded into the host source under multiple access
attacks. Finally, we investigate a public two-user information
hiding problem under multiple access attacks. Inner and outer bounds
for the embedding capacity region are obtained with single-letter
characterization. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2007-09-28 23:11:21.398
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OKQ.1974/780 |
| Date | 02 October 2007 |
| Creators | Wang, Yadong |
| Contributors | Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.)) |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Format | 3178730 bytes, application/pdf |
| Rights | This publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner. |
| Relation | Canadian theses |
Page generated in 0.0019 seconds