Joint Source-channel Coding System Research Articles

Hybrid Window Decoding for Joint Source Channel Anytime Coding System.

Joint source channel anytime coding (JSCAC) is a kind of joint source channel coding (JSCC) systems based on the causal spatially coupled coding and joint expanding window decoding (JEWD) techniques. JSCAC demonstrates greatly improved error correction performance, as well as higher decoding complexity. This work proposes a joint hybrid window decoding (JHWD) algorithm for JSCAC systems, aiming to reduce the decoding complexity while maintaining comparable error correction performance with the state of the art. Unlike the traditional JEWD technique and its variants, the proposed JHWD algorithm utilizes a hybrid window structure. It achieves this by implementing adaptive local expanding window decoding in the sliding window region, guided by syndrome-check-based detection. The hybrid window decoding characteristics of the proposed JHWD algorithm can both effectively reduce the decoding complexity caused by window expanding, and also mitigate the error propagation caused by window sliding. An improved density evolution algorithm is proposed for the asymptotic performance analysis of the proposed JHWD algorithm. Both the analytical and simulation results indicate that the proposed JHWD decoding scheme is a good low-complexity implementation option for JSCAC systems, which is also suitable for other JSCC systems with the spatially coupled coding structure.

Capacity Optimizing Resource Allocation in Joint Source-Channel Coding Systems with QoS Constraints

Capacity Optimizing Resource Allocation in Joint Source-Channel Coding Systems with QoS Constraints

Joint Source-Channel Coding System for 6G Communication: Design, Prototype and Future Directions

Joint Source-Channel Coding System for 6G Communication: Design, Prototype and Future Directions

Novel Double Protograph LDPC Codes for Joint Source-Channel Coding Systems

Novel Double Protograph LDPC Codes for Joint Source-Channel Coding Systems

Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory.

In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code pair) in a joint source-channel coding (JSCC) system. Specifically, we pre-set the girth of the parity-check matrix for the LDPC code pair when jointly designing the two LDPC codes, which are constructed by following the set constraints. The constructed parity-check matrices for channel codes comprise an identity submatrix and an additional submatrix, whose column weights can be pre-set to be any positive integer numbers. Simulation results illustrate that the constructed D-LDPC codes exhibit significant performance improvement and enhanced flexible frame length (i.e., adaptability under various channel conditions) compared with the benchmark code pair.

Design and Optimization of Linking Matrix for a JSCC System Based on DP-LDPC Codes.

Although extensive optimization of encoding and decoding schemes for joint source-channel coding (JSCC) systems has been conducted, efficient optimization schemes are still required for designing and optimizing the linking matrix between variable nodes of the source code and check nodes of the channel code. A scheme has been proposed for design and optimization of linking matrix with multi-edges by analyzing the performance of the JSCC system using the joint protograph extrinsic information transfer algorithm to calculate decoding thresholds. The proposed scheme incorporates structural constraints and is effective in designing and optimizing the multi-edges in linking matrix for the JSCC system. Experimental results have demonstrated that the designed and optimized linking matrix significantly improves the performance of the JSCC system. Furthermore, the proposed scheme reduces the complexity of the solution space for the optimized example.

Designing a Common DP-LDPC Code Pair for Variable On-Body Channels

The joint source channel coding (JSCC) system is sensitive to the changing channel characteristics, because the optimally designed source-channel code pair always needs to be redesigned when the transmission environment is updated. A solution is to seek a common code pair for variable channels. Channel model 3 (CM3) is a variable on-body channel following the Weibull distribution, which is analyzed in four conditions due to varying shape factors, namely with exponential, Rayleigh, log-normal and normal distributions. The JSCC system is considered in this paper based on double protograph low-density parity-check (DP-LDPC) code pair over the variable CM3 channel. Firstly, four DP-LDPC code pairs are searched by the conventional differential evolution (DE) algorithm with four distributions of the Weibull model, respectively. However, these four code pairs only present good bit-error ratio performance in their own distribution, and have error floors in the other three. To resolve the problem, an artificial intelligence method based on principle component analysis (PCA) algorithm is designed to extract the common code pair. It is demonstrated that the common code pair performs well in noise-varying and practical-parameter transmissions. Instead of four DE code pairs, the designed one PCA code pair provides a strong technical support to low-complexity manufacturing such as eHealthcare.

Redesign of Channel Codes for Joint Source-Channel Coding Systems over One-Dimensional Inter-Symbol-Interference Magnetic Recording Channels

Although the joint source-channel coding (JSCC) system based on double protograph low-density parity-check (DP-LDPC) codes has been shown to possess excellent error performance over additive white Gaussian noise (AWGN) channels, it cannot perform well over one-dimensional inter-symbol-interference (OD-ISI) magnetic recording channels. In this study, a new JSCC system with a three-stage serially concatenated framework of Turbo equalization is firstly proposed for OD-ISI magnetic recording channels. Then, a modified joint protograph extrinsic information transfer (M-JPEXIT) algorithm is put forward to analyze the convergence-performance of the proposed system. By applying the M-JPEXIT algorithm, the channel codes are redesigned for this system to improve the error performance. Both the M-JPEXIT analysis and the bit-error-rate (BER) simulation results show the performance improvement of the proposed channel codes, especially in the water-fall region.

Design and Analysis of Joint Source-Channel Code System with Fixed-Length Code

As the demands of multimedia and data services increase, efficient communication systems are being investigated to meet the high data rate requirements. Joint source-channel coding (JSCC) schemes were proposed for improving overall system performance. However, existing JSCC systems may suffer a symbol error rate (SER) performance loss when residual source redundancy is not fully exploited. This paper presents a novel, low-complexity JSCC system, which consists of a fixed-length source block code and an irregular convolutional channel code. A simple approach is proposed to design source codes that minimize the SER of source detection and guarantee the convergence of iterative source-channel decoding (ISCD). To improve the waterfall performance of ISCD, the channel code is optimized by using the extrinsic information transfer (EXIT) chart and the concept of irregular code. The channel code is constituted by recursive non-systematic convolutional (RNSC) subcodes. The weights of subcodes are optimized to make the EXIT curves of the channel decoder and the source decoder well-matched, and therefore, a near-capacity performance is achieved. Simulation results show that the proposed system achieves more than 1 dB gains and 0.3 dB gains compared to the separate source-channel code system and the other optimal JSCC systems, respectively. Additionally, the performance of the proposed system is within 1 dB deviation from the Shannon limit capacity.

Design of Code Pair for Protograph-LDPC Codes-Based JSCC System With Joint Shuffled Scheduling Decoding Algorithm

Although there are many studies on code optimization of the joint source-channel coding (JSCC) system based on double protograph low-density parity-check codes with the joint belief propagation (JBP) algorithm, but it is still unknown whether the source code and channel code (as a code pair) can perform well when the joint shuffled scheduling decoding (JSSD) algorithm is adopted. In this letter, two decoding threshold analysis algorithms, including joint shuffled protograph extrinsic information transfer (PEXIT) and source shuffled PEXIT algorithm, are proposed to calculate joint/source decoding thresholds for this system with the JSSD algorithm. With the proposed algorithms, it is found that the optimized code pairs for this system with the JBP algorithm may not perform well with the JSSD algorithm, implying that code pair with the JSSD algorithm needs to be redesigned. Then, a two-stage optimized framework is proposed to design the code pair for this system with the JSSD algorithm. Simulations and decoding threshold analysis both show that the proposed code pair for this system with the JSSD algorithm can obtain lower error floor and better waterfall performance than the existing code pairs.

Joint Early Stopping Criterions for Protograph LDPC Codes-Based JSCC System in Images Transmission.

In this paper, a joint early stopping criterion based on cross entropy (CE), named joint CE criterion, is presented for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) systems in images transmission to reduce the decoding complexity and decrease the decoding delay. The proposed early stopping criterion adopts the CE from the output likelihood ratios (LLRs) of the joint decoder. Moreover, a special phenomenon named asymmetry oscillation-like convergence (AOLC) in the changing process of CE is uncovered in the source decoder and channel decoder of this system meanwhile, and the proposed joint CE criterion can reduce the impact from the AOLC phenomenon. Comparing to the counterparts, the results show that the joint CE criterion can perform well in the decoding complexity and decoding latency in the low–moderate signal-to-noise ratio (SNR) region and achieve performance improvement in the high SNR region with appropriate parameters, which also demonstrates that this system with joint CE is a low-latency and low-power system.

Optimal Design of Joint Protomatrix for DP-LDPC Codes-Based JSCC System Over on-Body Channel

A high-quality data transmission scheme in wireless body area networks is implemented by a joint source-channel coding (JSCC) system with $M$ -ary differential chaos shift keying modulation over an on-body channel. Current DP-LDPC code pairs, which have shown good bit-error ratio performance over additive white Gaussian noise channel and Rayleigh fading channel, cannot perform well over on-body channel. In this paper, the DP-LDPC codes are redesigned for the JSCC system with new methods depending on the on-body channel characteristics. A protomatrix dimension-restrictive searching algorithm for DP-LDPC codes in the JSCC system is proposed according to the on-body channel bandwith and source statistic, which is effective to predesign the dimension of the code pair for a new JSCC system. In this way, the source-channel code rates are appropriately allocated to leave more source redundancy for improving the error floor. Moreover, the joint protomatrix is reconstructed into two kinds of compact structures by simplifying the edge linking relationships and modifying joint protograph extrinsic information transfer algorithm, which decreases the induction of searching entries to further accelerate the code searching speed. The searched code pairs show better bit-error ratio performances compared with existing DP-LDPC codes. The power consumption in the new joint coding system is lower than the separate coding system in WBAN on the physical layer.

Joint Component Design for the JSCC System Based on DP-LDPC Codes

The joint base matrix ${{{{B}}_{{\mathrm{J}}}}}$ 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 ${{{{B}}_{{\mathrm{s}}}}}$ , the channel code ${{{{B}}_{{\mathrm{c}}}}}$ , the type-1 connection edge ${{{{B}}_{{ \textit {L1}}}}}$ and the type-2 connection edge ${{{{B}}_{{ \textit {L2}}}}}$ , 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 ${{{{B}}_{{\mathrm{s}}}}}$ , ${{{{B}}_{{\mathrm{c}}}}}$ , ${{{{B}}_{{ \textit {L1}}}}}$ and all four components ${{{{B}}_{{\mathrm{s}}}}}$ , ${{{{B}}_{{\mathrm{c}}}}}$ , ${{{\mathbf{B}}_{{ \textit {L1}}}}}$ , ${{{{B}}_{{ \textit {L2}}}}}$ , 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.

Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.

Analog Mappings for Non-Linear Channels With Applications to Underwater Channels

This paper discuses the application of Analog Joint Source Channel Coding (JSCC) to Non-Linear Channels, including underwater acoustic channels. Different from traditional digital communication systems, which utilize a source code followed by a channel code, Analog JSCC systems perform coding via a single mapping. We will focus on a particular class of analog codes called space filling curves. The underwater acoustic channel is typically non-linear with Inter-Symbol Interference (ISI). We will first study a simplified version assuming no ISI, developing a scheme to adapt space filling curves to this environment, and studying the theoretical limits. Then, we will extend the analysis to the end-to-end acoustic channel (including ISI), discussing the proposed system in this case. Finally, we will present simulation results of the proposed communication system for the simplified (no ISI) and end-to-end channels.

Exploiting 2-Dimensional Source Correlation in Channel Decoding with Parameter Estimation

<span>Traditionally, it is assumed that source coding is perfect and therefore, the redundancy of the source encoded bit-stream is zero. However, in reality, this is not the case as the existing source encoders are imperfect and yield residual redundancy at the output. The residual redundancy can be exploited by using Joint Source Channel Coding (JSCC) with Markov chain as the source. In several studies, the statistical knowledge of the sources has been assumed to be perfectly available at the receiver. Although the result was better in terms of the BER performance, practically, the source correlation knowledge were not always available at the receiver and thus, this could affect the reliability of the outcome. The source correlation on all rows and columns of the 2D sources were well exploited by using a modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm in the decoder. A parameter estimation technique was used jointly with the decoder to estimate the source correlation knowledge. Hence, this research aims to investigate the parameter estimation for 2D JSCC system which reflects a practical scenario where the source correlation knowledge are not always available. We compare the performance of the proposed joint decoding and estimation technique with the ideal 2D JSCC system with perfect knowledge of the source correlation knowledge. Simulation results reveal that our proposed coding scheme performs very close to the ideal 2D JSCC system.</span>

The Design of Protograph LDPC Codes as Source Codes in a JSCC System

Although joint source-channel coding (JSCC) based on double protograph low-density parity-check (LDPC) codes has been shown to be an excellent solution for wireless communication, the protograph LDPC code for source coding needs to be optimized to improve the error-floor performance. In this letter, first, it is found that optimized protograph LDPC codes for channel coding are not optimal for source compression, which indicates that the source codes in the JSCC systems need to be designed specifically. Second, a rate-1/2 source code is designed by using the source decoding threshold as evaluation criteria. Finally, low rate source codes are designed by code lengthening. The protograph extrinsic information transfer analysis and the bit error rate simulation have shown that the proposed source codes obtain higher source decoding thresholds than conventional codes, which extend the range of compressible source entropies and improve the error-floor performance in the JSCC system.

Evaluation of Analog Joint Source-Channel Coding Systems for Multiple Access Channels

We address the evaluation of low-complexity analog Joint Source Channel Coding (JSCC) methods for the transmission of discrete-time analog symbols over Multiple-Input Multiple-Output (MIMO) Multiple Access Channels (MAC). Analog JSCC is employed to encode the source information at each transmitter prior to be directly input to the MAC access scheme. Three channel access methods are considered to ensure the receiver is able to recover the user information: Code Division Multiple Access (CDMA), linear MMSE access codes and opportunistic access. CDMA allows the orthogonal transmission of the user data requiring only Channel State Information (CSI) at reception. On the other hand, linear MMSE access codes exploit CSI knowledge at transmission and exhibit better performance. Finally, opportunistic access also exploits CSI at transmission and allocates all MAC resources to the user with the strongest channel. This latter access scheme exhibits the best performance in terms of sum distortion although it may lead to unfair rate distributions among users.

On Transmission of Multiresolution Gaussian Sources over Noisy Relay Networks

This paper investigates joint source-channel coding (JSCC) in a decode-and-forward three-node relay network, in which scalable source coding (SSC) is coupled with superposition coding (SPC) to form a layered coding architecture of SSC-SPC. In contrast to any previously reported research using asymptotic capacity-based distortion (CBD) measure, we derive the mean-squared error end-to-end distortion (EED) of such JSCC system based on a real-valued Gaussian source, aiming to achieve better precision and practicality for applications in which channels are subject to large error probabilities. The EED evaluation is formulated and applied to demonstrate achievable gains of the SSC-SPC architecture versus a number of conventional approaches. Power allocation optimization is performed based on the developed non-asymptotic EED model and compared to that by using an asymptotic CBD measure in which symbol losses caused by channel error cannot be considered. We demonstrate the performance gaps between results solved from EED versus CBD in our numerical example, and conclude that the optimization using CBD behaves awkwardly in computing proper power allocation configurations in the considered SSC-SPC architecture.

基于Real BCH码的联合信源信道编码技术

构建了基于Real BCH的联合信源信道编码系统，考虑量化噪声和信道噪声，将由量化、给定转移概率的二进制对称信道、反量化构成的实际联合信道建模为GBG (Gaussian background noise and Bernoulli Gaussian impulse noise)信道模型。图像经过小波子带分解后在基于Real BCH的联合信源信道编码系统中进行传输。Matlab仿真比较了信道在不同的转移概率状况下图像的传输效果。当信道的转移概率为10−3时，峰值信噪比PSNR达到39.5225 dB。仿真结果表明，基于Real BCH码的联合信源信道编码具有较好的图像传输效果，Real BCH编码具有较好的纠错性能。 Joint source-channel coding system based on Real BCH is constructed in this paper. Considering the quantization and channel noise, the real physical channel (quantization, inverse quantization, and binary system channel) is modeled as Gaussian-Bernoulli-Gaussian (GBG) channel model. Image is transmitted in the joint source channel coding system based on Real BCH after wavelet decomposition. Image transmission effect is compared though Matlab simulation. PSNR is 39.5225 dB when the channel transmission probability is 10−3. Simulation results show that Real BCH code has better error correcting performance and joint source channel coding system based on Real BCH has better image transmission effect.