View in EDS

Reliability-Output Decoding of Tail-Biting Convolutional Codes.

Saved in:
Bibliographic Details
Title: Reliability-Output Decoding of Tail-Biting Convolutional Codes.
Authors: Williamson, Adam R., Marshall, Matthew J., Wesel, Richard D.
Source: IEEE Transactions on Communications. Jun2014, Vol. 62 Issue 6, p1768-1778. 11p.
Subjects: Viterbi decoding, Maximum likelihood decoding, Algorithms, Probability theory, Possibility
Abstract: We present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword after first calculating the posterior probability of the decoded tail-biting codeword's starting state. One approach employs a state-estimation algorithm that selects the maximum a posteriori state based on the posterior distribution of the starting states. Another approach is an approximation to the exact tail-biting ROVA that estimates the word-error probability. A comparison of the computational complexity of each approach is discussed in detail. The presented reliability-output algorithms apply to both feedforward and feedback tail-biting convolutional encoders. These tail-biting reliability-output algorithms are suitable for use in reliability-based retransmission schemes with short blocklengths, in which terminated convolutional codes would introduce rate loss. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 96665403
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Reliability-Output Decoding of Tail-Biting Convolutional Codes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Williamson%2C+Adam+R%2E%22">Williamson, Adam R.</searchLink><br /><searchLink fieldCode="AR" term="%22Marshall%2C+Matthew+J%2E%22">Marshall, Matthew J.</searchLink><br /><searchLink fieldCode="AR" term="%22Wesel%2C+Richard+D%2E%22">Wesel, Richard D.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Communications%22">IEEE Transactions on Communications</searchLink>. Jun2014, Vol. 62 Issue 6, p1768-1778. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Viterbi+decoding%22">Viterbi decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Maximum+likelihood+decoding%22">Maximum likelihood decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Probability+theory%22">Probability theory</searchLink><br /><searchLink fieldCode="DE" term="%22Possibility%22">Possibility</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword after first calculating the posterior probability of the decoded tail-biting codeword's starting state. One approach employs a state-estimation algorithm that selects the maximum a posteriori state based on the posterior distribution of the starting states. Another approach is an approximation to the exact tail-biting ROVA that estimates the word-error probability. A comparison of the computational complexity of each approach is discussed in detail. The presented reliability-output algorithms apply to both feedforward and feedback tail-biting convolutional encoders. These tail-biting reliability-output algorithms are suitable for use in reliability-based retransmission schemes with short blocklengths, in which terminated convolutional codes would introduce rate loss. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=96665403
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TCOMM.2014.2319264
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1768
    Subjects:
      – SubjectFull: Viterbi decoding
        Type: general
      – SubjectFull: Maximum likelihood decoding
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Probability theory
        Type: general
      – SubjectFull: Possibility
        Type: general
    Titles:
      – TitleFull: Reliability-Output Decoding of Tail-Biting Convolutional Codes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Williamson, Adam R.
      – PersonEntity:
          Name:
            NameFull: Marshall, Matthew J.
      – PersonEntity:
          Name:
            NameFull: Wesel, Richard D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2014
              Type: published
              Y: 2014
          Identifiers:
            – Type: issn-print
              Value: 00906778
          Numbering:
            – Type: volume
              Value: 62
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: IEEE Transactions on Communications
              Type: main
ResultId 1