Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Early detection for decoding LDPC codes = LDPC 부호의 복호를 위한 선판정기법

Ho-Il Kim, 김호일

Published Jan 1, 2004• 0 citations
OpenAlex

Related papers

Early Detection Algorithm for Decoding LDPC Codes

Ho-Il Kim

한국통신학회 학술대회 및 강연회•Apr 1, 2004•4 citations

LDPC 부호의 경판정 복호를 위한 전처리

양대열, 양경철

Low-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by iterative decoding. They are extensively employed in communication system standards because of their capacity-approaching performance and low decoding complexity. \nThe composition of this thesis can be divided into two parts. Firstly, we design LDPC codes that perform at rates close to the Shannon capacity. For this we summarize three techniques for analyzing LDPC code ensembles and calculate the noise threshold of regular LDPC codes in the BIAWGN channel. And then we optimize degree distributions using the differential evolution and construct the parity-check matrix using the progressive edgegrowth \n(PEG) algorithm. \nSecondly, we examine the structure of LDPC codes in the layered division multiplexing (LDM) system. And we propose the low-complexity decoding algorithm with the simple preprocessing which is applicable in some situations. We also propose the good puncturing criterion to generate rate-compatible LDPC codes. Simulation results show that the punctured codes using the proposed method have better performance compared to randomly punctured one.

한국통신학회 학술대회논문집•Nov 1, 2015•0 citations

비이진 LDPC 부호의 저복잡도 복호를 위한 적응형 EMS 알고리듬

황영준, 조성혜, 전경훈 +1 more

한국통신학회 학술대회논문집•Nov 1, 2014•0 citations

저복잡도 LDPC 복호 알고리즘

이인기, 정지원, 최은아 +2 more

한국통신학회 학술대회논문집•Nov 1, 2004•0 citations

Overview of LDPC codes

Vikram Arkalgud Chandrasetty, Syed Mahfuzul Aziz

Elsevier eBooks•Dec 12, 2017•4 citations

(An) efficient pruning method and its hardware architecture for successive-cancellation decoding of polar codes = 극 부호의 연속 제거 복호를 위한 효율적인 가지치기 방법과 하드웨어 구조

Jaejoon Choi

•Jan 1, 2017•0 citations
Low-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by iterative decoding. They are extensively employed in communication system standards because of their capacity-approaching performance and low decoding complexity. \nThe composition of this thesis can be divided into two parts. Firstly, we design LDPC codes that perform at rates close to the Shannon capacity. For this we summarize three techniques for analyzing LDPC code ensembles and calculate the noise threshold of regular LDPC codes in the BIAWGN channel. And then we optimize degree distributions using the differential evolution and construct the parity-check matrix using the progressive edgegrowth \n(PEG) algorithm. \nSecondly, we examine the structure of LDPC codes in the layered division multiplexing (LDM) system. And we propose the low-complexity decoding algorithm with the simple preprocessing which is applicable in some situations. We also propose the good puncturing criterion to generate rate-compatible LDPC codes. Simulation results show that the punctured codes using the proposed method have better performance compared to randomly punctured one.