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 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.

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.

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.

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 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.

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.

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.

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.

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.

基于SPIHT图象压缩编码的Turbo codes编码

针对信源与信道编码的特点 ,提出了结合SPIHT(setpartitioninginhierarchicaltrees)算法和改进的TurboCodes的信源与信道联合编码方案 .这一方案充分考虑了SPIHT算法和TurboCodes的特性 ,根据信源编码后数据在重建时的重要程度 ,进行不同等纠错保护的信道编码 .实验表明 ,论文的方法能够使误码率与码长达到一个较好的平衡 。

Evolutionary algorithm based index assignment algorithm for noisy channel

A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.

Robust transmission of progressive image bitstreams based on DCT over broadband wireless channels

A robust progressive image transmission scheme over broadband wireless fading channels is developed for 4th generation wireless communication systems （4G） in this paper. The proposed scheme is based on space-time block coded orthogonal frequency-division multiplexing （OFDM） with 4 transmit antennas and 2 receive antennas and uses a simplified minimum mean square error （MMSE） detector instead of maximum likelihood （ML） detectors. Considering DCT is simpler and more widely applied in the industry than wavelet transforms, a progressive image compression method based on DCT called mean-subtract embedded DCT （MSEDCT） is developed, with a simple mean-subtract method for the redundancy of reorganized DC blocks in addition to a structure similar to the embedded zerotree wavelet coding （EZW） method. Then after analyzing and testing bit importance of the progressive MSEDCT bitstreams, the layered unequal error protection method of joint source-channels coding based on Reed-Solomon （RS） codes is used to protect different parts of bitstreams, providing different QoS assurances and good flexibility. Simulation experiments show our proposed scheme can effectively degrade fading effects and obtain better image transmission effects with 10 -20 dB average peak-sig- nal-noise-ratio （PSNR） gains at the median Eb/No than those schemes without space-time coded OFDM or equal error protections with space-time coded OFDM.

SOLUTION OF ASSIGNING BINARY INDEXES TO CODEVECTORS BY A KIND OF HOPFIELD NEURAL NETWORK

A method of assigning binary indexes to codevectors in vector quantization (VQ)system, which is called pseudo-Gray coding, is presented in this paper by constructing a kind of Hopfield neural network. Pseudo-Gray coding belongs to joint source/channel coding, which could provide a redundancy-free error protection scheme for VQ of analog signals when the binary indexes of signal codevectors are used as channel symbols on a discrete memoryless channel. Since pseudo-Gray coding is of combinatorial optimization problems which are NP-complete problems,globally optimal solutions are generally impossible. Thus, a kind of Hopfield neural network is used by constructing suitable energy function to get sub-optimal solutions. This kind of Hop field neural network is easily modified to solve simplified version of pseudo-Gray coding for single bit-error channel model. Simulating experimental results show that the method introduced here could offer good performances.

Unequal decoding power allocation for efficient video transmission

We present an unequal decoding power allocation （UDPA） approach for minimization of the receiver power consumption subject to a given quality of service （QoS）, by exploiting data partitioning and turbo decoding. We assign unequal decoding power of forward error correction （FEC） to data partitions with different priority by jointly considering the source coding, channel coding and receiver power consumption. The proposed scheme is applied to H.264 video over additive white Gaussion noise （AWGN） channel, and achieves excellent tradeoff between video delivery quality and power consumption, and yields significant power saving compared with the conventional equal decoding power allocation （EDPA） approach in wireless video transmission.