Location of Repository

Computational variability and overflows of stack sequential decoders



This paper presents the Zigangirov-Jelinek (Stack) algorithm of sequential decoding and sonie of its variants . The\ud objective of all the variants is to reduce the computational variability of the decoding effort . Using computer\ud simulation we show that this variability can be substantially reduced at a cost of a larger average decoding effort,\ud but with no de gradation of the error performance .\ud The required decoder stack sizes and their impact on the waiting line at the input buffer is examined. It is shown\ud that by properly choosing the decoder speed factor, stack size and length of the data blocks, the length of the\ud waiting line cannot exceed two data blocks . Finally by containing the overflows in the stack and by using a\ud retransmission procedure on the overflowed blocks, the input buffer overflows can be controlled and the error\ud probability reduced. These advantages are obtained at a cost of a small decrease of the system throughput and a\ud slight increase of the decoder complexity .Etude du codage convolutionnel et décodage séquentiel par l'algorithme à pile de Zigangisov, Jelinek et de certaines de ses variantes. On montre que ces variantes permettent une variabilité qui peut être diminuée au prix d'un accroissement de l'effort de calcul moyen et sans dégradation de la performance d'erreur. Le remplissage de la pile du décodeur est examiné ainsi que son impact sur la taille de la file d'attente dans le tampon d'entrée du décodeu

Topics: Circuit décodeur, Circuit séquentiel, File attente, Pile
Publisher: GRETSI, Saint Martin d'Hères, France
Year: 1986
OAI identifier: oai:documents.irevues.inist.fr:2042/1602
Provided by: I-Revues

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.