Trellis state aggregation for soft decoding of variable length codes

Hervé Jégou 1 Simon Malinowski 1, 2 Christine Guillemot 3
1 LinkMedia - Creating and exploiting explicit links between multimedia fragments
Inria Rennes – Bretagne Atlantique , IRISA_D6 - MEDIA ET INTERACTIONS
3 Sirocco - Analysis representation, compression and communication of visual data
Inria Rennes – Bretagne Atlantique , IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
Abstract : This paper describes a new set of state models for soft decoding of variable length codes. A single parameter T allows to trade complexity against estimation accuracy. The extrema choices for this parameter lead respectively to construct the well-known bit-level and bit/symbol trellises. For a proper choice of the parameter T, the results obtained by running a BCJR or Viterbi estimation algorithm on the proposed state models are close to those obtained with the optimum state model. The complexity is however significantly reduced. It can be further decreased by projecting the state model on two state models of reduced size, and by combining their decoding results. This combination is shown to be optimal for the Viterbi algorithm.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01566452
Contributor : Simon Malinowski <>
Submitted on : Friday, July 21, 2017 - 10:10:29 AM
Last modification on : Friday, January 11, 2019 - 3:15:01 PM

Identifiers

Citation

Hervé Jégou, Simon Malinowski, Christine Guillemot. Trellis state aggregation for soft decoding of variable length codes. Signal Processing Systems Design and Implementation, 2005. IEEE Workshop on, Nov 2005, Athenes, Greece. ⟨10.1109/SIPS.2005.1579937⟩. ⟨hal-01566452⟩

Share

Metrics

Record views

379