A Denoiser for Correlated Noise Channel Decoding: Gated-Neural Network

This letter proposes a sliced-gated-convolutional neural network with belief propagation(SGCNN-BP) architecture for decoding long codes under correlated noise. The basic idea of SGCNNBP is using Neural Networks(NN) to transform the correlated noise into white noise, setting up the optimal condition for a standard BP decoder that takes the output from the NN. A gate-controlled neuron is used to regulate information flow and an optional operation—slicing is adopted to reduce parameters and lower training complexity. Simulation results show that SGCNN-BP has much better performance(with the largest gap being 5dB improvement) than a single BP decoder and achieves a nearly 1dB improvement compared to Fully Convolutional Networks(FCN).

A highly reliable encoding and decoding communication framework based on semantic information

Increasing research has focused on semantic communication,the goal of which is to convey accurately the meaning instead of transmitting symbols from the sender to the receiver.In this paper,we design a novel encoding and decoding semantic communication framework,which adopts the semantic information and the contextual correlations between items to optimize the performance of a communication system over various channels.On the sender side,the average semantic loss caused by the wrong detection is defined,and a semantic source encoding strategy is developed to minimize the average semantic loss.To further improve communication reliability,a decoding strategy that utilizes the semantic and the context information to recover messages is proposed in the receiver.Extensive simulation results validate the superior performance of our strategies over state-of-the-art semantic coding and decoding policies on different communication channels.

Improved Segmented Belief Propagation List Decoding for Polar Codes with Bit-Flipping

Belief propagation list(BPL) decoding for polar codes has attracted more attention due to its inherent parallel nature. However, a large gap still exists with CRC-aided SCL(CA-SCL) decoding.In this work, an improved segmented belief propagation list decoding based on bit flipping(SBPL-BF) is proposed. On the one hand, the proposed algorithm makes use of the cooperative characteristic in BPL decoding such that the codeword is decoded in different BP decoders. Based on this characteristic, the unreliable bits for flipping could be split into multiple subblocks and could be flipped in different decoders simultaneously. On the other hand, a more flexible and effective processing strategy for the priori information of the unfrozen bits that do not need to be flipped is designed to improve the decoding convergence. In addition, this is the first proposal in BPL decoding which jointly optimizes the bit flipping of the information bits and the code bits. In particular, for bit flipping of the code bits, a H-matrix aided bit-flipping algorithm is designed to enhance the accuracy in identifying erroneous code bits. The simulation results show that the proposed algorithm significantly improves the errorcorrection performance of BPL decoding for medium and long codes. It is more than 0.25 d B better than the state-of-the-art BPL decoding at a block error rate(BLER) of 10^(-5), and outperforms CA-SCL decoding in the low signal-to-noise(SNR) region for(1024, 0.5)polar codes.

The"Decoding Zhonghua"International Conference on Dialogue among Civilisations Held in Beijing

The"Decoding Zhonghua"International Conference on Dialogue among Civilisations,hosted by China International Public Relations Association,China Ethnic News and Academy of Contemporary China and World Studies was held in Beijing on January 17th.With the theme"Pursing Harmonious Coexistence of Civilisations through Dialogue".

Deep Learning Aided SCL Decoding of Polar Codes with Shifted-Pruning

Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.

Belief Propagation List Decoding for Polar Codes:Performance Analysis and Software Implementation on GPU

Belief propagation(BP)decoding outputs soft information and can be naturally used in iterative receivers.BP list(BPL)decoding provides comparable error-correction performance to the successive cancellation list(SCL)decoding.In this paper,we firstly introduce an enhanced code construction scheme for BPL decoding to improve its errorcorrection capability.Then,a GPU-based BPL decoder with adoption of the new code construction is presented.Finally,the proposed BPL decoder is tested on NVIDIA RTX3070 and GTX1060.Experimental results show that the presented BPL decoder with early termination criterion achieves above 1 Gbps throughput on RTX3070 for the code(1024,512)with 32 lists under good channel conditions.

List-Serial Pipelined Hardware Architecture for SCL Decoding of Polar Codes

For polar codes,the performance of successive cancellation list(SCL)decoding is capable of approaching that of maximum likelihood decoding.However,the existing hardware architectures for the SCL decoding suffer from high hardware complexity due to calculating L decoding paths simultaneously,which are unfriendly to the devices with limited logical resources,such as field programmable gate arrays(FPGAs).In this paper,we propose a list-serial pipelined hardware architecture with low complexity for the SCL decoding,where the serial calculation and the pipelined operation are elegantly combined to strike a balance between the complexity and the latency.Moreover,we employ only one successive cancellation(SC)decoder core without L×L crossbars,and reduce the number of inputs of the metric sorter from 2L to L+2.Finally,the FPGA implementations show that the hardware resource consumption is significantly reduced with negligible decoding performance loss.

The Dissemination of Chinese Tea Culture Based on Encoding/Decoding Theory

Tea has a history of thousands of years in China and it plays an important role in the working-life and daily life of people.Tea culture rich in connotation is an important part of Chinese traditional culture,and its existence and development are also of great significance to the diversified development of world culture.Based on Stuart Hall’s encoding/decoding theory,this paper analyzes the problems in the spreading of Chinese tea in and out of the country and provides solutions from the perspective of encoding,communication,and decoding.It is expected to provide a reference for the domestic and international dissemination of Chinese tea culture.

The Dissemination of Intangible Cultural Heritage Along Beijing-Hangzhou Canal Based on Encoding/Decoding Theory

The Beijing-Hangzhou Grand Canal carries a wealth of Chinese cultural symbols,showing the lifestyle and wisdom of working people through ages.The preservation and inheritance of its intangible cultural heritage can help to evoke cultural memories and cultural identification of the Canal and build cultural confidence.This paper applies Stuart Hall’s encoding/decoding theory to analyze the dissemination of intangible heritage tourism culture.On the basis of a practical study of the villages along the Beijing-Hangzhou Grand Canal,this paper analyses the problems in the transmission of its intangible cultural heritage and proposes specific methods to solve them in four processes,encoding,decoding,communication,and secondary encoding,in order to propose references for the transmission of intangible heritage culture at home and abroad.

Parallel Implementation of the CCSDS Turbo Decoder on GPU

This paper presents a software turbo decoder on graphics processing units(GPU).Unlike previous works,the proposed decoding architecture for turbo codes mainly focuses on the Consultative Committee for Space Data Systems(CCSDS)standard.However,the information frame lengths of the CCSDS turbo codes are not suitable for flexible sub-frame parallelism design.To mitigate this issue,we propose a padding method that inserts several bits before the information frame header.To obtain low-latency performance and high resource utilization,two-level intra-frame parallelisms and an efficient data structure are considered.The presented Max-Log-Map decoder can be adopted to decode the Long Term Evolution(LTE)turbo codes with only small modifications.The proposed CCSDS turbo decoder at 10 iterations on NVIDIA RTX3070 achieves about 150 Mbps and 50Mbps throughputs for the code rates 1/6 and 1/2,respectively.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Soft Decoding Scheme of Convolution Code Combined with Huffman Coding

This paper proposes a modification of the soft output Viterbi decoding algorithm (SOVA) which combines convolution code with Huffman coding. The idea is to extract the bit probability information from the Huffman coding and use it to compute the a priori source information which can be used when the channel environment is bad. The suggested scheme does not require changes on the transmitter side. Compared with separate decoding systems, the gain in signal to noise ratio is about 0 5-1.0 dB with a limi...

Low complexity iterative differential decoding algorithm for multiband UWB communication systems

Due to not requiring channel state information （CSI） at both the transmitter and the receiver, noncoherent ultra-wideband （UWB） incurs a performance penalty of approximately 3 dB in the required signal to noise ratio （SNR） compared to the coherent case. To overcome the gap, an effective differential encoding and decoding scheme for multiband UWB systems is proposed. The proposed scheme employs the parallel concatenation of two recursive differential unitary space-frequency encoders at the transmitter. At the receiver, two component decoders iteratively decode information bits by interchanging soft metric values between each other. To reduce the computation complexity, a decoding algorithm which only uses transition probability to calculate the log likelihood ratios （LLRs） for the decoded bits is given. Simulation results show that the proposed scheme can dramatically outperform the conventional differential and even coherent detection at high SNR with a few iterations.

Low complexity joint source-channel decoding for transmission of wavelet compressed images

To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.

Achievability of Chong-Motani-Garg relay channel capacity bounds using forward decoding

To reduce decoding delay of a communication scheme which is backward-decoding-based and achievable Chong Motani-Garg capacity bounds, a novel forward-sliding-window decoding-based communication scheme is proposed. In this scheme, if w = （w1, w2） is the message to be sent in block b, the relay will decode message w1 and generate a new message z at the end of block b, and the receiver will decode message w1 at the end of block b ＋ 1 and decode message z and w2 at the end of block b ＋ 2. Analysis results show that this new communication scheme can achieve the same Chong-Motani-Garg bounds and the decoding delay is only two blocks which is much shorter than that of backward decoding. Therefore, Chong-Motani-Garg bounds can be achieved by a forward decoding-based communication scheme with short decoding delay.

On the Manipulation of the Selectivity of Encoding and Decoding overthe Translator's Subjectivity

The translation activity is a process of the interlinguistic transmission of information realized by the information encoding and decoding.Encoding and decoding,cognitive practices operated in objective contexts,are inevitably of selectivity ascribing to the restriction of contextual reasons.The translator as the intermediary agent connects the original author(encoder)and the target readers(decoder),shouldering the dual duties of the decoder and the encoder,for which his subjectivity is irrevocably manipulated by the selectivity of encoding and decoding.

基于encoder-decoder框架的城镇污水厂出水水质预测

由于污水厂的出水水质指标繁多、污水处理过程中反应复杂、时序非线性程度高,基于机理模型的预测方法无法取得理想效果。针对此问题,提出基于深度学习的污水厂出水水质预测方法,并以吉林省某污水厂监测水质为来源数据,利用多种结合encoder-decoder结构的神经网络预测水质。结果显示,所提结构对LSTM和GRU网络预测能力都有一定提升,对长期预测能力提升更加显著,ED-GRU模型效果最佳,短期预测中的4个出水水质指标均方根误差(RMSE)为0.7551、0.2197、0.0734、0.3146,拟合优度(R2)为0.9013、0.9332、0.9167、0.9532,可以预测出水质局部变化,而长期预测中的4个指标RMSE为1.7204、1.7689、0.4478、0.8316,R2为0.4849、0.5507、0.4502、0.7595,可以预测出水质变化趋势,与顺序结构相比,短期预测RMSE降低10%以上,R2增加2%以上,长期预测RMSE降低25%以上,R2增加15%以上。研究结果表明,基于encoder-decoder结构的神经网络可以对污水厂出水水质进行准确预测,为污水处理工艺改进提供技术支撑。

基于时空特征融合的Encoder-Decoder多步4D短期航迹预测

航迹预测在确保空中交通安全、高效运行中扮演着至关重要的角色。所预测的航迹信息是航迹优化、冲突告警等决策工具的输入,而预测准确性取决于模型对航迹序列特征的提取能力。航迹序列数据是具有丰富时空特征的多维时间序列,其中每个变量都呈现出长短期的时间变化模式,并且这些变量之间还存在着相互依赖的空间信息。为了充分提取这种时空特征,本文提出了基于融合时空特征的编码器-解码器(Spatio-Temporal EncoderDecoder,STED)航迹预测模型。在Encoder中使用门控循环单元(Gated Recurrent Unit,GRU)、卷积神经网络(Convolutional Neural Network,CNN)和注意力机制(Attention,AT)构成的双通道网络来分别提取航迹时空特征,Decoder对时空特征进行拼接融合,并利用GRU对融合特征进行学习和递归输出,实现对未来多步航迹信息的预测。利用真实的航迹数据对算法性能进行验证,实验结果表明,所提STED网络模型能够在未来10 min预测范围内进行高精度的短期航迹预测,相比于LSTM、CNN-LSTM和AT-LSTM等数据驱动航迹预测模型具有更高的精度。此外,STED网络模型预测一个航迹点平均耗时为0.002 s,具有良好的实时性。

Improved MPEG-4 High-Efficiency AAC With Variable-Length Soft-Decision Decoding of the Quantized Spectral Coefficients

MPEG-4 High-Efficiency Advanced Audio Coding (HE-AAC) is designed for low bit rate applications, such as audio streaming in mobile communications. The HE-AAC audio codec offers a better coding efficiency since variable-length codes (VLCs) are adopted. However, HE-AAC has originally been designed for storage and error-free transmission conditions. For the transmission over bit error-prone channels, error propagation is a serious problem for the VLCs. Therefore, a robust HE-AAC decoder is desired, especially for mobile communications. In contrast to traditional hard-decision decoding, utilizing bit-wise channel reliability information, softdecision (SD) decoding has been known to offer better audio quality. In HE-AAC, the global gain parameter is coded with fixedlength codes (FLCs), while the scale factors and quantized spectral coefficients are coded with VLCs. In this work, we apply FL/SD decoding to the global gain parameter, VL/SD decoding to the parameters scale factors and quantized spectral coefficients. Especially, in order to apply VL/SD decoding to the quantized spectral coefficients, a new modified trellis representation in VL/SD decoding is proposed. An improved HE-AAC performance is clearly observed, with the support of both instrumental measurements and a subjective listening test.

A simplified decoding algorithm for multi-CRC polar codes

Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.