Low Complexity Syndrome-Based Decoding Algorithm Applied to Block Turbo Codes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, Byungkyu | - |
dc.contributor.author | Yoon, Sungsik | - |
dc.contributor.author | Heo, Jun | - |
dc.date.accessioned | 2021-09-02T21:17:21Z | - |
dc.date.available | 2021-09-02T21:17:21Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/80967 | - |
dc.description.abstract | This paper presents a technique for reducing the decoding complexity of block turbo code with an extended Hamming code as a component code. In conventional decoding algorithms, when an input vector has a zero syndrome, complexity can be reduced by using the hard-input soft-output (HISO) algorithm. Although sufficient error correction can be achieved using hard decision decoding (HDD) of a component code, conventional methods have used the soft-input soft-output (SISO) algorithm for input vectors with a single error. However, when HDD is applied to all input vectors in which the syndrome is detected as a single error, performance loss occurs owing to the occasional presence of input vectors with triple errors. To solve this problem, we used two criteria for distinguishing between instances of single and triple errors. We maximized the applied rates of the HDD-based HISO algorithm depending on whether the criteria were satisfied. The SISO algorithm was applied when the two criteria were not met. In this case, the number of HDD usages can be reduced to half by removing duplicates or unnecessary candidate codewords. Simulation results show that the proposed algorithm can considerably reduce decoding complexity without performance loss compared with conventional algorithms. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | PRODUCT CODES | - |
dc.subject | CHASE ALGORITHM | - |
dc.subject | HYBRID DECODER | - |
dc.subject | PARITY-CHECK | - |
dc.subject | SYSTEM | - |
dc.title | Low Complexity Syndrome-Based Decoding Algorithm Applied to Block Turbo Codes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Heo, Jun | - |
dc.identifier.doi | 10.1109/ACCESS.2018.2829087 | - |
dc.identifier.scopusid | 2-s2.0-85046356844 | - |
dc.identifier.wosid | 000434943000001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.6, pp.26693 - 26706 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 6 | - |
dc.citation.startPage | 26693 | - |
dc.citation.endPage | 26706 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | PRODUCT CODES | - |
dc.subject.keywordPlus | CHASE ALGORITHM | - |
dc.subject.keywordPlus | HYBRID DECODER | - |
dc.subject.keywordPlus | PARITY-CHECK | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordAuthor | Block turbo code (BTC) | - |
dc.subject.keywordAuthor | soft-input soft-output (SISO) | - |
dc.subject.keywordAuthor | hard-input soft-output (HISO) | - |
dc.subject.keywordAuthor | hard decision decoding (HDD) | - |
dc.subject.keywordAuthor | extended Hamming code | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.