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

Tomas Eriksson; John B Anderson; Mirek Novak; N Goertz

doi:10.1109/DCC.2004.1281513

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

Tomas Eriksson, John B Anderson, Mirek Novak, N Goertz

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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

Original language	English
Title of host publication	Proceedings. DCC 2004. Data Compression Conference
Publisher	IEEE - Institute of Electrical and Electronics Engineers Inc.
Pages	537-537
ISBN (Print)	0-7695-2082-0
DOIs	https://doi.org/10.1109/DCC.2004.1281513
Publication status	Published - 2004
Event	Proceedings. DCC 2004. Data Compression Conference - Snowbird, UT, United States Duration: 2004 Mar 23 → 2004 Mar 25

Conference

Conference	Proceedings. DCC 2004. Data Compression Conference
Country/Territory	United States
City	Snowbird, UT
Period	2004/03/23 → 2004/03/25

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Free 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

Access to Document

10.1109/DCC.2004.1281513

Cite this

@inproceedings{f2aeaa2c60344cd495a7c00211678d34,

title = "New methods for trellis source coding at rates above and below one",

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",

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",

author = "Tomas Eriksson and Anderson, {John B} and Mirek Novak and N Goertz",

year = "2004",

doi = "10.1109/DCC.2004.1281513",

language = "English",

isbn = "0-7695-2082-0",

pages = "537--537",

booktitle = "Proceedings. DCC 2004. Data Compression Conference",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "Proceedings. DCC 2004. Data Compression Conference ; Conference date: 23-03-2004 Through 25-03-2004",

}

Eriksson, T, Anderson, JB, Novak, M & Goertz, N 2004, New methods for trellis source coding at rates above and below one. in Proceedings. DCC 2004. Data Compression Conference. IEEE - Institute of Electrical and Electronics Engineers Inc., pp. 537-537, Proceedings. DCC 2004. Data Compression Conference, Snowbird, UT, United States, 2004/03/23. https://doi.org/10.1109/DCC.2004.1281513

TY - GEN

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

AU - Eriksson, Tomas

AU - Anderson, John B

AU - Novak, Mirek

AU - Goertz, N

PY - 2004

Y1 - 2004

N2 - 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

AB - 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

KW - memoryless Gaussian source

KW - bit per source sample

KW - coding complexity

KW - bit rate

KW - tailbiting MAP technique

KW - Viterbi algorithm

KW - encoder

KW - large reproducer alphabet

KW - branch correlation

KW - code design

KW - trellis source coding

KW - code rate

U2 - 10.1109/DCC.2004.1281513

DO - 10.1109/DCC.2004.1281513

M3 - Paper in conference proceeding

SN - 0-7695-2082-0

SP - 537

EP - 537

BT - Proceedings. DCC 2004. Data Compression Conference

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - Proceedings. DCC 2004. Data Compression Conference

Y2 - 23 March 2004 through 25 March 2004

ER -

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

Abstract

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this