Low-power Channel Coding
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 선우명훈 | - |
dc.contributor.author | 배정현 | - |
dc.date.accessioned | 2022-11-29T02:32:13Z | - |
dc.date.available | 2022-11-29T02:32:13Z | - |
dc.date.issued | 2020-08 | - |
dc.identifier.other | 30129 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/19729 | - |
dc.description | 학위논문(박사)--아주대학교 일반대학원 :전자공학과,2020. 8 | - |
dc.description.tableofcontents | I. Introduction 1 1. Linear Block Code 3 2. AWGN Channel 4 II. Low-power Adaptive Forced Convergence algorithm for LDPC code 6 1. Overview of LDPC codes 6 2. Existing Forced convergence algorithm 7 3. Proposed adaptive forced convergence algorithm 12 4. Simulation result 15 III. Area-efficient L Minimum value generator for Polar SCL decoder 24 1. Overview of Polar code 24 2. Proposed Bit-serial L minimum value generator 26 3. Implementation results 34 IV. Low power BCH decoder using early termination algorithm 37 1. Syndrome computation 39 2. Chien Search 41 3. Simulation Results 42 4. Implementation results 44 5. Digital baseband transceiver for capsule endoscopy 46 V. Conclusion 55 Bibliography 56 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | Low-power Channel Coding | - |
dc.title.alternative | JungHyun Bae | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.alternativeName | JungHyun Bae | - |
dc.contributor.department | 일반대학원 전자공학과 | - |
dc.date.awarded | 2020. 8 | - |
dc.description.degree | Doctoral | - |
dc.identifier.localId | 1151640 | - |
dc.identifier.uci | I804:41038-000000030129 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000030129 | - |
dc.subject.keyword | BCH | - |
dc.subject.keyword | LDPC | - |
dc.subject.keyword | Low power channel coding | - |
dc.subject.keyword | Polar | - |
dc.description.alternativeAbstract | Advanced error correction codes (LDPC, Polar, etc.) theoretically have performance close to Shannon's limit. However, there is a performance degradation at the implementation stage. To be a good error correction code, various factors such as low computational complexity and ease of implementation must be met while satisfying good error correction ability. The author claims that the advanced error correction code not only satisfies the theoretically high error correction performance but also, in fact, it is most important to implement a low power error correction code decoder. This thesis discusses low-power algorithms and implementations for LDPC code, Polar code, and BCH code. Since LDPC codes have a characteristic of iterative decoding algorithm, an adaptive forced convergence algorithm is proposed that is deactivated when a variable node exceeds the threshold value. The proposed forced convergence algorithm was able to further reduce the check node computation amount by approximately 66.86% and 35.68%. In Polar code, as the size of L increases in the SCL decoding algorithm, the Path metric sorting time increases exponentially. In order to achieve high throughput and low latency of Polar list decoder, the proposed L minimum value generator using bit-serial scheme to support high operating frequency of Polar list decoder at high list size. Since the ratio of the area corresponding to the controller is high when the list size is small, the proposed generator has a slightly higher AT complexity compared to previous ones. However, when L = 16 and L = 32, the proposed L minimum value generator can be performed with AT complexity of 39% and 11.5% compared to previous ones. The proposed BCH decoder for low-power medical devices adopts an early termination technique, reducing the power and latency of Syndrome computation and Chien search module by 42.08% and 45.78%, respectively. The proposed BCH decoder uses the Peterson algorithm considering power and area for wireless capsule endoscopy. | - |
dc.title.subtitle | Algorithms and Implementations | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.