RESUMEN
The performance analysis of polarization M-ary differential chaos shift keying (P-MDCSK) has been expressed using a tight upper bound with the Q-function. However, evaluating the Q-function directly is not a closed expression and there has been less work on closed expression for the upper bound. In order to solve the problem, this paper presents approximate closed-form expressions on the error probability of P-MDCSK. This expression is derived by employing a polynomial approximation of the Q-function. These closed-form expressions are verified through simulations conducted under both additive white Gaussian noise (AWGN) and multipath Rayleigh fading channels. The simulation results reveal that there exists only a negligible gap between the simulations and the derived closed-form expressions. For example, it is observed that the theoretical approximate closed-form expressions exhibit a marginal deviation of approximately 0.4 dB from the simulations when the bit error rate (BER) reaches 10-4. Although the proposed method can only give approximate closed-form expressions of the upper bound, it provides an effective method for other communication schemes where the exact BER closed-form formula cannot be obtained.
RESUMEN
Recently, a mesh model-based merging (M3) method and four basic graph models were proposed to construct the double protograph low-density parity-check (P-LDPC) code pair of the joint source channel coding (JSCC). Designing the protograph (mother code) of the P-LDPC code with both a good waterfall region and lower error floor is a challenge, and few works have existed until now. In this paper, the single P-LDPC code is improved to further verify the availability of the M3 method, and its structure is different from the channel code in the JSCC. This construction technique yields a family of new channel codes with lower power consumption and higher reliability. The structured design and better performance demonstrate that the proposed code is hardware-friendly.
