In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC compon...In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.展开更多
Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph cod...Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-Ⅰ QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-Ⅰ QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w≤6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3, 4, the constructed type-w QC-LDPC codes have better(6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families(CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.展开更多
Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil s...Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].展开更多
Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)codes.However,OSNs usually consume a significant amount ...Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)codes.However,OSNs usually consume a significant amount of computational resources and limit the clock frequency,particularly when the size of the Circulant Permutation Matrix(CPM)is large.To simplify the architecture of the OSN,we propose a Simplified Offset Shuffle Network Block Progressive Edge-Growth(SOSNBPEG) algorithm to construct a class of QCLDPC codes.The SOSN-BPEG algorithm constrains the shift values of CPMs and the difference of the shift values in the same column by progressively appending check nodes.Simulation results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2.The SOSNBPEG codes can reduce the complexity of the OSNs by up to 54.3%,and can improve the maximum frequency by up to 21.7%for various code lengths and rates.展开更多
针对基于稀疏编码的超分辨率算法噪点、伪影较多的问题,提出一种双正则化参数核磁共振图像超分算法。该算法引入在线字典学习方法,以训练正则化参数λt分开训练生成精确的超完备字典对,并调整重建正则化参数λr,得到最佳的稀疏系数用于...针对基于稀疏编码的超分辨率算法噪点、伪影较多的问题,提出一种双正则化参数核磁共振图像超分算法。该算法引入在线字典学习方法,以训练正则化参数λt分开训练生成精确的超完备字典对,并调整重建正则化参数λr,得到最佳的稀疏系数用于恢复目标高分图像。实验结果表明:改进算法比双字典学习超分法的目标图像峰值信噪比和结构相似性平均值分别提高了1.30 d B和0.023,有效地抑制了噪点和边缘伪影,较大幅度地提升了核磁共振图像的超分效果。展开更多
基金supported by National Natural Science Foundation of China(No.61571061)
文摘In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.
文摘Multi-type quasi-cyclic(QC) low-density parity-check(LDPC) codes can be considered as multiple-edge protograph QC-LDPC codes having some advantages in the minimum Hamming distance bound over single-edge protograph codes or type-Ⅰ QC-LDPC codes when the base matrices have the same size. In this paper, we investigate a class of multi-type QC-LDPC codes whose parity-check matrices contain just one blockrow of circulants and we obtain the generator matrix of such codes in general form. Using the permutation arrays and defining injection arrays, we present a new approach to construct a class of high-rate type-Ⅰ QC-LDPC codes with girth 6 from the constructed 4-cycle free multi-type QC-LDPC codes. In continue, for 2 ≤ w≤6, some type-w QC-LDPC codes with girth 6 are constructed explicitly such that the constructed codes are flexible in terms of rate and length. To the best of our knowledge, for w = 5,6, this is the first paper which deals with the explicit construction of type-w QC-LDPC codes with girth 6 and high rates. Moreover, for w = 3, 4, the constructed type-w QC-LDPC codes have better(6,8)-cycle multiplicities than the codes with minimum achievable length recently constructed by cyclic difference families(CDFs). Simulation results show that the binary and non-binary constructed codes outperform the constituent underlying QC-LDPC codes.
基金supported by the Natural Science Foundation of China (No.11901062)the Sichuan Natural Science Foundation (No.2024NSFSC0417)。
文摘Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
基金supported by the National Natural Science Foundation of China under Grant No.61071083
文摘Offset Shuffle Networks(OSNs) interleave a-posterior probability messages in the Block Row-Layered Decoder(BRLD) of QuasiCyclic Low-Density Parity-Check(QC-LDPC)codes.However,OSNs usually consume a significant amount of computational resources and limit the clock frequency,particularly when the size of the Circulant Permutation Matrix(CPM)is large.To simplify the architecture of the OSN,we propose a Simplified Offset Shuffle Network Block Progressive Edge-Growth(SOSNBPEG) algorithm to construct a class of QCLDPC codes.The SOSN-BPEG algorithm constrains the shift values of CPMs and the difference of the shift values in the same column by progressively appending check nodes.Simulation results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2.The SOSNBPEG codes can reduce the complexity of the OSNs by up to 54.3%,and can improve the maximum frequency by up to 21.7%for various code lengths and rates.
文摘针对基于稀疏编码的超分辨率算法噪点、伪影较多的问题,提出一种双正则化参数核磁共振图像超分算法。该算法引入在线字典学习方法,以训练正则化参数λt分开训练生成精确的超完备字典对,并调整重建正则化参数λr,得到最佳的稀疏系数用于恢复目标高分图像。实验结果表明:改进算法比双字典学习超分法的目标图像峰值信噪比和结构相似性平均值分别提高了1.30 d B和0.023,有效地抑制了噪点和边缘伪影,较大幅度地提升了核磁共振图像的超分效果。
