Abstract
dc:description"A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. This thesis gives two constructions for large spherical codes that may be used for channel coding and for source coding. The first construction ""wraps"" a finite subset of any sphere packing onto the unit sphere in one higher dimension. The second construction is similar to the recursive construction of laminated lattices. Both constructions result in codes that are asymptotically optimal with respect to minimum distance, and the first construction can be efficiently used as part of a vector quantizer for a memoryless Gaussian source. Both constructions are structured so that codepoints may be identified without having to store the entire codebook. For several different rates, the distortion performance of the proposed quantizer is better than previously published results of quantizers with equivalent complexities."
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Electrical Engineering
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hamkins, Jon
- Contributors dc:contributor
-
- Vardy, Alexander
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- Copyright 1996 Hamkins, Jon
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
9780591198850
AAI9712295
(UMI)AAI9712295 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/20964