DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Hyun-Cheol | - |
dc.contributor.advisor | 박현철 | - |
dc.contributor.author | Kim, Jae-Bum | - |
dc.contributor.author | 김재범 | - |
dc.date.accessioned | 2011-12-28T02:45:01Z | - |
dc.date.available | 2011-12-28T02:45:01Z | - |
dc.date.issued | 2009 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393128&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/54620 | - |
dc.description | 학위논문(박사) - 한국정보통신대학교 : 공학부, 2009.2, [ xv, 100 p. ] | - |
dc.description.abstract | Two classes of codes,turbo codes and low-density parity-check (LDPC) codes, show the outstanding performance with iterative decoding scheme. The logarithmic maximum a $\It{posteriori}$ (log-MAP) algorithm [1] and $\It{sum-product}$ algorithm (SPA) [2] are widely used for the optimum decoding scheme of turbo and LDPC codes, respectively. Because of high computational complexity of the optimum decoding schemes, the simplified schemes, max-log-MAP (MLMAP) and min-sum algorithm (MSA), are proposed, but they have significant performance degradations. Several types of modication for the simplified schemes, such as enhanced max-log-MAP (EMLMAP) [3] and normalized MSA [4], are suggested to improve performance of the simplified schemes. In this thesis, we investigate another modification for the simplified schemes by using extrinsic information transfer characteristics (EXIT) analysis. For turbo decoding, we propose modified EMLMAP algorithm which uses variable scaling-factor (VSF) $\hat{\alpha}$. The $\hat{\alpha}$ maximizing the mutual information of extrinsic messages generated from MLMAP algorithm is found by using the EXIT analysis. The improved convergence speed and performance of the modified EMLMAP algorithm applied the $\hat{\alpha}$ are shown by using computer simulations. For decoding of LDPC codes, we propose hybrid belief-propagation (hybrid-BP) algorithm which performs switching implementation from SPA to MSA. To find the optimum switching points $\hat{\eta}$, the EXIT characteristic -curve (EXIT-CC) of MSA should be analyzed. Since the output of MSA is non-Gaussian, the exact EXIT-CC of MSA is not produced directly. For drawing the exact EXIT-CC of MSA, we use correcting factor $\gamma$ which affects distribution of messages sent from variable node. By adopting the $\gamma$, the EXIT-CC of MSA can be obtained under the Gaussian approximation (GA). Using the analyzed the optimum switching points, the performance and efficiency of the hybrid-BP algorith... | eng |
dc.language | eng | - |
dc.publisher | 한국정보통신대학교 | - |
dc.subject | EXIT 분석기법 | - |
dc.subject | EXIT analysis | - |
dc.subject | LDPC codes | - |
dc.subject | Turbo codes | - |
dc.subject | Iterative decoding | - |
dc.title | Efficient algorithms for iterative decoding based on EXIT analysis | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 393128/225023 | - |
dc.description.department | 한국정보통신대학교 : 공학부, | - |
dc.identifier.uid | 020025897 | - |
dc.contributor.localauthor | Park, Hyun-Cheol | - |
dc.contributor.localauthor | 박현철 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.