期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
A novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization
1
作者 袁建国 汪哲 +2 位作者 何昌伟 林金朝 庞宇 《Optoelectronics Letters》 EI 2017年第3期217-220,共4页
In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is intr... In this paper, a novel soft reliability-based iterative majority-logic decoding algorithm with uniform quantization is proposed for regularly structured low density parity-check(LDPC) codes. A weighted measure is introduced for each check-sum of the parity-check matrix and a scaling factor is used to weaken the overestimation of extrinsic information. Furthermore, the updating process of the reliability measure takes advantage of turbo-like iterative decoding strategy. The main computational complexity of the proposed algorithm only includes logical and integer operations with the bit uniform quantization criterion. Simulation results show that the novel decoding algorithm can achieve excellent error-correction performance and a fast decoding convergence speed. 展开更多
关键词 decoding iterative quantization parity integer correction extrinsic turbo scaling operations
原文传递
Construction method of QC-LDPC codes based on multiplicative group of finite field in optical communication 被引量:3
2
作者 黄胜 敖翔 +1 位作者 李媛媛 张睿 《Optoelectronics Letters》 EI 2016年第5期349-352,共4页
In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on multiplicative group of finite field is prop... In order to meet the needs of high-speed development of optical communication system, a construction method of quasi-cyclic low-density parity-check(QC-LDPC) codes based on multiplicative group of finite field is proposed. The Tanner graph of parity check matrix of the code constructed by this method has no cycle of length 4, and it can make sure that the obtained code can get a good distance property. Simulation results show that when the bit error rate(BER) is 10-6, in the same simulation environment, the net coding gain(NCG) of the proposed QC-LDPC(3 780, 3 540) code with the code rate of 93.7% in this paper is improved by 2.18 dB and 1.6 dB respectively compared with those of the RS(255, 239) code in ITU-T G.975 and the LDPC(3 2640, 3 0592) code in ITU-T G.975.1. In addition, the NCG of the proposed QC-LDPC(3 780, 3 540) code is respectively 0.2 dB and 0.4 dB higher compared with those of the SG-QC-LDPC(3 780, 3 540) code based on the two different subgroups in finite field and the AS-QC-LDPC(3 780, 3 540) code based on the two arbitrary sets of a finite field. Thus, the proposed QC-LDPC(3 780, 3 540) code in this paper can be well applied in optical communication systems. 展开更多
关键词 multiplicative parity codes subgroups arbitrary correction decoding iteration selecting iterative
原文传递
A novel construction scheme of QC-LDPC codes based on the RU algorithm for optical transmission systems
3
作者 袁建国 梁梦琪 +2 位作者 王永 林金朝 庞宇 《Optoelectronics Letters》 EI 2016年第2期132-135,共4页
A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check(QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Ur... A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check(QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke(RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain(NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 d B, 1.25 d B and 0.29 d B more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate(BER) of 10^(-6). The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems. 展开更多
关键词 classic codes parity decoding encoding irregular Richardson correction iteration triangular
原文传递
Efficient Array Coding Scheme for Large-Scale Storage Systems
4
作者 Dan Tang 《Journal of Electronic Science and Technology》 CAS CSCD 2015年第2期102-106,共5页
A family of array codes with a maximum distance separable(MDS) property, named L codes, is proposed. The greatest strength of L codes is that the number of rows(columns) in a disk array does not be restricted by t... A family of array codes with a maximum distance separable(MDS) property, named L codes, is proposed. The greatest strength of L codes is that the number of rows(columns) in a disk array does not be restricted by the prime number, and more disks can be dynamically appended in a running storage system. L codes can tolerate at least two disk erasures and some sector loss simultaneously, and can tolerate multiple disk erasures(greater than or equal to three) under a certain condition. Because only XOR operations are needed in the process of encoding and decoding, L codes have very high computing efficiency which is roughly equivalent to X codes. Analysis shows that L codes are particularly suitable for large-scale storage systems. 展开更多
关键词 codes decoding dynamically parity restricted sector encoding operations running correcting
在线阅读 下载PDF
Performance of a PPM hard decision-based ARQ-FSO system in a weak turbulence channel
5
作者 尹建军 刘宏展 +2 位作者 黄蓉 高争光 韦中超 《Chinese Optics Letters》 SCIE EI CAS CSCD 2017年第6期1-6,共6页
We present an automatic repeat request(ARQ) free space optical(FSO) system, which consists of a pulse position modulation(PPM) hard decision and an ARQ. The new ARQ's data error detection is based on a PPM hard... We present an automatic repeat request(ARQ) free space optical(FSO) system, which consists of a pulse position modulation(PPM) hard decision and an ARQ. The new ARQ's data error detection is based on a PPM hard decision's results and can eliminate the traditional ARQ information redundancy. The results of the numerical simulation have a good agreement with theoretical analysis and show that the ARQ-FSO system can effectively improve the bit error rate(BER) performance of the direct hard decision PPM system. Additionally, the proposed system significantly improves the average throughput efficiency compared to traditional ARQ systems.These characteristics make the ARQ-FSO system suitable for application in low BER and complexity FSO scenarios. 展开更多
关键词 turbulence throughput redundancy eliminate request scenarios transmitter symbol decoding correction
原文传递
Implementation and verification of different ECC mitigation designs for BRAMs in flash-based FPGAs
6
作者 杨振雷 王晓辉 +2 位作者 张战刚 刘杰 苏弘 《Chinese Physics C》 SCIE CAS CSCD 2016年第4期77-85,共9页
Embedded RAM blocks(BRAMs) in field programmable gate arrays(FPGAs) are susceptible to single event effects(SEEs) induced by environmental factors such as cosmic rays, heavy ions, alpha particles and so on. As t... Embedded RAM blocks(BRAMs) in field programmable gate arrays(FPGAs) are susceptible to single event effects(SEEs) induced by environmental factors such as cosmic rays, heavy ions, alpha particles and so on. As technology scales, the issue will be more serious. In order to tackle this issue, two different error correcting codes(ECCs), the shortened Hamming codes and shortened BCH codes, are investigated in this paper. The concrete design methods of the codes are presented. Also, the codes are both implemented in flash-based FPGAs. Finally, the synthesis report and simulation results are presented in the paper. Moreover, heavy-ion experiments are performed,and the experimental results indicate that the error cross-section of the device using the shortened Hamming codes can be reduced by two orders of magnitude compared with the device without mitigation, and no errors are discovered in the experiments for the device using the shortened BCH codes. 展开更多
关键词 codes mitigation correcting parity shortened programmable verification decoding Hamming blocks
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部