检索结果-内蒙古大学图书馆

IEEE Computing, Communications and IoT Applications Conference (ComComAp)

作者： Shi, Xiang-Yi Zhao, Dan-Feng Tian, Hai Han, Tong-Zhou Harbin Engn Univ Coll Informat & Commun Engn Harbin Peoples R China

ISBN: (纸本)9781665441179

In order to meet the reliability requirements of 6G mobile communication, this paper proposes a method of constructing time-invariant spatially coupled low-density parity-check (SC-LDPC) codes based on the progressive edge growth (peg) algorithm. The base matrix for coupling is constructed by the peg algorithm. We design a new coupling algorithm by constraining the coupling edges, and use circular permutation matrix (CPM) algorithm to eliminate 4-cycles and reduce the number of 6-cycles. Compared to 5G NR LDPC codes, simulation results show the design has obvious coding gain over AWGN channel.

关键词： Time-Invariant SC-LDPC codes peg algorithm Coupling algorithm 6G

来源：评论

学校读者我要写书评

暂无评论

Key-Controlled peg-LDPC algorithm Design and Its Application in Secure Communication

Key-Controlled PEG-LDPC Algorithm Design and Its Application...

引用

7th International Conference on Communications, Signal Processing, and Systems (CSPS)

作者： Shi, Zhiping Zhang, Shujun Lyu, Fengcheng Bu, Fan Sun, Hongxia Zhang, Qian UESTC Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China Southwest Jiaotong Univ Chengdu 610031 Peoples R China Publ Secur Fire Force Coll Kunming 650208 Yunnan Peoples R China

ISBN: (纸本)9789811365089;9789811365072

Because of the security of the symmetric cryptosystem, a secure communication scheme based on peg-LDPC codes has been put forward in this paper. The secure and reliable integrated communication is based on hiding and changing generator matrix randomly and simultaneously under the premise of ensuring error correction ability of LDPC codes. The performance of LDPC codes constructed by peg algorithm is excellent, and this algorithm can construct an LDPC code with arbitrary code length and code rate.

关键词： Secure and reliable communication LDPC code peg algorithm

来源：评论

学校读者我要写书评

暂无评论

Anti-burst peg algorithm for P-LDPC Codes with Short-to-Medium Length 18

Anti-burst PEG Algorithm for P-LDPC Codes with Short-to-Medi...

引用

18th IEEE International Conference on Communication Technology (IEEE ICCT)

作者： Deng, Li Shi, Zhiping Li, Yanxia Tang, Rui UESTC Natl Key Lab Sci & Tech Commun Chengdu 611731 Sichuan Peoples R China CETC Key Lab Aerosp Informat Applicat Shijiazhuang 050002 Hebei Peoples R China

ISBN: (纸本)9781538676356

Protograph low-density parity-check (P-LDPC) codes are widely researched in communication systems due to the simple encoder structure and high-speed iterative decoding implementation. The key factors to affect the performance of P-LDPC codes are the base matrix and the lifting method. This paper focuses on the lifting method of P-LDPC codes with short-to-medium length over burst-error channels. An improved anti-burst protograph progressive edge-growth (IPpeg) algorithm based on edge constraints is proposed to improve the bit error rate (BER) performance. Simulation results show that the proposed IPpeg has better burst-resistance performance than the traditional peg based lifting algorithm (Ppeg) with or without random interleaver;additionally, on the premising of correctly decoding, more coding gains of IPpeg can be achieved with condition of larger channel transition probability, shorter code length or smaller coding rate.

关键词： burst-error channels P-LDPC codes peg algorithm short-to-medium length

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Ultra-Reliable Short Blocklength Analog Fountain Codes 88

Analysis and Design of Ultra-Reliable Short Blocklength Anal...

引用

88th IEEE Vehicular Technology Conference (VTC-Fall)

作者： Zhang, Ke Jiao, Jian Huang, Zixuan Feng, Bowen Wu, Shaohua Cao, Bin Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen Peoples R China

ISBN: (纸本)9781538663585

Machine-to-Machine (M2M) communications are expected to support extremely harsh requirements on both latency and reliability, which is characterized by the ultra reliable, low-latency coding (uRLLC) technology in physical layer. In this paper, motivated by the recent development on the finite-blocklength information theory, we propose an ultra reliable short blocklength analog fountain code (AFC) for M2M communications. First, we use the extrinsic information transfer (EXIT) chart to analyze the AFC compressive sensing belief propagation (CS-BP) decoding algorithm, by tracking the mutual information of AFC CS-BP decoding process, which related to the channel dispersion for the short blocklength AFC. Then, based on the EXIT chart analysis, we propose a Weight-set optimization progressive edge-growth (WO-peg) encoding algorithm for the short blocklength AFC. Simulation results show that the proposed WO-peg AFC scheme can effectively improve block error rate (BLER) in the short blocklength regime.

关键词： M2M communications analog fountain code extrinsic information transfer chart compressive sensing belief propagation peg algorithm

来源：评论

学校读者我要写书评

暂无评论

A kind of improved peg algorithm of q-ary LDPC codes

A kind of improved PEG algorithm of q-ary LDPC codes

引用

3rd International Conference on Mechanical and Electronics Engineering (ICMEE 2011)

作者： Tong, Ningning Zhao, Danfeng Wu, Yuping Harbin Engn Univ Coll Informat & Commun Engn Harbin Peoples R China Heilongjiang Inst Technol Dept Elect Engn Heilongjiang Peoples R China

ISBN: (纸本)9783037852866

Progressive-edge-growth (peg) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC code's implementation seriously. To such problem, the paper presents a improved method based on peg algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the peg algorithm, but the powerful advantage makes it be easily implemented by the hardware.

关键词： peg algorithm iterative encoding lower triangular form q-ary LDPC codes

来源：评论

学校读者我要写书评

暂无评论

Improved Minimum Weight, Girth, and ACE Distributions in Ensembles of Short Block Length Irregular LDPC Codes Constructed using peg and Cyclic peg (Cpeg) algorithms 9

Improved Minimum Weight, Girth, and ACE Distributions in Ens...

引用

9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)

作者： Abdu-Aguye, Umar-Faruk Ambroze, Marcel Adrian Tomlinson, Martin Univ Plymouth Fac Sci & Environm Sch Comp Elect & Math Plymouth Devon England

ISBN: (纸本)9781509034017

In this paper we introduce a novel progressive edge-growth (peg) algorithm, the cyclic peg (Cpeg) algorithm. The Cpeg algorithm uses an alternative edge establishment sequence to construct low-density parity-check (LDPC) codes. Irregular LDPC codes constructed using the Cpeg algorithm have improved girth and approximate cycle extrinsic message degree (ACE) compared to existing peg algorithms. We also analyze the minimum codeword weight, minimum stopping set weight, local girth, and local ACE distributions for codes in four very large ensembles of irregular LDPC codes. The code ensembles analyzed were constructed using standard peg, ACE modified standard peg, Cpeg, and ACE modified Cpeg algorithms. Modifications to improve the ACE in peg LDPC codes, by Xiao and Banihashemi, were implemented in the 'ACE modified' versions of the peg algorithms. The ACE modified standard peg algorithm constructed the code ensemble with the highest minimum codeword weight and minimum stopping set weight distributions, and the ACE modified Cpeg algorithm constructed the code ensemble with the highest local girth and ACE distributions. Short block length irregular LDPC codes with good degree distributions which have higher minimum weights than have been published for similar LDPC codes were found in the four code ensembles.

关键词： Approximate cycle extrinsinsic message degree (ACE) edge connections sequence girth low-density parity-check (LDPC) codes minimum distance minimum stopping set weight peg algorithm Tanner graph

来源：评论

学校读者我要写书评

暂无评论

Lowering the Error Floor of Short-to-Medium Length LDPC Codes using Optimal Low-Correlated-Edge Density (OED) peg Tanner Graphs 24

Lowering the Error Floor of Short-to-Medium Length LDPC Code...

引用

24th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Abdu-Aguye, Umar-Faruk Ambroze, Marcel Adrian Tomlinson, Martin Univ Plymouth Fac Sci & Environm Sch Comp Elect & Math Plymouth PL4 8AA Devon England

We propose a simple modification to the progressive edge-growth (peg) algorithm in order to control the girth of low-density parity-check (LDPC) code Tanner graphs constructed. Using the modified algorithm, the edge densities in short irregular rate-1/2 LDPC code graphs can be increased without increasing the correlation between edges in graphs by creating cycles of undesired length. Density evolution (DE) optimized symbol node degree distributions used for constructing short-to-medium length codes were further optimized (slightly altered) while maintaining the maximum edge correlation (minimum local girths) that exists in graphs constructed using the unaltered DE optimized distributions. As a result of improved degree sequences (and graph densities) which were derived, short-to-medium length LDPC codes with lower error floors than published for LDPC codes of identical length and rate were found. These slightly denser codes have lower error floor than codes constructed using DE optimized degree distributions in peg algorithms modified for improved approximate cycle extrinsic message degrees (ACE). Simulation results show that, at a code length of 512, efficient irregular rate-1/2 peg codes have significantly lower error floors than a rate-1/2 IEEE 802.16E (WiMAX) LDPC code of length 576.

关键词： Approximate cycle extrinsic message degrees (ACE) cycle edge correlation edge density error floor girth low-density parity-check (LDPC) codes minimum distance peg algorithm

来源：评论

学校读者我要写书评

暂无评论

Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC Codes

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2016年第2期34卷 329-344页

作者： Liu, Keke El-Khamy, Mostafa Lee, Jungwon Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA Avago Technol San Jose CA 95131 USA Samsung Elect Modem R&D San Diego CA 92121 USA Univ Alexandria Dept Elect Engn Alexandria 21544 Egypt Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 95616 USA

The replicate-and-mask (R&M) construction of finite-length spatially-coupled (SC) LDPC codes is proposed in this paper. The proposed R&M construction generalizes the conventional matrix unwrapping construction and contains it as a special case. The R&M construction of a class of algebraic spatially coupled (SC) quasi-cyclic (QC) LDPC codes over arbitrary finite fields is demonstrated. The girth, rank, and time-varying periodicity of the proposed R&M SC QC LDPC codes are analyzed. The error rate performance of finite-length nonbinary algebraic SC QC LDPC codes is investigated with window decoding. Compared to the conventional unwrapping construction, it is found through numerical simulations that the R&M construction resulted in SC QC LDPC codes with better block error rate performance and lower error floors. With a flooding schedule decoder, it is shown that the proposed R&M algebraic SC QC LDPC codes have better error performance than the corresponding LDPC block codes and random SC codes. The R&M construction of irregular SC QC LDPC codes is demonstrated. It is shown that low-complexity regular puncturing schemes can be deployed on these codes to construct families of rate-compatible irregular SC QC LDPC codes with good performance.

关键词： LDPC codes algebraic LDPC codes quasi-cyclic codes spatially-coupled LDPC codes girth peg algorithm rate-compatible codes HARQ

来源：评论

学校读者我要写书评

暂无评论

LDPC Codes Based on Hamming and BIBD Codes 13

LDPC Codes Based on Hamming and BIBD Codes

引用

13th IEEE International Conference on Signal Processing (ICSP)

作者： Ma, Huan Zhang, Lijun Beijing Jiaotong Univ Sch Elect & Inform Engn Beijing 100044 Peoples R China

ISBN: (纸本)9781509013456

A hybrid construction for LDPC codes based on (14, 8) extended Hamming code and (7, 7, 3, 3, 1) BIBD is proposed. The two short codes are used as components in the parity-check matrix of LDPC codes due to elegant decoding performance and structure properties. The new construction algorithm results in LDPC codes with high code rate, and graceful performance using sum-product algorithm (SPA). Experimental results show that hybrid codes constructed with progressive edge-growth (peg) algorithm and (14, 8) extended Hamming code or (7, 7, 3, 3, 1) BIBD perform well. Code with peg algorithm and (7, 7, 3, 3, 1) BIBD is 2 dB away from Shannon limit in AWGN channel.

关键词： dispersed matrix (14,8) extended Hamming code hybrid construction peg algorithm Rayleigh fading channel (7,7,3,3,1) BIBD

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm for Determining the Girth and ACE Distributions in LDPC Code Tanner Graphs 10

An Efficient Algorithm for Determining the Girth and ACE Dis...

引用

10th International Conference on Signal Processing and Communication Systems (ICSPCS)

作者： Abdu-Aguye, Umar-Faruk Ambroze, Marcel Adrian Tomlinson, Martin Plymouth Univ Fac Sci & Environm Sch Comp Elect & Math Plymouth Devon England

ISBN: (纸本)9781509009411

We propose a simple and efficient algorithm for evaluating the girth and approximate cycle extrinsic message degree (ACE) of all short cycles through symbol nodes in short-to-medium length low-density parity-check (LDPC) code Tanner graphs. The algorithm uses single-edge tree-apex (SETA) subgraph expansions to find all the short cycles in a code graph in a direct manner, unlike existing algorithms which use message-passing algorithms or trellis representations of code graphs. The complexity of the algorithm, when applied to a parity-check matrix H of dimension m x n, is O(n m). Due to the fact that both girth and ACE are features of cycles, we adopt parameters similar to those used for girth descriptions for ACE descriptions. Accordingly, we define the 'local ACE' at a symbol node or the 'symbol node ACE', as the minimum ACE of the short cycles through the symbol node in the graph. This basic parameter enables the local ACE distribution, minimum and maximum local ACE, modal ACE, and the average ACE of an LDPC code graph to be determined using SETA subgraph expansions. The average ACE of an LDPC code graph is a concise single-valued measure of the overall connectivity of cycles in the graph. The proposed algorithm determines the local girth and ACE distributions in irregular short length LDPC codes in less time than existing algorithms. The algorithm is not intended for quasi-cyclic (QC) LDPC codes.

关键词： Approximate cycle extrinsic message degree (ACE) bipartite graph cycle connectivity girth graph expansion low-density parity-check (LDPC) codes peg algorithm single-edge tree-apex (SETA) subgraph expansion Tanner graph

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：