Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On the BCJR algorithm for rate-distortion source coding

In English

Författare

Summary, in English

The BCJR algorithm is an important channel decoding method. We extend it to trellis rate-distortion data

compression. Beginning from source coding principles, the derivation of the algorithm avoids channel coding or soft output ideas. The encoder does not use entropy coding;

equiprobable reproducer letters are emphasized since

these maximize entropy. The BCJR method is demonstrated by

tests of a tailbiting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tailbiting; the role of the BCJR is to achieve tailbiting in a relatively simple way. Some issues that arise with tailbiting are explored. It is shown that there is an optimal trellis state size for each block length.

Publiceringsår

2007

Språk

Engelska

Sidor

3201-3207

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

53

Issue

9

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • source codes
  • rate-distortion coding
  • BCJR algorithm
  • data compression

Status

Published

Projekt

  • PCC: Algorithm and Hardware

Forskningsgrupp

  • Informations- och kommunikationsteori

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448