Pipeline decoding of embedded trellis codes: Error-tolerance analysis (Q2640575)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4187713
Language Label Description Also known as
default for all languages
No label defined
    English
    Pipeline decoding of embedded trellis codes: Error-tolerance analysis
    scientific article; zbMATH DE number 4187713

      Statements

      Pipeline decoding of embedded trellis codes: Error-tolerance analysis (English)
      0 references
      0 references
      0 references
      1990
      0 references
      In this paper the authors undertake an analysis of the decoding procedure of the embedded trellis codes. There have been obtained the superior limits of the error probabilities in decoding for the gaussian channels. It is shown that the decoding algorithm is optimal for a \(E_ b/N_ 0\to \infty\) relation. It is drawn a comparison of the values obtained for \(P_ b\) (the error probability of bit) through the method previously suggested and in accordance with maximum-likelihood detector. A thorough analysis of the notions and parameters characterizing pipeline decoding is done. The authors give numerous illustrative examples for understanding the data presented in this article. Special mention should be made about the conciseness and elegance used in demonstrating the theorems and lemmas.
      0 references
      trellis codes
      0 references
      gaussian channels
      0 references
      error probability
      0 references
      pipeline decoding
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references