SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Handlery Marc) "

Sökning: WFRF:(Handlery Marc)

  • Resultat 1-10 av 17
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
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)
  • Convolutional codes with large slopes yield better tailbiting codes
  • 2002
  • Ingår i: IEEE International Symposium on Information Theory, 2002. Proceedings.. - 0780375017 ; , s. 258-258
  • Konferensbidrag (refereegranskat)abstract
    • Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.
  •  
4.
  • Bocharova, Irina, et al. (författare)
  • How to efficiently find the minimum distance of tailbiting codes
  • 2002
  • Ingår i: IEEE International Symposium on Information Theory, 2002. Proceedings.. - 0780375017 ; , s. 259-259
  • Konferensbidrag (refereegranskat)abstract
    • A bidirectional algorithm for computing spectral coefficients of convolutional and tailbiting codes is presented and used to obtain new codes.
  •  
5.
  •  
6.
  • 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.
  •  
7.
  •  
8.
  • Handlery, Marc, et al. (författare)
  • A distance approach to window decoding
  • 2002
  • Ingår i: Problems of Information Transmission. - 0032-9460. ; 38:3, s. 169-181
  • Tidskriftsartikel (refereegranskat)abstract
    • In convolutional coding, code sequences have infinite length; thus, a maximum-likelihood decoder implies an infinite delay. Due to memory and delay constraints in practical coding schemes, convolutional codes often are either terminated or decoded by a window decoder. When a window decoder is used, the convolutional code sequence is not terminated; instead, the window decoder estimates information digits after receiving a finite number of noise-corrupted code symbols, thereby keeping the decoding delay short. An exact characterization of the error-correcting capability of window decoded convolutional codes is given by using active distances of convolutional codes.
  •  
9.
  •  
10.
  • Handlery, Marc, et al. (författare)
  • Boosting the error performance of suboptimal tailbiting decoders
  • 2003
  • Ingår i: IEEE Transactions on Communications. - 0090-6778. ; 51:9, s. 1485-1491
  • Tidskriftsartikel (refereegranskat)abstract
    • Tailbiting is an attractive method to terminate convolutional codes without reducing the code rate. Maximum-likelihood and exact a posteriori probability decoding of tailbiting codes implies, however, a large computational complexity. Therefore, suboptimal decoding methods are often used in practical coding schemes. It is shown that suboptimal decoding methods work better when the slope of the active distances of the generating convolutional encoder is large. Moreover, it is shown that considering quasi-cyclic shifts of the received channel output can increase the performance of suboptimal tailbiting decoders. The findings are most relevant to tailbiting codes where the number of states is not small relative to the block length.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 17

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy