| 1. |
- Bocharova, Irina, et al.
(författare)
-
A BEAST for prowling in trees
- 2004
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 50:6, s. 1295-1302
-
Tidskriftsartikel (refereegranskat)abstract
- When searching for convolutional codes and tailbiting codes of high complexity it is of vital importance to use fast algorithms for computing their weight spectra, which corresponds to finding low-weight paths in their code trellises. This can be efficiently done by a combined search in both forward and backward code trees. A bidirectional efficient algorithm for searching such code trees (BEAST) is presented. For large encoder memories, it is shown that BEAST is significantly more efficient than comparable algorithms. BEAST made it possible to rind new convolutional and tailbiting codes that have larger free (minimum) distances than the previously best known codes with the same parameters. Tables of such codes are presented.
|
|
| 2. |
- Bocharova, Irina, et al.
(författare)
-
BEAST decoding of block codes obtained via convolutional codes
- 2005
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 51:5, s. 1880-1891
-
Tidskriftsartikel (refereegranskat)abstract
- BEAST is a bidirectional efficient algorithm for searching trees. In this correspondence, BEAST is extended to maximum-likelihood (ML) decoding of block codes obtained via convolutional codes. First it is shown by simulations that the decoding complexity of BEAST is significantly less than that of the Viterbi algorithm. Then asymptotic upper bounds on the BEAST decoding complexity for three important ensembles of codes are derived. They verify BEAST's high efficiency compared to other algorithms. For high rates, the new asymptotic bound for the best ensemble is in fact better than previously known bounds.
|
|
| 3. |
- Bocharova, Irina, et al.
(författare)
-
Tailbiting codes obtained via convolutional codes with large active distance-slopes
- 2002
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 48:9, s. 2577-2587
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R = 1/2 and rate R = 1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large slopes can be used to obtain new tailbiting block codes with large minimum distances. Tables of rate R = 1/2 and rate R = 1/3 tailbiting codes with larger minimum distances than the best previously known quasi-cyclic codes are given. Two new tailbiting codes also have larger minimum distances than the best previously known binary linear block codes with same size and length. One of them is also superior in terms of minimum distance to any previously known binary nonlinear block code with the same set of parameters.
|
|
| 4. |
- Handlery, Marc, et al.
(författare)
-
On error exponents for woven convolutional codes with one tailbiting component code
- 2004
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 50:8, s. 1809-1811
-
Tidskriftsartikel (refereegranskat)abstract
- An error exponent for woven convolutional codes (WCC) with one tailbiting component code is derived. This error exponent is compared with that of the original WCC. It is shown that for WCC with outer warp, a better error exponent is obtained if the inner code is terminated with the tailbiting method. Furthermore, it is shown that the decoding error probability decreases exponentially with the square of the memory of the constituent convolutional encoders, while the decoding complexity grows exponentially only with the memory.
|
|
