Low-Complexity Joint Channel Estimation and Symbol Detection for OFDMA Systems

In this paper,we propose a joint channel estimation and symbol detection(JCESD)algorithm relying on message-passing algorithms(MPA)for orthogonal frequency division multiple access(OFDMA)systems.The channel estimation and symbol detection leverage the framework of expectation propagation(EP)and belief propagation(BP)with the aid of Gaussian approximation,respectively.Furthermore,to reduce the computation complexity involved in channel estimation,the matrix inversion is transformed into a series of diagonal matrix inversions through the Sherman-Morrison formula.Simulation experiments show that the proposed algorithm can reduce the pilot overhead by about 50%,compared with the traditional linear minimum mean square error(LMMSE)algorithm,and can approach to the bit error rate(BER)performance bound of perfectly known channel state information within 0.1 dB.

Effect of Width Ratio on the Etching Behavior of Joint Channel Structure

Effect of width ratio on the etching behaviour of joint channel structure is studied. By theory and experiments, the etching behaviors of joint channel with different width ratios are compared. The results show that the effect of width ratio on the etching behavior is much different for the narrow-wide joint channel and the wide-narrow structure. For the narrow-wide joint channel,the etching process depends not only on the width ratio but also on the width of the channel. The etching rate and concentration of etching front at each stage are very close with the same width ratio. The etching time required at each stage increases with the channel width, but the final total etching time is very close if the length of the wide channel is much longer. For the wide-narrow joint channel, the etching process depends only on the width ratio. For wide-narrow joint channel, the etching process, including the required etching time, is absolutely the same with the same width ratio. The etching rate and concentration of etching front at each stage increases with the rise of the width ratio, while the total etching time decreases with the increase of width ratio.

Joint channel and carrier frequency offset estimation for multi-user MIMO-OFDM uplink transmissions

This article proposes a new algorithm of joint channel and carrier frequency-offset OCCFO） estimation for multi-user multi-input and multi-output orthogonal frequency division multiplexing （MIMO-OFDM） systems. A least square （LS） channel estimation and a carrier frequency offset （CFO） correlation estimation are combined in this contribution. CFOs are generally estimated using training sequences in a special synchronization timeslot. In this contribution, CFO estimation is further improved by taking advantages of channel estimation based on pilot symbols in traffic timeslots. The CFOs can be first obtained from the primary channel estimation. And then, with the knowledge of the CFOs estimated, channel estimation can be enhanced greatly. Computer simulation results indicate that the proposed JCCFO scheme is of good performance. Besides, the computational complexity is low.

Compressed sensing-based structured joint channel estimation in a multi-user massive MIMO system

Acquisition of accurate channel state information （CSI） at transmitters results in a huge pilot overhead in massive multiple input multiple output （MIMO） systems due to the large number of antennas in the base station （BS）. To reduce the overwhelming pilot overhead in such systems, a structured joint channel estimation scheme employing compressed sensing （CS） theory is proposed. Specifically, the channel sparsity in the angular domain due to the practical scattering environment is analyzed, where common sparsity and individual sparsity structures among geographically neighboring users exist in multi-user massive MIMO systems. Then, by equipping each user with multiple antennas, the pilot overhead can be alleviated in the framework of CS and the channel estimation quality can be improved. Moreover, a structured joint matching pursuit （SJMP） algorithm at the BS is proposed to jointly estimate the channel of users with reduced pilot overhead. Furthermore, the probability upper bound of common support recovery and the upper bound of channel estimation quality using the proposed SJMP algorithm are derived. Simulation results demonstrate that the proposed SJMP algorithm can achieve a higher system performance than those of existing algorithms in terms of pilot overhead and achievable rate.

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.

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.

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.

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.

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.

CHANNEL ERROR CORRECTION FOR WIDEBAND SAR-A JOINT MULTIPLE SUBPULSES PROCESSING METHOD

A novel method,referred to as joint multiple subpulses processing,is developed to calibrate the nonideal transfer function of radio frequency front-end and I/Q imbalance in quadrature modulate/demodulate systems simultaneously,which frequently occur in wideband Synthetic Aperture Radar(SAR) systems.Based on the time-frequency relation of the chirp signal and the analyses of the channel errors in wideband SAR,joint multiple subpulses processing method is adopted to separate the image frequency component due to the I/Q channel error.Then,the complete description of the channel error is acquired for building the correction function,which is used to correct the radar raw echo in frequency domain.The validity and capability of this method are demonstrated by the experiments of the channel error correction on the high resolution SAR system with the effective bandwidth of 500 MHz.

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.

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.

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.

AI赋能的语义通信系统信道自适应技术研究

基于人工智能(AI)驱动的语义通信系统在面对动态变化的无线信道环境时,性能往往会显著下降。目前,现有方法通过给联合信源信道编码外挂神经网络模块来处理信道状态信息。然而,虽然这些方法能够在变化的信道条件下提高系统性能,但是外挂模块却带来了额外的模型参数与计算负担,增加了编解码延迟。针对这一问题,首先研究最新Mamba模型固有特性,推导了其对于初始状态的闭式响应,并从其闭式响应中发现了对于初始状态信息的遗忘特点。基于此发现,提出了一种内生式信道自适应方法。该方法通过将信道状态信息引入到模型初始状态,并在模型遗忘信道状态信息时重新将信道状态信息注入到状态空间,实现了无需额外计算与参数的情况下,使得模型能够感知信道状态并自适应地进行编码,从而在不同信道状态条件下提升系统性能。

A Novel Training Sequence Applied to DCS-Based Channel Estimation

Studies have indicated that the distributed compressed sensing based(DCSbased) channel estimation can decrease the length of the reference signals effectively. In block transmission, a unique word(UW) can be used as a cyclic prefix and reference signal. However, the DCS-based channel estimation requires diversity sequences instead of UW. In this paper, we proposed a novel method that employs a training sequence(TS) whose duration time is slightly longer than the maximum delay spread time. Based on proposed TS, the DCS approach perform perfectly in multipath channel estimation. Meanwhile, a cyclic prefix construct could be formed, which reduces the complexity of the frequency domain equalization(FDE) directly. Simulation results demonstrate that, by using the method of simultaneous orthogonal matching pursuit(SOMP), the required channel overhead has been reduced thanks to the proposed TS.

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.

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.

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.

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.