共查询到19条相似文献,搜索用时 87 毫秒
1.
2.
3.
4.
利用GRS(generalized reed-solomon)码的生成多项式提出了基于改进的2-D GRS(two-dimensional GRS)码设计和构造QC-LDPC(quasi-cyclic low density parity-check)码的方法,使所构造的码具有较好的译码性能。同时在码的构造过程中,考虑到了准双对角线结构和合适的度分布。不同码率的LDPC码用于和新设计的QC-LDPC码进行测试和比较。实验结果表明,所提出的码构造方法可加快LDPC码校验矩阵的构造,同时基于所提出方法构造的QC-LDPC码可提高译码性能,并降低编码复杂度。 相似文献
5.
6.
7.
具有不等错误保护特性的LDPC 编码调制方案 总被引:1,自引:0,他引:1
针对LDPC(low-density parity-check)编码调制系统,提出了一种新的具有不等错误保护特性的调制方案,在一个码字内,利用不同的调制方式对于重要的比特给予较强的保护,对于次要的比特给予较弱的保护,该方案既适用于非规则LDPC码,也适用于规则LDPC码。计算机仿真结果表明,新方案的性能是传统16QAM及4QAM的折衷,当采用1/2码率时,其频带利用率与8PSK相同,但是误码率性能优于8PSK。新方案的性能优于现有文献中基于比特可靠性的调制映射方案,并采用EXIT(extrinsic information transfer)图对新方案的优异性能给出了解释。 相似文献
8.
9.
为了提高混合自动重传请求(H-ARQ)系统的通信性能,研究了H-ARQ块衰落信道上全分集低密度奇偶校验(LDPC)码的构造与性能.首先分析了H-ARQ块衰落信道的中断概率及其固有分集,然后构造了在H-ARQ块衰落信道上能取得全分集的LDPC码,新构造的码字采用根校验节点把每次传输联系起来,从而获得全分集.在此基础上,分析了全分集LDPC码的结构,提出了通过提高全分集校验比特的比例,改善全分集LDPC码在H-ARQ信道上编码增益的方法.仿真结果表明,所提算法在H-ARQ信道上不仅能取得全分集,而且具有较高的编码增益 相似文献
10.
利用有限几何中的点和线,构造出低密度奇偶校验(LDPC)码的校验矩阵。根据这种LDPC码的特点,通过对校验矩阵的行或列变换得到其对偶码,从而获得基于CSS码的量子LDPC码。以量子码(15,4)为例,验证了这种量子LDPC码构造算法的可行性。在仅考虑比特翻转信道下对该量子码进行性能分析,结果表明用这种方法易于得到其对偶码,并且得到的量子码比经典码有更好的性能。 相似文献
11.
为了提高图像在无线信道传输的有效性和可靠性,提出一种优化的LDPC信道编码的不等保护图像传输系统——用PEG方法直接生成列重增加的校验矩阵的系统编码。指出由于LDPC码的不规则特性使其对较为敏感的重要信息给予更多的保护,将整体传输分为不同的保护级别进行处理。仿真结果显示改进的方案在客观的PSNR上和主观的视觉效果上都较之等保护措施有明显的改进。 相似文献
12.
《Communications, IEEE Transactions on》2006,54(6):994-1005
We introduce a new family of unequal error protection (UEP) codes, based on low-density parity-check (LDPC) component codes and Plotkin-type constructions. The codes are decoded iteratively in multiple stages, and the order of decoding determines the level of error protection. The level of UEP among the code bits is also influenced by the choice of the LDPC component codes and by some new reliability features incorporated into the decoding process. The proposed scheme offers a very good tradeoff between code performance on one side and encoding/decoding and storage complexity on the other side. The novel approach to UEP also allows for finding simple approximations for the achievable degrees of UEP, which can be used to govern practical code design implementations. 相似文献
13.
Quasi-cyclic LDPC codes for fast encoding 总被引:18,自引:0,他引:18
Myung S. Yang K. Kim J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(8):2894-2901
In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can be significantly reduced, as compared with randomly constructed LDPC codes. We show that the girth of a QC-LDPC code is upper-bounded by a certain number which is determined by the positions of circulant permutation matrices. The B-LDPC codes are constructed as irregular QC-LDPC codes with parity-check matrices of an almost lower triangular form so that they have an efficient encoding algorithm, good noise threshold, and low error floor. Their encoding complexity is linearly scaled regardless of the size of circulant permutation matrices. 相似文献
14.
In this letter, we propose a new scheme to construct low-density parity-check (LDPC) codes that are suitable for unequal error protection (UEP). We derive UEP density evolution (UDE) formulas for the proposed ensemble over the binary erasure channel (BEC). Using the UDE formulas, high performance UEP codes can be found. Simulation results depict an improvement in the bit error rate of more important bits in comparison with previous results on UEP-LDPC codes. 相似文献
15.
Jinhyun Youn Jang H. Kyoungsoo Kim Jichai Jeong 《Lightwave Technology, Journal of》2005,23(9):2673-2680
Forward-error correction (FEC) coding is theoretically investigated to improve bit-error-rate (BER) performance in a 10-Gb/s optical transmission system using randomly irregular low-density parity-check (LDPC) codes, regular LDPC codes, and the Reed-Solomon (RS) (255,239) code as a comparison. The irregular LDPC codes has different row-weight variances of a parity-check matrix from 10.9 to 18.8 and a row-weight mean of 60. Simulation is carried out under various conditions including the impairment factors such as dispersion, polarization-mode dispersion (PMD), and fiber nonlinearities. Results suggest that the irregular LDPC code with a low row-weight variance (=10.9) generally has better performance for the most impairment factors except for the factor of dispersion. On the other hand, for the factor of dispersion the irregular LDPC code performs better with a high row-weight variance (=18.8). A specific LDPC code can overcome the impairment limits in a deployed link. 相似文献
16.
Low-density parity-check (LDPC) codes [1] have attracted much attention in the last decade owing to their capacityapproaching performance. LDPC codes with a dual-diagonal blockbased structure can be encoded in linear time with lower encoder hardware complexity [2]. This class of LDPC codes is adopted by a number of standards such as wireless LAN (IEEE 802.11n) [3], wireless MAN (IEEE 802.16e, WiMAX) [4] and satellite TV (DVB-S2) [5]. LDPC codes are commonly decoded by the iterative belief-propagation (BP) algorithm. The decoder checks the parity-check equations to detect successful decoding at the end of the iteration. The Tanner graph of an irregular LDPC code consists of nodes with different degrees such that coded bits have unequal error protection [6]. Coded bits associated with higher degree nodes tend to converge to the correct answer more quickly. Hence, in order to give better protection to the transmitted data, data bits are always mapped to higher degree nodes whereas parity bits are mapped to lower degree nodes in the encoding process. The commonly used parity-check equations Hc t ? 0t will be satisfied after all the coded bits are correctly decoded. However, as discussed above, data bits converge to the correct answer much more quickly than parity bits, so some unnecessary iterations are wasted waiting for the parity bits to be decoded. In this Letter, a new set of low-complexity check equations are derived for dual-diagonal block-based LDPC codes. Early detection of successfully decoded data can be achieved by exploiting the structure and degree of distribution of the dual-diagonal parity check matrix. The decoder power, speed and complexity can be improved by adopting these equations. Simulation shows that the coding gain performance is little changed. 相似文献
17.
We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve. 相似文献
18.
针对 IRA-LDPC 码类的半随机半代数结构设计 总被引:1,自引:0,他引:1
提出用半随机半代数结构的设计方法来构造IRA-LDPC码的信息位所对应的奇偶校验矩阵H d。与现有结构化LDPC码相比,所给出的H d矩阵的结构化紧凑表示阵列的独特优势在于:可使H d矩阵中每个1元素的位置坐标均能用数学表达式计算得到,不仅极大地降低了随机奇偶校验矩阵对存储资源的消耗,而且还为LDPC编解码器的低复杂度硬件实现提供了可能性。与现有工业标准中的LDPC码相比,所提出的IRA-LDPC码在误码率与信噪比的仿真性能方面也占有优势。 相似文献
19.
This letter presents a systematic and recursive method to construct good low-density parity-check (LDPC) codes, especially those with high rate. The proposed method uses a parity check matrix of a quasi-cyclic LDPC code with given row and column weights as a core upon which the larger code is recursively constructed with extensive use of pseudorandom permutation matrices. This construction preserves the minimum distance and girth properties of the core matrix and can generate either regular, or irregular LDPC codes. The method provides a unique representation of the code in compact notation. 相似文献