The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

MAP criterion trellis source coding for short data sequences

På svenska

Author

Summary, in English

New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis

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.

Publishing year

2003

Language

English

Pages

43-52

Publication/Series

Proc., IEEE Data Compression Conf., Snowbird, UT

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • 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

Project

  • Informations- och kommunikationsteori: Data- och bildkompression

Research group

  • Informations- och kommunikationsteori

ISBN/ISSN/Other

  • ISBN: 0-7695-1896-6