• DocumentCode
    996844
  • Title

    Bounds and approximations for the bit error probability of convolutional codes

  • Author

    Burr, Alister G.

  • Author_Institution
    York Univ., UK
  • Volume
    29
  • Issue
    14
  • fYear
    1993
  • fDate
    7/8/1993 12:00:00 AM
  • Firstpage
    1287
  • Lastpage
    1288
  • Abstract
    The bit error probability Pb of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on Pb which also form good approximations to Pb at values up to 10-2 or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.
  • Keywords
    convolutional codes; error statistics; probability; Viterbi algorithm; bit error probability; convolutional codes; hard decision techniques; soft decision techniques; union upper bound;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19930859
  • Filename
    252435
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=996844