The joint base matrix BJ of the joint source-channel coding (JSCC) system based on double protograph low-density parity-check (DP-LDPC) codes consists of four components, namely, the source code Bs, the channel code Bc, the type-1 connection edge BL1 and the type-2 connection edge BL2, each having a non-negligible influence on the system performance. Different from the traditional component-specific design approach, we propose a joint design and optimization algorithm based on the idea of multi-objective differential evolution (MODE). Specifically, we consider the optimization of the DP-LDPC JSCC system through joint design of three components Bs, Bc, BL1 and all four components Bs, Bc, BL1, BL2, respectively. The proposed algorithm has low search complexity due to the reduction in size and element value of base matrices. The joint protograph extrinsic information transfer (JPEXIT) analyses and the simulation results demonstrate that the resulting JSCC system is free from a high error floor, requires fewer number of iterations for reaching the same bit error rate (BER) and achieves significant coding gains as compared to the state-of-the-art. Our DP-LDPC JSCC system is also shown to outperform its separation-based counterpart by a wide margin.
With the development of deep learning, the Super-Resolution (SR) reconstruction of microscopic images has improved significantly. However, the scarcity of microscopic images for training, the underutilization of hierarchical features in original Low-Resolution (LR) images, and the high-frequency noise unrelated with the image structure generated during the reconstruction process are still challenges in the Single Image Super-Resolution (SISR) field. Faced with these issues, we first collected sufficient microscopic images through Motic, a company engaged in the design and production of optical and digital microscopes, to establish a dataset. Secondly, we proposed a Residual Dense Attention Generative Adversarial Network (RDAGAN). The network comprises a generator, an image discriminator, and a feature discriminator. The generator includes a Residual Dense Block (RDB) and a Convolutional Block Attention Module (CBAM), focusing on extracting the hierarchical features of the original LR image. Simultaneously, the added feature discriminator enables the network to generate high-frequency features pertinent to the image’s structure. Finally, we conducted experimental analysis and compared our model with six classic models. Compared with the best model, our model improved PSNR and SSIM by about 1.5 dB and 0.2, respectively.
By using the residual source redundancy to achieve the shaping gain, a joint source-channel coded modulation (JSCCM) system has been proposed as a new solution for probabilistic amplitude shaping (PAS). However, the source and channel codes in the JSCCM system should be designed specifically for a given source probability to ensure optimal PAS performance, which is undesirable for systems with dynamically changing source probabilities. In this paper, we propose a new shaping scheme by optimizing the bit-labeling of the JSCCM system. Instead of the conventional fixed labeling, the proposed bit-labelings are adaptively designed according to the source probability and the source code. Since it is simple to switch between different labelings according to the source probability and the source code, the proposed design can be considered as a promising low complexity alternative to obtain the shaping gain for sources with different probabilities. Numerical results show that the proposed bit-labelings can significantly improve the bit-error rate (BER) performance of the JSCCM system.
Using the source residual redundancy in a joint source and channel coded modulation (JSCCM) system to achieve a shaping gain has proven to be a good solution for probabilistic amplitude shaping. In a JSCCM system, rate-compatible source codes are essential for adapting to dynamically changing source probabilities. However, conventional rate-compatible source codes are not appropriate for JSCCM systems, since they may yield a loss in the shaping gain. Moreover, a code design that depends solely on the source decoding threshold appears to be ill suited, thus complicating the search for good source codes. In this paper, we propose a rate-compatible family of source codes for JSCCM systems based on an achievable system rate analysis and the source protograph extrinsic information transfer (PEXIT) algorithm. The proposed codes not only have good source decoding thresholds but also obtain shaping gains over the whole considered range of source probabilities. Numerical results show that the proposed rate-compatible family of source codes can significantly improve the bit-error-rate (BER) performance of the JSCCM system.
Due to the duality between source coding and channel coding, high-performance channel codes are often adopted for addressing source coding problems. In this paper, we investigate the design and analysis of protograph low-density parity-check (P-LDPC) codes in lossy source coding systems. First, we propose a novel lossy source coding architecture based on P-LDPC codes, and empirically verify that although high-performance channel codes perform exceptionally well in their intended domain, they are not inherently optimal for lossy compression. To facilitate analysis, we introduce the lossy compression protograph extrinsic information transfer (LC-PEXIT) algorithm, which aids in evaluating the rate-distortion (RD) performance of P-LDPC codes. Additionally, the LC-PEXIT algorithm allows for the prediction of key parameters, such as the prior coefficient P and the reinforcement rate R, both of which critically influence system performance. We further propose a design algorithm for lossy P-LDPC codes and provide two sets of design examples. Experimental results show strong alignment between the predicted and actual values of P and Rf, with the designed P-LDPC codes exhibiting superior RD performance compared to classical P-LDPC and state-of-the-art ultra-sparse LDPC (US-LDPC) codes. In particular, the designed P-LDPC codes over benchmark codes increases the system coding efficiency of up to approximate 70% and achieves a performance gain of 1.69 ~ 3.26 dB, making it highly effective for lossy compression applications.