Show simple item record

Quantization Over Discrete Noisy Channels Under Complexity Constraints

dc.contributor.advisorFarvardin, Nen_US
dc.contributor.authorPhamdo, N.en_US
dc.date.accessioned2007-05-23T09:55:04Z
dc.date.available2007-05-23T09:55:04Z
dc.date.issued1993en_US
dc.identifier.urihttp://hdl.handle.net/1903/5443
dc.description.abstractA fundamental problem in communication is the transmission of an information source across a communication channel. According to Shannon's separation principle, this problem can be separated (without loss of optimality) into two different, yet similar, problems: source coding and channel coding. This result, however, holds only when complexity and delay are not an issue. In practical situations, complexity plays a major role in many system designs. When complexity is constrained, treating these two problems jointly may prove to be more fruitful than treating them separately.<P>In this work we consider two approaches to joint source-channel coding of discrete-time, continuous- amplitude sources and discrete memoryless channels when complexity is constrained.<P>In the first approach, we consider the analysis and design of two low-complexity vector quantizer - the tree-structured vector quantizer (TSVQ) and the multistage vector quantizer (MSVQ) - when used over a noisy channel. The resulting schemes are called channel-matched TSVQ and channel- matched MSVQ. These schemes are compared with (i) the ordinary TSVQ and MSVQ which are designed for the noiseless channel and (ii) a tandem source-channel coding scheme in which the source and channel codes are designed separately.<P>In the second approach, we assume a low-complexity quantizer (i.e., source code) is given. Because of its low complexity, the quantizer is sub-optimum and hence certain redundancy remains at its output. Our aim is to make use of this redundancy to combat channel noise. We consider two scenarios: (i) the redundancy is in the form of memory and (ii) it is in the form of a non-uniform distribution.<P>In the second case, we propose the use of a rate- one convolutional code to convert the residual redundancy into a usable form. Comparisons are also made with a tandem source- channel coding scheme.en_US
dc.format.extent5280334 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; PhD 1993-7en_US
dc.subjectdata compressionen_US
dc.subjectdigital communicationsen_US
dc.subjecterror detection codesen_US
dc.subjectinformation theoryen_US
dc.subjectrobust information processingen_US
dc.subjectspeech processingen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleQuantization Over Discrete Noisy Channels Under Complexity Constraintsen_US
dc.typeDissertationen_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record