Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.     

Robust reversible image watermarking scheme based on spread spectrum

Robust reversible watermarking can provide robustness against various attacks besides the ability to recover the cover image. However, robustness and reversibility are somewhat separate in many schemes. The original cover image cannot be recovered even if the watermarked image suffers from a tiny distortion. This paper presents a new robust reversible watermarking scheme by exploring the reversibility of spread-spectrum codes. Watermark bits are embedded by a suggested adaptive spread-spectrum code. The embedding amplitude used in the algorithms is determined by quantizing the source interference of the cover. The proposed scheme is robust to various attacks. Furthermore, since the embedding amplitude is available at the receiver, the original image can be recovered losslessly when there is no attack. Even in the presence of attacks, the original cover images can still be partially recovered. Experimental results demonstrate that the proposed scheme performs well on robustness and watermarked image quality, and provide extra reversibility that resists image distortions.     

扩频体制低轨卫星通信信号捕获与跟踪系统设计

针对扩频体制下低轨卫星信号的捕获及跟踪等系统设计实现问题,根据卫星信号模型进行了捕获及跟踪算法设计,重点对基于快速傅里叶变换的快速捕获算法、锁频环、锁相环和码跟踪环路进行了设计,并进行了工程系统实现。试验验证表明,该系统可以实现码分多址体制低轨卫星信号捕获、跟踪处理,工作性能参数满足系统需求。     

序贯检测在“北斗”卫星信号捕获过程中的应用

为了提高“北斗”系统的捕获性能,解决在弱信号环境中无法有效捕获与检到卫星信号的问题,在“北斗”系统的捕获方法中采用序贯检测的方式进行了改进与优化。分析后得出,序贯检测通过双门限与待检测区,使得样本数灵活可变,可以有效应对不同信噪比的信号,在强信号与弱信号下都有良好的效果。通过仿真对序贯检测方式与传统检测方式进行了性能上的比较与分析,结果表明,序贯检测逻辑不仅达到了传统检测方法中预期的检测概率和虚警概率,同时具备更高的性能与灵活性,强信号下缩短了捕获时间,提高了捕获效率;弱信号下提高了2～3 dB信噪比增益与捕获性能;既保证了该检测逻辑的可行性,又为捕获检测过程提供了一种思路与方法。     

基于SSCANL译码器的联合迭代检测译码算法

为了提升基于极化码的稀疏码多址接入（sparse code multiple access,SCMA）系统接收机性能,提出了基于简化软消除列表（simplify soft cancellation list,SSCANL）译码器的循环冗余校验（cyclic redundancy check,CRC）辅助联合迭代检测译码接收机方案。该方案中极化码译码器使用SSCANL译码算法,采用译码节点删除技术对软消除列表（soft cancellation list,SCANL）算法所需要的L次软消除译码（soft cancellation, SCAN）进行简化,通过近似删除冻结位节点,简化节点间软信息更新计算过程,从而降低译码算法的计算复杂度。仿真结果表明,SSCANL算法可获得与SCANL算法一致的性能,其计算复杂度与SCANL算法相比有所降低,码率越低,算法复杂度降低效果越好;且基于SSCANL译码器的CRC 辅助联合迭代检测译码接收机方案相较基于SCAN译码器的联合迭代检测译码（joint iterative detection and decoding based on SCAN decoder, JIDD-SCAN）方案、基于SCAN译码器的CRC辅助联合迭代检测译码（CRC aided joint iterative detection and decoding based on SCAN decoder,C-JIDD-SCAN）方案,在误码率为10^-4时,性能分别提升了约0.65 dB、0.59 dB。     

无速率编码中度分布的研究和发展

无速率编码作为一种纠删码,在减少反馈重传的同时也具有码率灵活、编译码简单的特性,在许多领域都有广阔的应用前景。度分布作为无速率编码设计的基础,对无速率编码的性能有至关重要的影响。随着无速率编码的广泛应用,度分布的设计也需要随着场景和需求的变化进行优化。首先论述了无速率编码的发展与应用,从几种经典的无速率编码和度分布开始,详细地从应用场景、优化目标以及现有优化方法 3 个角度,对目前无速率编码中度分布的研究和发展进行了总结与分析。最后,对无速率编码和度分布的发展应用趋势进行了分析与展望。     

Research on encoding and decoding of non-binary polar codes over GF(2m)

Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2^m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.     

QSPR Modeling of Gibbs Free Energy of Organic Compounds by Weighting of Nearest Neighboring Codes

We examine the encoding of chemical structure of organic compounds by Labeled Hydrogen-Filled Graphs (LHFGs). Quantitative Structure-Property Relationships (QSPR) for a representative set of 150 organic molecules have been derived by means of the optimization of correlation weights of local invariants of the LHFGs. We have tested as local invariants Morgan extended connectivity of zero- and first order, numbers of path of length 2 (P2) and valence shells of distance of 2 (S2) associated with each atom in the molecular structure, and the Nearest Neighboring Codes (NNC). The best statistical characteristics for the Gibbs free energy has been obtained for the NNC weighting. Statistical parameters corresponding to this model are the following n = 100, r² = 0.9974, s = 5.136 kJ/mol, F = 38319 (training set); n = 50, r² = 0.9990, s = 3.405 kJ/mol, F = 48717 (test set). Some possible further developments are pointed out.     

Structure and electronic structure of [(CF3)2PN]2NVCl2, a molecule involving a planar six-membered ring (N3P2V)

Summary The SCF method is applied to determine the (gas phase) structure of [(CF₃)₂PN]₂NVCl₂, which agrees with the solid-state X-ray structure within typical errors of 2 pm and 2° in bond distances and angles. The electronic structure of atoms forming the ring is best described in terms of divalent N^– and tetravlent P⁺ with appreciable declocalization of nitrogen lone pairs into low-lying empty orbitals of neighbouring atoms P and V. No evidence for aromaticity of the ring system is found.     

二维同步OCDMA系统的性能分析

构造了一种用于二维同步光码分多址(OCDMA)系统的修正素数跳频码(MPC/PC),分析了码字的自相关和互相关性能,研究了二维同步OCDMA系统的误码率和吞吐量性能.结果表明,与一维同步OCDMA系统相比,二维同步OCDMA系统的可接入用户数大大增加,误码率大大降低,吞吐量明显提高.