An Adaptive Joint Source/Channel Coding Using Error Correcting Arithmetic Codes

An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.

Integrated Joint Source-Channel Symbol-by-Symbol Decoding of Variable-Length Codes Using 3-D MAP Sequence Estimation

Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder （I-JSCD） at a symbol-level using three-dimensional （3-D） trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional （2-D） state-space, and then develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of （50%） data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.

JOINT SOURCE-CHANNEL DECODING OF HUFFMAN CODES WITH LDPC CODES

In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).

An adaptive joint source and channel coding scheme for H.264 video multicasting over wireless LAN

This paper proposes an adaptive joint source and channel coding scheme for H.264 video multicast over wireless LAN which takes into account the user topology changes and varying channel conditions of multiple users, and dynamically allocates available bandwidth between source coding and channel coding, with the goal to optimize the overall system performance. In particular, source resilience and error correction are considered jointly in the scheme to achieve the optimal performance. And a channel estimation algorithm based on the average packet loss rate and the variance of packet loss rate is proposed also. Two overall performance criteria for video multicast are investigated and experimental results are presented to show the improvement obtained by the scheme.

Joint Source-Channel Coding for 6G Communications

In order to provide ultra low-latency and high energy-efficient communication for intelligences,the sixth generation(6G)wireless communication networks need to break out of the dilemma of the depleting gain of the separated optimization paradigm.In this context,this paper provides a comprehensive tutorial that overview how joint source-channel coding(JSCC)can be employed for improving overall system performance.For the purpose,we first introduce the communication requirements and performance metrics for 6G.Then,we provide an overview of the source-channel separation theorem and why it may not hold in practical applications.In addition,we focus on two new JSCC schemes called the double low-density parity-check(LDPC)codes and the double polar codes,respectively,giving their detailed coding and decoding processes and corresponding performance simulations.In a nutshell,this paper constitutes a tutorial on the JSCC scheme tailored to the needs of future 6G communications.

A FINE GRANULAR JOINT SOURCE CHANNEL CODING METHOD

An improved FGS (Fine Granular Scalability) coding method is proposed in this letter, which is based on human visual characteristics. This method adjusts FGS coding frame rate according to the evaluation of video sequences so as to improve the coding efficiency and subject perceived quality of reconstructed images. Finally, a fine granular joint source channel coding is proposed based on the source coding method, which not only utilizes the network resources efficiently, but guarantees the reliable transmission of video information.

Joint Source-Channel Decoding Scheme for Image Transmission over Wireless Channel

We improve the iterative decoding algorithm by utilizing the “leaked” residual redundancy at the output of the source encoder without changing the encoder structure for the noisy channel. The experimental results show that using the residual redundancy of the compressed source in channel decoding is an effective method to improve the error correction performance.

Integrated Joint Source-Channel Decoding for H.264 Video Transmission

This paper proposes an integrated joint source-channel decoder （I-JSCD） using Max-Log-MAP method for sources encoded with exp-Golomb codes and convolutional codes, and proposes a system applying this method to decoding the VLC data, e.g. motion vector differences （MVDs）, of H.264 across an AWGN channel. This method combines the source code state-space and the channel code state-space together to construct a joint state-space, develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol, and then uses max-log approximation to simplify the algorithm. Experiments indicate that the proposed system gives significant improvements on peak signal-to-noise ratio （PSNR） （maximum about 15 dB） than a separate scheme. This also leads to a higher visual quality of video stream over a highly noisy channel.

A Joint Source and Channel Video Coding Algorithm for H.223 Based Wireless Channel

Robust video streaming through high error prone wireless channel has attracted much attention. In this paper the authors introduce an effective algorithm by joining the Unequal Error Protection ability of the channel multiplexing protocol H.223 Annex D, and the new H.263++ Annex V Data Partition together. Based on the optimal trade off of these two technologies, the Joint Source and Channel Coding algorithm can result in stronger error resilience. The simulation results have shown its superiority against separate coding mode and some Unequal Error Protection mode under recommended wireless channel error patterns.

JOINT ITERATIVE DECODING FOR SIMPLE-ENCODING SYSTEMATIC IRREGULAR-LDPC-BASED CODED COOPERATION IN NON-IDEAL RELAY CHANNEL

In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.

NEW ITERATIVE SUPER-TRELLIS DECODING WITH SOURCE A PRIORI INFORMATION FOR VLCS WITH TURBO CODES

A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.

Joint Source-Channel Bit Allocation Based on Expected End-to-End Distortion Model

An adaptive joint source channel bit allocation method for video communications over error-prone channel is proposed.To protect the bit-streams from the channel bit errors,the rate compatible punctured convolution(RCPC)code is used to produce coding rates varying from 4/5 to 1/2 using the same encoder and the Viterbi decoder.An expected end-to-end distortion model was presented to estimate the distortion introduced in compressed source coding due to quantization and channel bit errors jointly.Based on the proposed end-to-end distortion model,an adaptive joint source-channel bit allocation method was proposed under time-varying error-prone channel conditions.Simulated results show that the proposed methods could utilize the available channel capacity more efficiently and achieve better video quality than the other fixed coding-based bit allocation methods when transmitting over error-prone channels.

A New Arithmetic Coding System Combining Source Channel Coding and MAP Decoding

A new arithmetic coding system combining source channel coding and maximum a posteriori decoding were proposed. It combines source coding and error correction tasks into one unified process by introducing an adaptive forbidden symbol. The proposed system achieves fixed length code words by adaptively adjusting the probability of the forbidden symbol and adding tail digits of variable length. The corresponding improved MAP decoding metric was derived. The proposed system can improve the performance. Simulations were performed on AWGN channels with various noise levels by using both hard and soft decision with BPSK modulation.The results show its performance is slightly better than that of our adaptive arithmetic error correcting coding system using a forbidden symbol.

An Iterative Detection/Decoding Algorithm of Correlated Sources for the LDPC-Based Relay Systems

An iterative detection/decoding algorithm of correlated sources for the LDPC-based relay systems is presented. The signal from the source-destination(S-D) link is formulated as a highly correlated counterpart from the relay-destination(R-D) link. A special XOR vector is defined using the correlated hard decision information blocks from two decoders and the extrinsic information exchanged between the two decoders is derived by the log-likelihood ratio(LLR) associated with the XOR vector. Such the decoding scheme is different from the traditional turbo-like detection/decoding algorithm, where the extrinsic information is computed by the side information and the soft decoder outputs. Simulations show that the presented algorithm has a slightly better performance than the traditional turbo-like algorithm(Taking the(255,175) EG-LDPC code as an example, it achieves about 0.1 dB performance gains aroundBLER=10^(-4)). Furthermore, the presented algorithm requires fewer computing operations per iteration and has faster convergence rate. For example, the average iteration of the presented algorithm is 33 at SNR=1.8 dB, which is about twice faster than that of the turbo-like algorithm, when decoding the(961,721) QC-LDPC code. Therefore, the presented decoding algorithm of correlated sources provides an alternative decoding solution for the LDPC-based relay systems.

Joint resource allocation for MIMO-OFDM video transmission systems with unequal error protection

To improve the performance of MIMO-OFDM video transmission systems on the limitation of wireless bandwidth and transmitting power,we propose an adaptive joint resource allocation algorithm with unequal error protection(UEP) based on joint source-channel coding(JSCC) according to H.264 video compression standard and RCPT channel coding.According to different thresholds of the average SNR of subchannels,the algorithm dynamically allocates the source coding parameters of original video data and the channel coding parameters of RCPT,which realizes UEP for the compressed video data of different importance.Through the bit and power allocation based on MQAM modulation and the subspace allocation based on beamforming technology for different subcarriers,an adaptive joint resource allocation making full use of space-frequency domain resources have been realized.The simulation results indicate that the algorithm improves the adaptability of video transmission systems in different wireless environments and the quality of video retrieval.

Video coding bit allocation algorithm over wireless transmission channel

For two-way video communications over wireless channels using the automatic repeat request (ARQ) retransmission scheme, TMN8 rate control scheme is not effective in minimizing the number of frames skipped and cannot guarantee video quality during the retransmissions of error packets. This paper presents a joint source channel bit allocation scheme that allocates target bits according to encoder buffer fullness and estimation of channel condition by retransmission information. The results obtained from implementing our scheme in H.263+coder over wireless channel model show that our proposed scheme encodes the video sequences with lower and steadier buffer delay, fewer frames skipped and higher average PSNR compared to TMN8.

Joint Distortion Model for Progressive Image Transmission Using Error Correcting Arithmetic Codes

A novel joint source channel distortion model was proposed, which can essentially estimate the average distortion in progressive image transmission. To improve the precision of the model, the redundancy generated by a forbidden symbol in the arithmetic codes is used to distinguish the quantization distortion and the channel distortion, all the coefficients from the first error one to the end of the sequence are set to be a value within the variance range of the coefficients instead of zero, then the error propagation coming from the entropy coding can be essentially estimated, which is disregarded in the most conventional joint source channel coding (JSCC) systems. The precision of the model in terms of average peak-signal-to-noise has been improved about 0.5 dB compared to classical works. An efficient unequal error protection system based on the model is developed, and can be used in the wireless communication systems.

基于AI的端到端语义编码传输方案设计

面向6G多样化场景下对高性能和低复杂度的传输需求,通过将AI架构引入无线传输收发方案的联合优化,打破基于模块化物理层设计方法和传统信息论的局限,一种基于AI的端到端语义编码传输方案被提出。首先,为了克服未知衰落信道下无法通过反向传播联合训练发射机的问题,设计了一种基于CGAN的两子网架构及分阶段训练方法,有效消除衰落信道的影响。其次,进一步提出了语义信道联合编码的系统架构,在端到端的联合优化方面具有优势。仿真结果表明,所提方案通过对语义编码和传输的联合优化提升了系统性能,并适用于实际通信中信道未知场景,具备灵活性、智能性和高效性。

语义通信的数学理论

自从1948年经典信息论诞生以来,在其指导下,现代通信技术已经逼近了理论性能极限,例如信息熵H(U)、信道容量C=max_(p(x))I(X;Y)以及率失真函数R(D)=min_(p(x|x):Ed(x,x)≤D)I(X;X)。长期以来,由于经典信息论只研究语法信息,限制了通信科学的进一步发展。近年来,研究语义信息处理与传输的通信技术获得了学术界的普遍关注,语义通信开辟了未来通信技术发展的新方向,但还缺乏一般性的数学指导理论。为了解决这一难题,构建了语义信息论的理论框架,对语义信息的度量体系与语义通信的理论极限进行了系统性阐述。首先,通过深入分析各类信源的数据特征,以及各种下游任务的需求,总结归纳出语义信息的普遍属性——同义性。由此指出语义信息是语法信息的上级概念,是许多等效或相似语法信息的抽象特征,表征隐藏在数据或消息背后的含义或内容。将语义信息与语法信息之间的关系命名为同义映射,这是一种“一对多”映射,即一个语义符号可以由许多不同的语法符号表示。基于同义映射f这一核心概念,引入语义熵H_(s)(U)作为语义信息的基本度量指标,表示为信源概率分布与同义映射的泛函。在此基础上,引入上/下语义互信息I^(s)(X;Y)(I_(s)(X;Y)),语义信道容量C_(s)=max_(f_(xy))max_(p_((x)))I^(s)(X;Y)以及语义率失真函数R_(s)(D)=min_({f_(x),f_(x)})min_(p(x|x):Ed_(s)(x,x)≤D)I_(s)(X;X),从而构建了完整的语义信息度量体系。这些语义信息度量是经典信息度量的自然延伸,都由同义映射约束,如果采用“一对一”映射,则可以退化为传统的信息度量。由此可见,语义信息度量体系包含语法信息度量,前者与后者具有兼容性。其次,证明了3个重要的语义编码定理,以揭示语义通信的性能优势。基于同义映射,引入新的数学工具——语义渐近均分(AEP),详细探讨了同义典型序列的数学性质,并应用随机编码和同义典型序列译码/编码,证明了语义无失真信源编码定理、语义信道编码定理和语义限失真信源编码定理。类似于经典信息论,这些基本编码定理也都是存在性定理,但它们指出了语义通信系统的性能极限,在语义信息论中起着关键作用。由同义映射和这些基本编码定理可以推断,语义通信系统的性能优于经典通信系统,即语义熵小于信息熵H_(s)(U)≤H(U),语义信道容量大于经典信道容量C_(s)≥C,以及语义率失真函数小于经典率失真函数R_(s)(D)≤R(D)。最后,讨论了连续条件下的语义信息度量。此时,同义映射转换为连续随机变量分布区间的划分方式。相应地,划分后的子区间被命名为同义区间,其平均长度定义为同义长度S。特别是对于限带高斯信道,得到了一个新的信道容量公式C_(s)=B log[S^(4)(1+P/N_(0)B)],其中,平均同义长度S表征了信息的辨识能力。这一容量公式是经典信道容量的重要扩展,当S=1时,该公式退化为著名的香农信道容量公式。综上所述,语义信息论依据同义映射这一语义信息的本质特征,构建了语义信息的度量体系,引入新的数学工具,证明了语义编码的基本定理,论证了语义通信系统的性能极限,揭示了未来语义通信的巨大性能潜力。