| 1. |
|
|
| 2. |
- Osthoff, Harro, et al.
(author)
-
Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder
- 1998
-
In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 44, s. 831-838
-
Journal article (peer-reviewed)abstract
- Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encoder solves the correct path loss problem in reduced-search decoders. Other kinds do not. Therefore, with almost any other decoding method than the Viterbi algorithm, systematic feed-forward encoders should be used. The conclusions in this correspondence run counter to much accepted wisdom about convolutional codes
|
|
| 3. |
- Ståhl, Per, et al.
(author)
-
New tailbiting encoders
- 1998
-
In: [Host publication title missing]. - 0780350006 ; , s. 389-389
-
Conference paper (peer-reviewed)abstract
- In B tailbiting trellis encoder, the starting state of the encoder is set to the state at which the machine will be at the end of the encoded frame. By this means the probability of decoding error at the end of the frame can be kept low without the addition of termination bits and the consequent rate loss. We report on an extensive search for short and moderatelength convoluticinal encoders for tailbiting trellis representations of bllock codes at rates 1/4, 1/3, 1/2, and 2/3. The short tailbiting representations found are typically as good as the best known block codes.
|
|
| 4. |
- Ståhl, Per, et al.
(author)
-
Optimal and near-optimal encoders for short and moderate-length tailbiting trellises
- 1999
-
In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 45:7, s. 2562-2571
-
Journal article (peer-reviewed)abstract
- The results of an extensive search for short and moderate length polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R=1/4, 1/3, 1/2, and 2/3 are reported. The tail-biting representations found are typically as good as the best known block codes
|
|
| 5. |
|
|
