Sökning: onr:"swepub:oai:lup.lub.lu.se:f2aeaa2c-6034-4cd4-95a7-c00211678d34" >
New methods for tre...
New methods for trellis source coding at rates above and below one
-
- Eriksson, Tomas (författare)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
- Anderson, John B (författare)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
- Novak, Mirek (författare)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
visa fler...
-
Goertz, N (författare)
-
visa färre...
-
(creator_code:org_t)
- 2004
- 2004
- Engelska.
-
Ingår i: Proceedings. DCC 2004. Data Compression Conference. - 0769520820 ; , s. 537-537
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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)
Hitta via bibliotek
Till lärosätets databas