CaltechTHESIS
  A Caltech Library Service

Network source coding: theory and code design for broadcast and multiple access networks

Citation

Zhao, Qian (2003) Network source coding: theory and code design for broadcast and multiple access networks. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-05302003-125004

Abstract

In the information age, network systems and applications have been growing rapidly to provide us with more versatile and high bit rate services. However, the limited bandwidth restricts the amount of information that can be sent through the networks. Thus efficient data representation or source coding is imperative for future network development. Distinct from the traditional source coding strategy, network source codes take advantage of the network topology and are able to maximally compress data before transmission. In this thesis, I present a variety of source coding techniques for use in network environments and demonstrate the benefits of network source codes over traditional source codes from both theoretical and practical perspectives. First, I address source coding for broadcast systems. The results I obtain include derivation of the theoretical limits of broadcast system source codes, algorithm design for optimal broadcast system vector quantizers, implementation of the optimal code, and experimental results. Then, I focus on multiple access systems which are the dual systems of broadcast systems. I present the properties of multiple access source codes and generalize traditional entropy code design algorithms to attain the corresponding optimal multiple access source codes for arbitrary joint source statistics. I further introduce a family of polynomial complexity code design algorithms that approximates the optimal solutions. Application to universal coding for multiple access networks when the joint source statistics are unknown a priori is briefly discussed. Finally, I demonstrate algorithmic performance by showing experimental results on a variety of data sets. Finally, in seeking a simple lossy source coding method for general networks, I apply entropy constrained dithered quantization in network source code design and present the coding results for multi-resolution source codes and multiple access source codes. Multi-resolution and multiple access dithered quantizers are low complexity codes that achieve performance very close to the theoretical rate-distortion bound.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:broadcast systems; lossless; lossy; multi-resolution; multiple access systems; near-lossless; network source coding; vector quantization
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Effros, Michelle
Thesis Committee:
  • Effros, Michelle (chair)
  • Bruck, Jehoshua
  • McEliece, Robert J.
  • Low, Steven H.
  • Abu-Mostafa, Yaser S.
Defense Date:19 May 2003
Author Email:qianz (AT) caltech.edu
Funders:
Funding AgencyGrant Number
NSFCCR-9909026
NSFCCR-0220039
Caltech's Lee Center for Advanced NetworkingUNSPECIFIED
Howard Oringer ScholarshipUNSPECIFIED
Chinese-American Engineers and Scientist Association of Southern California ScholarshipUNSPECIFIED
Record Number:CaltechETD:etd-05302003-125004
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-05302003-125004
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2289
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:30 May 2003
Last Modified:26 Dec 2012 02:49

Thesis Files

[img]
Preview
PDF (Zhao_Qian_thesis.pdf) - Final Version
See Usage Policy.

4035Kb

Repository Staff Only: item control page