Ultralow-Latency Successive Cancellation Polar Decoding Architecture Using Tree-Level Parallelism
SCIE
SCOPUS
- Title
- Ultralow-Latency Successive Cancellation Polar Decoding Architecture Using Tree-Level Parallelism
- Authors
- Kam, Dongyun; Yoo, Hoyoung; Lee, Youngjoo
- Date Issued
- 2021-06
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Abstract
- Achieving the attractive error-correcting capability with a simple decoder structure, the polar code using successive cancellation (SC) decoding is now expected to be installed at the resource-limited IoT or embedded communications. However, the existing SC decoders normally suffer from the long processing latency caused by the serialized processing steps, limiting the practical applications of polar codes. In this article, to solve this latency problem, we present a new low-complexity merging operation that can increase the number of parallel factors for realizing the tree-level parallelism. We also modify the previous pruning method to further reduce the number of visited nodes at the parallel SC decoding scenario. In addition, a novel parallel partial-sum calculator (PSC) architecture is introduced to update partial-sum registers with multiple decoded bits by taking only one processing cycle. Implementation results show that the proposed 8-parallel SC polar decoder in 28-nm CMOS requires only 0.140 mu s to decode a (1024, 512) codeword of 5C system, remarkably reducing the decoding latency when compared to the state-of-the-art designs.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/108367
- DOI
- 10.1109/TVLSI.2021.3068965
- ISSN
- 1063-8210
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, vol. 29, no. 6, page. 1083 - 1094, 2021-06
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.