| 1. |
- Anderson, John B, et al.
(författare)
-
New Trellis source codes based on linear congruential recursions
- 2003
-
Ingår i: Proc., 2003 IEEE International Symposium on Information Theory, Yokohama. - 0780377281 ; , s. 170-170
-
Konferensbidrag (refereegranskat)abstract
- We evaluate a new class of rate-distortion codes based on simple linear congruential recursions. Codes are demonstrated for the uniform and Gaussian sources, whose performance exceeds that so far reported in the literature, including that reported for TCQ codes. The results also point to a new correlation relationship that apparently must exist for trellis codes.
|
|
| 2. |
- Anderson, John B, et al.
(författare)
-
On the BCJR algorithm for rate-distortion source coding
- 2007
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 53:9, s. 3201-3207
-
Tidskriftsartikel (refereegranskat)abstract
- The BCJR algorithm is an important channel decoding method. We extend it to trellis rate-distortion data compression. Beginning from source coding principles, the derivation of the algorithm avoids channel coding or soft output ideas. The encoder does not use entropy coding; equiprobable reproducer letters are emphasized since these maximize entropy. The BCJR method is demonstrated by tests of a tailbiting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tailbiting; the role of the BCJR is to achieve tailbiting in a relatively simple way. Some issues that arise with tailbiting are explored. It is shown that there is an optimal trellis state size for each block length.
|
|
| 3. |
- Anderson, John B, et al.
(författare)
-
On the BCJR algorithm for rate-distortion source coding
- 2005
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. ; 2005, s. 1932-1936
-
Konferensbidrag (refereegranskat)abstract
- The BCJR algorithm is an important method of channel decoding. We extend it here to rate-distortion encoding. The arguments begin from source coding principles and make no use of channel coding or soft output ideas. An important role is played by codeword ensembles with equiprobable reproducer letters. The BCJR method is demonstrated by tests of a tailbiting BCJR with the Gaussian source. The outcome improves Viterbi algorithm performance at short and medium blocklengths.
|
|
| 4. |
- Anderson, John B, et al.
(författare)
-
Trellis source codes based on linear congruential recursions
- 2005
-
Ingår i: IEEE Communications Letters. - 1089-7798. ; 9:3, s. 198-200
-
Tidskriftsartikel (refereegranskat)abstract
- We evaluate a new class of rate-distortion codes based on simple linear congruential recursions. Codes are demonstrated for the memoryless Uniform, Gaussian, Laplacian and Gamma sources, whose performance often exceeds that so far reported in the literature, including that for TCQ codes. At a source coding rate of one bit per sample the performance at 512 states is 0.24 dB from the Shannon limit for the memoryless Gaussian source.
|
|
| 5. |
- Eriksson, Tomas, et al.
(författare)
-
Good trellis source codes at fractional rates
- 2004
-
Ingår i: Proceedings. 2004 IEEE International Symposium on Information Theory. - 0780382803 ; , s. 496-496
-
Konferensbidrag (refereegranskat)abstract
- Two new kinds of fractional-rate trellis source codes based on linear congruential recursions are evaluated. Properties of good codes are given. Square error distortion is similar to or better than competing schemes
|
|
| 6. |
- Eriksson, Tomas, et al.
(författare)
-
Image coding with the MAP criterion
- 2002
-
Ingår i: Proceedings, IEEE 2002 Data Compression Conference. - 0769514774 ; , s. 453-453
-
Konferensbidrag (refereegranskat)abstract
- BCJR based source coding of image residuals is investigated. From a trellis representation of the residual, a joint source-channel coding system is formed. Then the BCJR algorithm is applied to find the MAP encoding. MAP and minimized squared error encoding are compared. The novelty of this work is the use of the BCJR algorithm and the MAP criterion in the source coding procedure. The source encoding system described preserves more features than an MSE based encoder. Also, blocking artifacts are reduced.
|
|
| 7. |
- Eriksson, Tomas, et al.
(författare)
-
Linear congruential trellis source codes: Design and analysis
- 2007
-
Ingår i: IEEE Transactions on Communications. - 0090-6778. ; 55:9, s. 1693-1701
-
Tidskriftsartikel (refereegranskat)abstract
- Rate-distortion trellis source codes are developed for quantizing memoryless IID sources. The codes are generated by simple linear congruential recursions. The method generates codes at a variety of rates including fractional ones; reproducer sets can be large, a crucial advantage with certain sources. Axioms for good code construction are developed that are based on recursion properties, certain symmetries and trellis branch correlation properties. These axioms are justified by the outcome of random searches for good codes. It is found that the trellis code design breaks into two problems: the trellis labels should have certain properties regardless of the source distribution; and the reproducer values depends on the source. Encoders are simulated for a number of continuous amplitude sources. For the same computational complexity the new codes in most cases perform better than the best codes in the literature, including trellis coded quantization and fake process approaches.
|
|
| 8. |
- Eriksson, Tomas, et al.
(författare)
-
MAP criterion image coding using the BCJR algorithm
- 2002
-
Ingår i: Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371). - 0780375017 ; , s. 291-291
-
Konferensbidrag (refereegranskat)abstract
- BCJR based source coding of image residuals is explored. From a trellis representation of the residual, a joint source-channel coding system is formed. The use of the BCJR algorithm is possible due to a procedure which transforms the residuals to a representation with independent identically distributed components having unit variance
|
|
| 9. |
- Eriksson, Tomas, et al.
(författare)
-
MAP criterion trellis source coding for short data sequences
- 2003
-
Ingår i: Proc., IEEE Data Compression Conf., Snowbird, UT. - 0769518966 ; , s. 43-52
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 10. |
- Eriksson, Tomas, et al.
(författare)
-
New methods for trellis source coding at rates above and below one
- 2004
-
Ingår i: Proceedings. DCC 2004. Data Compression Conference. - 0769520820 ; , s. 537-537
-
Konferensbidrag (refereegranskat)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
|
|
