Advanced

New methods for trellis source coding at rates above and below one

Eriksson, Tomas LU ; Anderson, John B LU ; Novak, Mirek LU and Goertz, N (2004) Proceedings. DCC 2004. Data Compression Conference In Proceedings. DCC 2004. Data Compression Conference p.537-537
Abstract
This paper presents new methods trellis source coding at rates above and below one. The new schemes have in common a code design based on branch correlation, a large reproducer alphabet, and an encoder based on either the Viterbi algorithm or a tailbiting MAP technique. The methods are easily adapted to various bit rates, but here only the results for R = 2 and R = 1/2 bits per source sample are presented. Results, demonstrated for the memoryless Gaussian source, show similar or better performances than previous methods with similar coding complexity
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
memoryless Gaussian source, bit per source sample, coding complexity, bit rate, tailbiting MAP technique, Viterbi algorithm, encoder, large reproducer alphabet, branch correlation, code design, trellis source coding, code rate
in
Proceedings. DCC 2004. Data Compression Conference
pages
537 - 537
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
Proceedings. DCC 2004. Data Compression Conference
external identifiers
  • wos:000189502800069
  • scopus:2642554947
ISBN
0-7695-2082-0
DOI
10.1109/DCC.2004.1281513
language
English
LU publication?
yes
id
f2aeaa2c-6034-4cd4-95a7-c00211678d34 (old id 614387)
date added to LUP
2007-11-26 18:26:58
date last changed
2017-01-01 08:00:28
@inproceedings{f2aeaa2c-6034-4cd4-95a7-c00211678d34,
  abstract     = {This paper presents new methods trellis source coding at rates above and below one. The new schemes have in common a code design based on branch correlation, a large reproducer alphabet, and an encoder based on either the Viterbi algorithm or a tailbiting MAP technique. The methods are easily adapted to various bit rates, but here only the results for R = 2 and R = 1/2 bits per source sample are presented. Results, demonstrated for the memoryless Gaussian source, show similar or better performances than previous methods with similar coding complexity},
  author       = {Eriksson, Tomas and Anderson, John B and Novak, Mirek and Goertz, N},
  booktitle    = {Proceedings. DCC 2004. Data Compression Conference},
  isbn         = {0-7695-2082-0},
  keyword      = {memoryless Gaussian source,bit per source sample,coding complexity,bit rate,tailbiting MAP technique,Viterbi algorithm,encoder,large reproducer alphabet,branch correlation,code design,trellis source coding,code rate},
  language     = {eng},
  pages        = {537--537},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  title        = {New methods for trellis source coding at rates above and below one},
  url          = {http://dx.doi.org/10.1109/DCC.2004.1281513},
  year         = {2004},
}