On finite-state vector quantization for noisy channels
dc.contributor.author | Yahampath, P | |
dc.contributor.author | Pawlak, M | |
dc.date.accessioned | 2007-09-07T18:54:56Z | |
dc.date.available | 2007-09-07T18:54:56Z | |
dc.date.issued | 2004-12-31T18:54:56Z | |
dc.description.abstract | Finite-state vector quantization (FSVQ) over a noisy channel is studied. A major drawback of a finite-state decoder is its inability to track the encoder in the presence of channel noise. In order to overcome this problem, we propose a nontracking decoder which directly estimates the code vectors used by a finite-state encoder. The design of channel-matched finite-state vector quantizers for noisy channels, using an iterative scheme resembling the generalized Lloyd algorithm, is also investigated. Simulation results based on encoding a Gauss-Markov source over a memoryless Gaussian channel show that the proposed decoder exhibits graceful degradation of performance with increasing channel noise, as compared with a finite-state decoder. Also, the channel-matched finite-state vector quantizers are shown to outperform channel-optimized vector quantizers having the same vector dimension and rate. However, the nontracking decoder used in the channel-matched finite-state quantizer has a higher computational complexity, compared with a channel-optimized vector-quantizer decoder. Thus, if they are allowed to have the same overall complexity (encoding and decoding), the channel-optimized vector quantizer can use a longer encoding delay and achieve similar or better performance. Finally, an example of using the channel-matched finite-state quantizer as a backward-adaptive quantizer for nonstationary signals is also presented. | en |
dc.format.extent | 474301 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.citation | 0090-6778; IEEE TRANS COMMUN, DEC 2004, vol. 52, no. 12, p.2125 to 2133. | en |
dc.identifier.doi | http://dx.doi.org/10.1109/TCOMM.2004.838736 | |
dc.identifier.uri | http://hdl.handle.net/1993/2789 | |
dc.language.iso | eng | en_US |
dc.rights | ©2004 IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Manitoba's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. | en |
dc.rights | restricted access | en_US |
dc.status | Peer reviewed | en |
dc.subject | channel-optimized vector quantization | en |
dc.subject | finite-state vector quantization (FSVQ) | en |
dc.subject | joint source-channel coding | en |
dc.subject | noisy channels | en |
dc.subject | optimal estimation | en |
dc.subject | ALGORITHM | en |
dc.subject | DESIGN | en |
dc.title | On finite-state vector quantization for noisy channels | en |