View in EDS

Code Design Based on Connecting Spatially Coupled Graph Chains.

Saved in:
Bibliographic Details
Title: Code Design Based on Connecting Spatially Coupled Graph Chains.
Authors: Truhachev, Dmitri, Mitchell, David G. M., Lentmaier, Michael, Costello, Daniel J., Karami, Alireza
Source: IEEE Transactions on Information Theory; Sep2019, Vol. 65 Issue 9, p5604-5617, 14p
Subject Terms: ITERATIVE decoding, ERROR probability, CIPHERS
Abstract: A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that the code ensembles obtained by connecting appropriately chosen individual SC-LDPC code chains at specific points have improved iterative decoding thresholds. In addition, the connected chain ensembles have a smaller decoding complexity required to achieve a specific bit error probability compared to the individual code chains. Moreover, we demonstrate that, like the individual component chains, the proposed constructions have a typical minimum distance that grows linearly with block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Information Theory 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: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=00189448&ISBN=&volume=65&issue=9&date=20190901&spage=5604&pages=5604-5617&title=IEEE Transactions on Information Theory&atitle=Code%20Design%20Based%20on%20Connecting%20Spatially%20Coupled%20Graph%20Chains.&aulast=Truhachev%2C%20Dmitri&id=DOI:10.1109/TIT.2019.2917222
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Truhachev%20D
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 138144621
RelevancyScore: 886
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 885.552001953125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Code Design Based on Connecting Spatially Coupled Graph Chains.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Truhachev%2C+Dmitri%22">Truhachev, Dmitri</searchLink><br /><searchLink fieldCode="AR" term="%22Mitchell%2C+David+G%2E+M%2E%22">Mitchell, David G. M.</searchLink><br /><searchLink fieldCode="AR" term="%22Lentmaier%2C+Michael%22">Lentmaier, Michael</searchLink><br /><searchLink fieldCode="AR" term="%22Costello%2C+Daniel+J%2E%22">Costello, Daniel J.</searchLink><br /><searchLink fieldCode="AR" term="%22Karami%2C+Alireza%22">Karami, Alireza</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: IEEE Transactions on Information Theory; Sep2019, Vol. 65 Issue 9, p5604-5617, 14p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22ITERATIVE+decoding%22">ITERATIVE decoding</searchLink><br /><searchLink fieldCode="DE" term="%22ERROR+probability%22">ERROR probability</searchLink><br /><searchLink fieldCode="DE" term="%22CIPHERS%22">CIPHERS</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that the code ensembles obtained by connecting appropriately chosen individual SC-LDPC code chains at specific points have improved iterative decoding thresholds. In addition, the connected chain ensembles have a smaller decoding complexity required to achieve a specific bit error probability compared to the individual code chains. Moreover, we demonstrate that, like the individual component chains, the proposed constructions have a typical minimum distance that grows linearly with block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of IEEE Transactions on Information Theory 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://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=138144621
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TIT.2019.2917222
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 5604
    Subjects:
      – SubjectFull: ITERATIVE decoding
        Type: general
      – SubjectFull: ERROR probability
        Type: general
      – SubjectFull: CIPHERS
        Type: general
    Titles:
      – TitleFull: Code Design Based on Connecting Spatially Coupled Graph Chains.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Truhachev, Dmitri
      – PersonEntity:
          Name:
            NameFull: Mitchell, David G. M.
      – PersonEntity:
          Name:
            NameFull: Lentmaier, Michael
      – PersonEntity:
          Name:
            NameFull: Costello, Daniel J.
      – PersonEntity:
          Name:
            NameFull: Karami, Alireza
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 00189448
          Numbering:
            – Type: volume
              Value: 65
            – Type: issue
              Value: 9
          Titles:
            – TitleFull: IEEE Transactions on Information Theory
              Type: main
ResultId 1