| 1. |
- Anderson, John B, et al.
(author)
-
An optimal circular Viterbi decoder for the bounded distance criterion
- 2002
-
In: IEEE Transactions on Communications. - 0090-6778. ; 50:11, s. 1736-1742
-
Journal article (peer-reviewed)abstract
- We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding.
|
|
| 2. |
- Anderson, John B
(author)
-
Coded modulation by outright filtering
- 2002
-
In: Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371). - 0780375017 ; , s. 471-471
-
Conference paper (peer-reviewed)abstract
- We investigate the bandwidth and distance of codes created by ordinary lowpass filtering of a pulse stream. The encoder is thus a convolution, but over the reals. Performance of these codes is compared to the TCM and PRS code families; despite their simplicity, the new codes perform equally well. Since a simple decoder exists, these are attractive codes.
|
|
| 3. |
- Anderson, John B, et al.
(author)
-
Coded Modulation Systems
- 2003
-
In: Kluwer Academic / Plenum Publishers. - 0306472791
-
Book (other academic/artistic)abstract
- This textbook studies the 3 main types of coded modulation: trellis-coded modulation (TCM), continuous-phase modulation (CPM) codes, and linear modulation codes like those that arise from filtering and intersymbol interference. In 2 final chapters, code-division multiple-access receivers are discussed. The book begins with a review of coding, modulation and information theory.
|
|
| 4. |
- Anderson, John B, et al.
(author)
-
New Trellis source codes based on linear congruential recursions
- 2003
-
In: Proc., 2003 IEEE International Symposium on Information Theory, Yokohama. - 0780377281 ; , s. 170-170
-
Conference paper (peer-reviewed)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.
|
|
| 5. |
- Anderson, John B
(author)
-
On the complexity of bounded distance decoding for the AWGN channel
- 2002
-
In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 48:5, s. 1046-1060
-
Journal article (peer-reviewed)abstract
- Earlier work has derived the storage complexity of the bounded distance decoder (BDD) for binary-channel convolutional codes. We extend this work to the Gaussian noise channel and to partial-response codes. We show that the storage requirement similar to(2(1-R) - 1)(-t) paths for rate-R convolutional codes over the binary channel becomes similar to2(2Rt) over the Gaussian channel, where the decoder must correct t errors. Thus, convolutional coding over the Gaussian channel is not only 3 dB more energy efficient, but its decoding is simpler as well. Next, we estimate the path storage for partial-response codes, i.e., real-number convolutional codes, over the Gaussian channel. The growth rate depends primarily on the bandwidth of the code. A new optimization procedure is devised to measure the maximum storage requirement in Gaussian noise for these two code types. An analysis based on difference equations predicts the asymptotic storage growth for partial response codes.
|
|
| 6. |
- Eriksson, Tomas, et al.
(author)
-
Good trellis source codes at fractional rates
- 2004
-
In: Proceedings. 2004 IEEE International Symposium on Information Theory. - 0780382803 ; , s. 496-496
-
Conference paper (peer-reviewed)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
|
|
| 7. |
- Eriksson, Tomas, et al.
(author)
-
Image coding with the MAP criterion
- 2002
-
In: Proceedings, IEEE 2002 Data Compression Conference. - 0769514774 ; , s. 453-453
-
Conference paper (peer-reviewed)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.
|
|
| 8. |
- Eriksson, Tomas, et al.
(author)
-
MAP criterion image coding using the BCJR algorithm
- 2002
-
In: Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371). - 0780375017 ; , s. 291-291
-
Conference paper (peer-reviewed)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.
(author)
-
MAP criterion trellis source coding for short data sequences
- 2003
-
In: Proc., IEEE Data Compression Conf., Snowbird, UT. - 0769518966 ; , s. 43-52
-
Conference paper (peer-reviewed)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.
(author)
-
New methods for trellis source coding at rates above and below one
- 2004
-
In: Proceedings. DCC 2004. Data Compression Conference. - 0769520820 ; , s. 537-537
-
Conference paper (peer-reviewed)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
|
|
