Nonsystematic Turbo Codes.
Saved in:
| Title: | Nonsystematic Turbo Codes. |
|---|---|
| Authors: | Banerjee, Adrish1 adrish@iitk.ac.in, Vatta, Francesca2 vatta@units.it, Scanavino, Bartolo3 bartolo.scanavino@polito.it, Costello, Jr., Daniel J.4 costello.2@nd.edu |
| Source: | IEEE Transactions on Communications. Nov2005, Vol. 53 Issue 11, p1841-1849. 9p. |
| Subjects: | Turbo languages (Computer program language), Error-correcting codes, Artificial intelligence, Automatic control systems, Coding theory, Graphic methods |
| Abstract: | In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties. Moreover, they can achieve comparable performance in the waterfall region if the nonsystematic constituent encoder has a low-weight feedforward inverse. A uniform interleaver analysis is used to show that rate R = 1/3 turbo codes using nonsystematic constituent encoders have larger effective free distances than when systematic constituent encoders are used. Also, mutual information-based transfer characteristics and extrinsic information transfer charts are used to show that rate R = 1/3 turbo codes with nonsystematic constituent encoders having low-weight feedforward inverses achieve convergence thresholds comparable to those achieved with systematic constituent encoders. Catastrophic encoders, which do not possess a feedforward inverse, are shown to be capable of achieving low convergence thresholds by doping the code with a small fraction of systematic bits. Finally, we give tables of good nonsystematic turbo codes and present simulation results comparing the performance of systematic and nonsystematic turbo codes. [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: 19123974 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Nonsystematic Turbo Codes. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Banerjee%2C+Adrish%22">Banerjee, Adrish</searchLink><relatesTo>1</relatesTo><i> adrish@iitk.ac.in</i><br /><searchLink fieldCode="AR" term="%22Vatta%2C+Francesca%22">Vatta, Francesca</searchLink><relatesTo>2</relatesTo><i> vatta@units.it</i><br /><searchLink fieldCode="AR" term="%22Scanavino%2C+Bartolo%22">Scanavino, Bartolo</searchLink><relatesTo>3</relatesTo><i> bartolo.scanavino@polito.it</i><br /><searchLink fieldCode="AR" term="%22Costello%2C+Jr%2E%2C+Daniel+J%2E%22">Costello, Jr., Daniel J.</searchLink><relatesTo>4</relatesTo><i> costello.2@nd.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Communications%22">IEEE Transactions on Communications</searchLink>. Nov2005, Vol. 53 Issue 11, p1841-1849. 9p. – 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="%22Error-correcting+codes%22">Error-correcting codes</searchLink><br /><searchLink fieldCode="DE" term="%22Artificial+intelligence%22">Artificial intelligence</searchLink><br /><searchLink fieldCode="DE" term="%22Automatic+control+systems%22">Automatic control systems</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties. Moreover, they can achieve comparable performance in the waterfall region if the nonsystematic constituent encoder has a low-weight feedforward inverse. A uniform interleaver analysis is used to show that rate R = 1/3 turbo codes using nonsystematic constituent encoders have larger effective free distances than when systematic constituent encoders are used. Also, mutual information-based transfer characteristics and extrinsic information transfer charts are used to show that rate R = 1/3 turbo codes with nonsystematic constituent encoders having low-weight feedforward inverses achieve convergence thresholds comparable to those achieved with systematic constituent encoders. Catastrophic encoders, which do not possess a feedforward inverse, are shown to be capable of achieving low convergence thresholds by doping the code with a small fraction of systematic bits. Finally, we give tables of good nonsystematic turbo codes and present simulation results comparing the performance of systematic and nonsystematic turbo codes. [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=19123974 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TCOMM.2005.858672 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 1841 Subjects: – SubjectFull: Turbo languages (Computer program language) Type: general – SubjectFull: Error-correcting codes Type: general – SubjectFull: Artificial intelligence Type: general – SubjectFull: Automatic control systems Type: general – SubjectFull: Coding theory Type: general – SubjectFull: Graphic methods Type: general Titles: – TitleFull: Nonsystematic Turbo Codes. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Banerjee, Adrish – PersonEntity: Name: NameFull: Vatta, Francesca – PersonEntity: Name: NameFull: Scanavino, Bartolo – PersonEntity: Name: NameFull: Costello, Jr., Daniel J. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2005 Type: published Y: 2005 Identifiers: – Type: issn-print Value: 00906778 Numbering: – Type: volume Value: 53 – Type: issue Value: 11 Titles: – TitleFull: IEEE Transactions on Communications Type: main |
| ResultId | 1 |
