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

• 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

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)

Nyckelord

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

Publikations- och innehållstyp

kon (ämneskategori)

ref (ämneskategori)