Performance analysis and design of quasi-cyclic LDPC codes for underwater magnetic induction communications

Magnetic induction (MI) communication is an effective scheme for underwater wireless communication. In this paper, we aim to design an underwater MI communication system based on Quasi-cyclic LDPC (QC-LDPC) codes. Firstly, for a given QC-LDPC code used in underwater MI communication, we propose a novel algorithm to evaluate its performance, which is named as underwater magnetic induction protograph (UWMIP) extrinsic information transfer algorithm. Furthermore, we present a differential evolution UWMIP (DE-UWMIP) algorithm, which incorporates the differential evolution method and the UWMIP algorithm. By this algorithm, we search the optimized QC-LDPC codes with best distance threshold. Simulation results show that the proposed algorithm is effective and provide a good guidance to design the underwater MI communication system.     

Multiple decoding for polar-coded chase combining HARQ

The polar-coded hybrid automatic repeat request (HARQ) scheme with chase combining (CC) has very low complexity and is easy to combine with other techniques such as the coded-modulation and space–time coding, etc. However, the CC-HARQ scheme usually suffers from error and throughput performance degradation. A multiple decoding CC-HARQ (MDCC-HARQ) scheme is proposed in this paper by providing extra decoding chances when the joint decoding fails. Specifically, new LLR-sequences are constructed from the received signals, which can be utilized for the extra decoding attempts. Simulation results show that the proposed MDCC-HARQ scheme can achieve better error-performance and higher throughput efficiency, while requires less retransmission when compared with the CC-HARQ scheme.     

卫星振动对星间光码分多址系统性能的影响

卫星振动是影响星间光CDMA通信系统性能的一个重要因素.考虑多用户干扰、背景光噪音、热噪音、接收机噪音和卫星振动,给出了基于PPM信号格式的星间二维光CDMA通信系统的系统模型.采用数值分析的方法,详细分析了卫星振动对该系统误码率性能的影响.结果表明,码速率、通信波长和卫星振动都会影响星间二维光CDMA通信系统的误码率性能.当卫星振动标准偏差σ≤4×10－7时,卫星振动对系统误码率性能的影响较小;当卫星振动标准偏差σ≥1.2×10－6,卫星振动对系统误码率性能的影响很大,得到的误码率难以满足系统的通信要求,需要采用卫星振动抑制或补偿等技术提高星间二维光CDMA通信系统的误码率性能.     

B邻接片错误定位码的译码

针对两类Ｂ邻接片错误定位码进行了分析，并给出了其译码方案．     

Weight distributions of a class of cyclic codes with arbitrary number of nonzeros in quadratic case

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three nonzeros. Recently, the authors of [37] constructed a class of cyclic codes with arbitrary number of nonzeros, and computed the weight distribution for several cases. In this paper, we determine the weight distribution for a new family of such codes. This is achieved by introducing certain new methods, such as the theory of Jacobi sums over finite fields and subtle treatment of some complicated combinatorial identities.     

The analysis of the error statistics in a 5 × 40 Gbit/s fibre link with hybrid amplification

We quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10^− 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over.     

The Friedberg–Lee symmetry and minimal seesaw model

The Friedberg–Lee (FL) symmetry is generated by a transformation of a fermionic field q to q+ξz. This symmetry puts very restrictive constraints on allowed terms in a Lagrangian. Applying this symmetry to N fermionic fields, we find that the number of independent fields is reduced to N−1 if the fields have gauge interaction or the transformation is a local one. Using this property, we find that a seesaw model originally with three generations of left- and right-handed neutrinos, with the left-handed neutrinos unaffected but the right-handed neutrinos transformed under the local FL translation, is reduced to an effective theory of minimal seesaw which has only two right-handed neutrinos. The symmetry predicts that one of the light neutrino masses must be zero.     

LDPC码在量子密钥分配多维协商算法中的应用

密钥协商是量子密钥分配(QKD)的重要环节,影响着QKD的密钥率和安全距离.作为一种低信噪比时较为高效的密钥协商方案,多维协商算法被很好地应用在高斯调制连续变量QKD中,延长了通信距离.本文研究了二进制LDPC码在多维协商算法中的应用方案,进而扩展到多进制LDPC码.仿真表明,相比二进制LDPC码,利用多进制LDPC码能够使多维协商性能获得明显增益.     

Secure Polar Coding for the Primitive Relay Wiretap Channel

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.     

On Weierstrass semigroups and sets: a review with new results

In this work we present a survey of the main results in the theory of Weierstrass semigroups at several points, with special attention to the determination of bounds for the cardinality of its set of gaps. We also review results on applications to the theory of error correcting codes. We then recall a generalization of the concept of Weierstrass semigroup, which is the Weierstrass set associated to a linear system and several points. We finish by presenting new results on this Weierstrass set, including some on the cardinality of its set of gaps.