View in EDS

Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes.

Saved in:
Bibliographic Details
Title: Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes.
Authors: Johnson, Sarah J.1 sarah.johnson@newcastle.edu.au, Weller, Steven R.1 steven.weller@newcastle.edu.au
Source: IEEE Transactions on Communications. Aug2008, Vol. 56 Issue 8, p1201-1206. 6p. 3 Graphs.
Subjects: Turbo languages (Computer program language), Matrices (Mathematics), Algebra, Quantitative research, Charts, diagrams, etc., Graphic methods
Abstract: This paper proposes novel interleaver and accumulator structures for systematic, regular repeat-accumulate (RA) codes. It is well known that such codes are amenable to iterative (sum-product) decoding on the Tanner graph of the code, yet are as readily encodable as turbo codes. In this paper, interleavers for RA codes are designed using combinatorial techniques as a basis for deterministic interleaver constructions, yielding RA codes whose Tanner graphs are free of 4-cycles. Further, a generalized RA code accumulator structure is proposed, leading to codes, termed w3RA codes, whose parity-check matrices have many fewer weight-2 columns than conventional RA codes. The w3RA codes retain the low-complexity encoding of conventional RA codes and exhibit improved error-floor performance. [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: 34148652
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Johnson%2C+Sarah+J%2E%22">Johnson, Sarah J.</searchLink><relatesTo>1</relatesTo><i> sarah.johnson@newcastle.edu.au</i><br /><searchLink fieldCode="AR" term="%22Weller%2C+Steven+R%2E%22">Weller, Steven R.</searchLink><relatesTo>1</relatesTo><i> steven.weller@newcastle.edu.au</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Communications%22">IEEE Transactions on Communications</searchLink>. Aug2008, Vol. 56 Issue 8, p1201-1206. 6p. 3 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Turbo+languages+%28Computer+program+language%29%22">Turbo languages (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Matrices+%28Mathematics%29%22">Matrices (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Quantitative+research%22">Quantitative research</searchLink><br /><searchLink fieldCode="DE" term="%22Charts%2C+diagrams%2C+etc%2E%22">Charts, diagrams, etc.</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper proposes novel interleaver and accumulator structures for systematic, regular repeat-accumulate (RA) codes. It is well known that such codes are amenable to iterative (sum-product) decoding on the Tanner graph of the code, yet are as readily encodable as turbo codes. In this paper, interleavers for RA codes are designed using combinatorial techniques as a basis for deterministic interleaver constructions, yielding RA codes whose Tanner graphs are free of 4-cycles. Further, a generalized RA code accumulator structure is proposed, leading to codes, termed w3RA codes, whose parity-check matrices have many fewer weight-2 columns than conventional RA codes. The w3RA codes retain the low-complexity encoding of conventional RA codes and exhibit improved error-floor performance. [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=34148652
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TCOMM.2008.041247
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 1201
    Subjects:
      – SubjectFull: Turbo languages (Computer program language)
        Type: general
      – SubjectFull: Matrices (Mathematics)
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Quantitative research
        Type: general
      – SubjectFull: Charts, diagrams, etc.
        Type: general
      – SubjectFull: Graphic methods
        Type: general
    Titles:
      – TitleFull: Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Johnson, Sarah J.
      – PersonEntity:
          Name:
            NameFull: Weller, Steven R.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 00906778
          Numbering:
            – Type: volume
              Value: 56
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: IEEE Transactions on Communications
              Type: main
ResultId 1