Show simple item record

Frame Quantization Theory and Equiangular Tight Frames

dc.contributor.advisorBenedetto, John Jen_US
dc.contributor.authorOktay, Onuren_US
dc.date.accessioned2008-04-22T16:06:25Z
dc.date.available2008-04-22T16:06:25Z
dc.date.issued2007-11-27en_US
dc.identifier.urihttp://hdl.handle.net/1903/7733
dc.description.abstractIn this thesis, we first consider the finite frame quantization. We make a signalwise comparison of PCM and first order Sigma-Delta quantization. We show that Sigma-Delta quantization achieves smaller signal-wise quantization error bounds for a class of low amplitude signals. Then, we propose two new quantization methods for finite frames. First method is a variable bit-rate quantization algorithm. Given a finite signal and a predetermined error margin, this method calculates the number of bits necessary to quantize this signal within the pre-specified error margin. Second method is a 1-bit quantization technique that uses functional minimization methods. We first translate the combinatorial quantization problem into an analytic one. Then, we show that the solutions of this this analytic problem correspond to 1-bit quantized estimates of a given finite signal. Second, we focus on finite equiangular tight frames. We show that equiangular tight frames are minimizers of certain functionals. We also give a characterization of equiangular tight frames with maximum possible redundancy.en_US
dc.format.extent5192609 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleFrame Quantization Theory and Equiangular Tight Framesen_US
dc.typeDissertationen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentMathematicsen_US
dc.subject.pqcontrolledMathematicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record