Search: onr:"swepub:oai:lup.lub.lu.se:1f4aa774-4072-4929-ae1f-109aaafd935e" >
MAP criterion trell...
MAP criterion trellis source coding for short data sequences
-
- Eriksson, Tomas (author)
- 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 (author)
- 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 (author)
- 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
-
(creator_code:org_t)
- 2003
- 2003
- English 10 s.
-
In: Proc., IEEE Data Compression Conf., Snowbird, UT. - 0769518966 ; , s. 43-52
- Related links:
-
https://portal.resea... (primary) (free)
-
show more...
-
http://dx.doi.org/10...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis source coding suffers from having a too small a reproduction alphabet. Governed by alphabet-constrained rate-distortion theory we propose a simple method which for a source coding rate of 1 bit per sample allows 2n reconstruction values for a trellis with 2n states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Simulation results are compared to TCQ-like methods.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Keyword
- minimum mean squared error
- short data sequence
- tail-biting BCJR algorithm
- trellis coded quantization
- TCQ-like method
- alphabet-constrained rate-distortion theory
- lossy source coding
- data compression
- trellis source coding
- MAP criterion
- maximum a posteriori
- VA
- tailbiting
- Viterbi algorithm
- MMSE
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database