DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Jaehyeon | ko |
dc.contributor.author | Lee, Jaeyoung | ko |
dc.contributor.author | Park, In-Cheol | ko |
dc.date.accessioned | 2022-09-06T02:01:55Z | - |
dc.date.available | 2022-09-06T02:01:55Z | - |
dc.date.created | 2022-09-06 | - |
dc.date.created | 2022-09-06 | - |
dc.date.created | 2022-09-06 | - |
dc.date.issued | 2022-08 | - |
dc.identifier.citation | IEEE ACCESS, v.10, pp.86943 - 86952 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | http://hdl.handle.net/10203/298363 | - |
dc.description.abstract | Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a good error-correcting performance. However, the long latency of SCLD is a significant matter that hinders practical applications, which is mainly caused by two features of the SCLD process: tree traversal and path-splitting. To alleviate the main reasons, a new multi-bit SCLD algorithm is proposed in this paper to decode several bits simultaneously without conducting any tree traversal and path-splitting when a node in the decoding tree holds a specific condition. In addition, a path ignoring (PI) technique is proposed to mitigate the condition of the multi-bit SCLD, which results in an additional reduction of latency. The proposed multi-bit decoding method and the PI technique play a significant role in reducing the number of path-splitting cases, by 96% compared to the conventional SCLD method. Simulation results show that compared to the conventional SCLD with list sizes 8 and 16, the proposed multi-bit decoding associated with the PI technique reduces the overall decoding cycles by 77% and 79%, respectively, with almost no degradation of error-correcting performance. | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes | - |
dc.type | Article | - |
dc.identifier.wosid | 000844448900001 | - |
dc.identifier.scopusid | 2-s2.0-85136719776 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.beginningpage | 86943 | - |
dc.citation.endingpage | 86952 | - |
dc.citation.publicationname | IEEE ACCESS | - |
dc.identifier.doi | 10.1109/ACCESS.2022.3199000 | - |
dc.contributor.localauthor | Park, In-Cheol | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Decoding | - |
dc.subject.keywordAuthor | Reliability | - |
dc.subject.keywordAuthor | Polar codes | - |
dc.subject.keywordAuthor | Codes | - |
dc.subject.keywordAuthor | Complexity theory | - |
dc.subject.keywordAuthor | Measurement | - |
dc.subject.keywordAuthor | Sorting | - |
dc.subject.keywordAuthor | Low latency communication | - |
dc.subject.keywordAuthor | Polar codes | - |
dc.subject.keywordAuthor | successive cancellation list decoding | - |
dc.subject.keywordAuthor | path-splitting | - |
dc.subject.keywordAuthor | threshold | - |
dc.subject.keywordAuthor | low latency | - |
dc.subject.keywordPlus | ARCHITECTURE | - |
dc.subject.keywordPlus | TURBO | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.