Search: onr:"swepub:oai:lup.lub.lu.se:71b15d30-ebce-411d-916d-95c50e25bd80" >
On the block size o...
On the block size of trellis quantizers
-
- 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
-
Hellerbrand, S (author)
-
- 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
-
show more...
-
- 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
-
show less...
-
(creator_code:org_t)
- 2005
- 2005
- English.
-
In: Proceedings. DCC 2005. Data Compression Conference. - 0769523099 ; , s. 457-457
- Related links:
-
http://dx.doi.org/10...
-
show more...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- Summary form only given. In this paper, we examine the effect of block size on the performance of trellis based quantization. In particular, the Viterbi and tailbiting BCJR algorithms are compared. It is shown that for short blocks of data, the T-BCJR algorithm achieves a superior performance over the Viterbi algorithm (VA). One approach is to use the maximum a posteriori probability (MAP) heuristic and the T-BCJR algorithm. If the MAP-encoder does not produce a tailbiting state sequence, the path is modified for a number of stages at the beginning and end of the block such that it tailbites. The enclosed figure shows MSE as a function of block size and sample position, respectively, for a rate R=1 bit per sample, 32-state trellis quantizer and an IID Gaussian source. The effects of start-up are clearly visible. For the T-BCJR algorithm, the distortion is evenly distributed across the whole block. The performance decrease for short blocks stems from the increase in the number of tailbiting violations for short blocks and the suboptimal modification to ensure tailbiting. The results presented here hold for a large class of trellis constructions, such as TCQ
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Keyword
- trellis based quantization
- tailbiting BCJR algorithm
- Viterbi algorithm
- trellis quantizer block size effects
- T-BCJR
- MAP-encoder
- maximum a posteriori probability heuristic
- tailbiting state sequence
- MSE
- IID Gaussian source
- start-up distortion effects
- TCQ
- sample position effects
- tailbiting violations
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database