Protograph-Based LDPC Hadamard Codes

نویسندگان

چکیده

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying constraints the check nodes in generalized protograph-based LDPC code, followed by lifting protograph. We name formed protograph-based (PLDPC-Hadamard) also modified Protograph Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing PLDPC-Hadamard code designs. proposed further allows analysis with degree- 1 and/or punctured nodes. find decoding thresholds ranging from ?1.53 dB ?1.42 dB. At BER 10 ?5 , gaps our range 0.40 (for rate = 0.0494) 0.16 0.003). Moreover, error performance comparable that traditional LDPC-Hadamard Finally, performances after puncturing are simulated compared.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes: Finite-length Protograph-based Spatially Coupled LDPC Codes

The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes is analyzed over the binary erasure channel (BEC). Existing scaling laws are extended to arbitrary protograph base matrices including puncturing patterns and multiple edges between nodes. Compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-...

متن کامل

Ensemble Trapping Set Enumerators for Protograph-Based LDPC Codes

Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. Recently, techniques for finding asymptotic trapping set enumerators in regular and irregular LDPC code ensembles was published [1]. In this paper, finite-length ensemble trapping set enumerators for protographbased LDPC codes are obtained. The asymptotic results...

متن کامل

Protograph-Based Generalized LDPC Codes: Enumerators, Design, and Applications

Among the recent advances in the area of low-density parity-check (LDPC) codes, protograph-based LDPC codes have the advantages of a simple design procedure and highly structured encoders and decoders. These advantages can also be exploited in the design of protograph-based generalized LDPC (G-LDPC) codes. In this dissertation we provide analytical tools which aid the design of protographbased ...

متن کامل

Performance Analysis of Protograph-based LDPC Codes with Spatial Diversity

In wireless communications, spatial diversity techniques, such as space-time block code (STBC) and single-input multiple-output (SIMO), are employed to strengthen the robustness of the transmitted signal against channel fading. This paper studies the performance of protograph-based low-density parity-check (LDPC) codes with receive antenna diversity. We first propose a modified version of the p...

متن کامل

Quasi-cyclic Expansion Algorithm for Protograph LDPC Codes Based on PEG and PH

One of the important code of modern coding theory, the protograph LDPC code technology has been gained more and more attention due to its low encoding complexity, fast decoding speed, low BER, and simple optimization analysis process etc. the quasi-cyclic expansion algorithm of the protograph LDPC codes, named as PQCE algorithms, can complete the extension of protograph and eventually get the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2021

ISSN: ['1558-0857', '0090-6778']

DOI: https://doi.org/10.1109/tcomm.2021.3077939