MAP criterion trellis source coding for short data sequences
Författare
Summary, in English
source coding suffers from having a too small a reproduction alphabet. Governed by alphabet-constrained rate-distortion theory we propose a simple method
which for a source coding rate of 1 bit per sample allows 2n reconstruction values for a trellis with 2n states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Simulation results are compared to TCQ-like methods.
Publiceringsår
2003
Språk
Engelska
Sidor
43-52
Publikation/Tidskrift/Serie
Proc., IEEE Data Compression Conf., Snowbird, UT
Fulltext
- Available as AI - 522 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- minimum mean squared error
- short data sequence
- tail-biting BCJR algorithm
- trellis coded quantization
- TCQ-like method
- alphabet-constrained rate-distortion theory
- lossy source coding
- data compression
- trellis source coding
- MAP criterion
- maximum a posteriori
- VA
- tailbiting
- Viterbi algorithm
- MMSE
Conference name
IEEE Data Compression Conference
Conference date
2003-03-25 - 2003-03-27
Conference place
Snowbird, UT, United States
Status
Published
Projekt
- Informations- och kommunikationsteori: Data- och bildkompression
Forskningsgrupp
- Informations- och kommunikationsteori
ISBN/ISSN/Övrigt
- ISBN: 0-7695-1896-6