Some Techniques in Universal Source Coding and Coding for Composite Sources
Wallace, Mark Stanley
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69230
Description
Title
Some Techniques in Universal Source Coding and Coding for Composite Sources
Author(s)
Wallace, Mark Stanley
Issue Date
1982
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Abstract
We consider three problems in source coding. First, we consider the composite source model. A composite source has a switch driven by a random process which selects one of a possible set of subsources. We derive some convergence results for estimation of the switching process, and use these to prove that the entropy of some composite sources may be computed. Some coding techniques for composite sources are also presented and their performance is bounded.
Next, we construct a variable-length-to-fixed-length (VL-FL) universal code for a class of unifilar Markov sources. A VL-FL code maps strings of source outputs into fixed-length codewords. We show that the redundancy of the code converges to zero uniformly over the class of sources as the blocklength increases. The code is also universal with respect to the initial state of the source. We compare the performance of this code to FL-VL universal codes.
We then consider universal coding for real-valued sources. We show that given some coding technique for a known source, we may construct a code for an class of sources. We show that this technique works for some classes of memoryless sources, and also for a compact subset of the class of k-th order Gaussian autoregressive sources.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
