Channel Coding at Finite Blocklength and Its Application in 6G URLLC

To support mission-critical applications, such as factory automation and autonomous driving, the ultra-reliable low latency communications (URLLC) is adopted in the fifth generation (5G) mobile communications network, which requires high level of reliability and low latency. Naturally, URLLC in the future 6G is expected to have a better capability than its 5G version which poses an unprecedented challenge to us. Fortunately, the potential solution can still be found in the well-known classical Shannon information theory. Since the latency constraint can be represented equivalently by blocklength, channel coding at finite blocklength plays an important role in the theoretic analysis of URLLC. Applying these achievements in rapidly development of massive MIMO techniques gives rise to a new theory on space time exchanging. It tells us that channel coding can also be performed in space domain, since it is capable of providing the same coding rate as that in time domain. This space time exchanging theory points out an exciting and feasible direction for us to further reduce latency in 6G URLLC. .

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.

Channel Coding Techniques for VHF-Mobile Radio System and Its DSP Implementation

Two variable channel-coding schemes with unequal error protection （UEP） are proposed in terms of speech transmission over VHF-mobile radio system. These channel coding are separately based on rate-compatible punctured convolution （RCPC） code scheme and rate-compatible punctured turbo （RCPT） code scheme. With optimum puncturing designation and suitable scheme of rate matching, these two UEP schemes can achieve intra-class unequal error protection, which makes the protection for source bits with different importance more accurate. Its real time implementation based on a TMS320C6416 digital signal processor is also presented. The experimental results suggest that this method have reasonable system complexity and short processing delay.

Channel Coding Based on Power Line Communication

This paper focuses on the forward error correction(FEC),the basic parameters determination of the RS convolution code,Turbo code and the LDPC code,and the corresponding encoding and decoding algorithm in power line communication(PLC)standard.Simulation experiment which is designed for narrow-band power line communication system based on OFDM is done.The coding using RS convolution code,Turbo code and LDPC code are compared,and further it is determined that which encoding method is more suitable for power line communication in China.

Priority-Based Real-Time Stream Coding over Multi-Channel with Packet Erasures

Multi-channel can be used to provide higher transmission ability to the bandwidth-intensive and delay-sensitive real-time streams. However, traditional channel capacity theories and coding schemes are seldom designed for the real-time streams with strict delay constraint, especially in multi-channel context. This paper considers a real-time stream system, where real-time messages with different importance should be transmitted through several packet erasure channels, and be decoded by the receiver within a fixed delay. Based on window erasure channels and i.i.d.(identically and independently distributed) erasure channels, we derive the Multi-channel Real-time Stream Transmission(MRST) capacity models for Symmetric Real-time(SR) streams and Asymmetric Real-time(AR) streams respectively. Moreover, for window erasures, a Maximum Equilibrium Intra-session Code(MEIC) is presented for SR and AR streams, and is shown able to asymptotically achieve the theoretical MRST capacity. For i.i.d. erasures, we propose an Adaptive Maximum Equilibrium Intra-session Code(AMEIC), and then prove AMEIC can closely approach the MRST transmission capacity. Finally, the performances of the proposed codes are verified by simulations.

Design Framework of Unsourced Multiple Access for 6G Massive IoT

In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical solutions.A rather complete design of unsourced multiple access is proposed in which two key parts:a compressed sensing module for active user detection,and a sparse interleaver-division multiple access(SIDMA)module are simulated side by side on a same platform at balanced signal to noise ratio(SNR)operating points.With a proper combination of compressed sensing matrix,a convolutional encoder,receiver algorithms,the simulated performance results appear superior to the state-of-the-art benchmark,yet with relatively less complicated processing.

A Coding and Automatic Error-Correction Circuit Based on the Five-Particle Entangled State

In this paper, we discuss the concepts of quantum coding and error correction for a five-particle entangled state. Error correction can correct bit-reverse or phase-flip errors of one and two quantum states and is no longer limited to only one quantum state. We encode a single quantum state into a five-particle entangled state before being transferred to the sender. We designed an automatic error-correction circuit to correct errors caused by noise. We also simplify the design process for a multiple quantum error-correction circuit. We compare error-correction schemes for five and three entangled particles in terms of efficiency and capabilities. The results show that error-correction efficiency and fidelity are im- proved.

Partial Parallel Encoding and Algorithmic Construction of Non-Binary Structured IRA Codes

The non-binary(NB) Irregular Repeat Accumulate(IRA) codes, as a subclass of NB LDPC codes, potentially have an excellent error-correcting performance. They are also known to provide linear complexity of encoding, but the basic encoding method with the serial rate-1 accumulator significantly limits the encoder throughput. Then the objective of the research presented in this paper is to develop an encoding method pro- viding significantly increased throughput of an NB-IRA encoder altogether with a flexible code construction methods for the structured(S-NB-IRA) codes eligible for the proposed encoding method. For this purpose, we reformulate the classic encoding algorithm to fit into the partial parallel encoder architecture. We propose the S-NB-IRA encoder block diagram and show that its estimated throughput is proportional to the submatrix size of the parity check matrix, which guarantees a wide complexity- throughput tradeoff. Then, in order to facilitate the S-NB-IRA coding systems design, we present a computer search algorithm for the construction of good S-NB-IRA codes. The algorithm aims at optimizing the code graph topology along with selecting an appropriate non-binary elements in the parity check matrix. Numerical results show that the constructed S-NB-IRA codes significantly outperform the binary IRA and S-IRA codes, while their performance is similar to the best unstructured NB-LDPC codes.

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.

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.

Statistical-mechanical analysis of multiuser channel capacity with imperfect channel state information

In this paper, the effect of imperfect channel state information at the receiver, which is caused by noise and other interference, on the multi-access channel capacity is analysed through a statistical-mechanical approach. Replica analyses focus on analytically studying how the minimum mean square error （MMSE） channel estimation error appears in a multiuser channel capacity formula. And the relevant mathematical expressions are derived. At the same time, numerical simulation results are demonstrated to validate the Replica analyses. The simulation results show how the system parameters, such as channel estimation error, system load and signal-to-noise ratio, affect the channel capacity.

Effects of intrinsic decoherence on various correlations and quantum dense coding in a two superconducting charge qubit system

The influence of intrinsic decoherence on various correlations and dense coding in a model which consists of two identical superconducting charge qubits coupled by a fixed capacitor is investigated. The results show that, despite the intrinsic decoherence, the correlations as well as the dense coding channel capacity can be effectively increased via the combination of system parameters, i.e., the mutual coupling energy between the two charge qubits is larger than the Josephson energy of the qubit. The bigger the difference between them is, the better the effect is.

Multi-User Connection Performance Assessment of NOMA Schemes for Beyond 5G

Non-orthogonal multiple access(NOMA)is proved to be useful to satisfy the requirements of beyond 5th generation such as massive multi-user connection.Here we compare the performances of two NOMA schemes:low code rate spreading(LCRS)scheme and interleaver division multiple access(IDMA)scheme.It is found that LCRS is superior to IDMA when number of users is small due to coding gain achieved.While IDMA is preferred when number of users is high because repetition applied in IDMA can suppress multi-user interference effectively.And interleaver is important in IDMA for randomizing the interference.Also,this paper evaluates the impact of channel decoder.It is observed that Log-MAP decoder has much better performance than that of Max-Log-MAP when number of users is large.Thus,it is recommended to use Log-MAP decoder in NOMA in high user overloading case.We also compared the performance of NOMA by using different type of channel codes.We find that NOMA using specific convolutional code has a better performance than that of using specific LDPC code when number of users is high.

A SURVEY OF DEEP SPACE COMMUNICATIONS

Deep space communications has played an important role in deep space exploration. Compared with common satellite and terrestrial communications, deep space communications faces more challenging environment. The paper investigated the unique features of deep space communica-tions in detail, discussed the key technologies and its development trends for deep space communica-tions.

Optimal and suboptimal structured algorithms of binary linear block codes

The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.

Coded Orthogonal Time Frequency Space Modulation

Orthogonal time frequency space(OTFS)modulation is a novel two-dimensional modulation scheme for high-Doppler fading scenarios,which is implemented in the delay-Doppler(DD)domain.In time and frequency selective channels,OTFS modulation is more robust than the popular orthogonal frequency division multiplexing(OFDM)modulation technique.To further improve transmission reliability,some channel coding schemes are used in the OTFS modulation system.In this paper,the coded OTFS modulation system is considered and introduced in detail.Furthermore,the performance of the uncoded/coded OTFS system and OFDM system is analyzed with different relative speeds,modulation schemes,and iterations.Simulation results show that the OTFS system has the potential of full diversity gain and better robustness under high mobility scenarios.

Secure Transmission Scheme for Parallel Relay Channels Based on Polar Coding

This paper considers the use of polar codes to enable secure transmission over parallel relay channels.By exploiting the properties of polar codes over parallel channels, a polar encoding algorithm is designed based on Channel State Information（CSI） between the legitimate transmitter（Alice） and the legitimate receiver（Bob）.Different from existing secure transmission schemes, the proposed scheme does not require CSI between Alice and the eavesdropper（Eve）. The proposed scheme is proven to be reliable and shown to be capable of transmitting information securely under Amplify-and-Forward（AF） relay protocol, thereby providing security against passive and active attackers.

Performance evaluation of MIMO-OFDM system based on time-switched transmit diversity

In this paper,a time-switched space-time(TSST) coded orthogonal frequency division multiplexing(OFDM) scheme against the time-varying channels is proposed.In the TSST-OFDM scheme,it is equipped with four transmit antennas,but only double of them are used for coding in every time slot.It is shown that the signal to inter-antenna interference ratio is a function of Doppler frequency in time-varying channels for a given space-time code.The analyses and simulations results validate that the proposed scheme not only gets timeswitched diversity and lower decoding complexity,but also suffers less time-varying impairments.Hence,it exhibits better performance than quasi-orthogonal space-time coded scheme.

High Hardware Utilization and Low Memory Block Requirement Decoding of QC-LDPC Codes

This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check （QC-LDPC） codes, which not only achieves high hardware utility efficiency （HUE）, but also brings about great memory block reduction without any performance degradation. The main idea is to split the check matrix into several row blocks, then to perform the improved mes- sage passing computations sequentially block by block. As the decoding algorithm improves, the sequential tie between the two-phase computations is broken, so that the two-phase computations can be overlapped which bring in high HUE. Two over- lapping schemes are also presented, each of which suits a different situation. In addition, an efficient memory arrangement scheme is proposed to reduce the great memory block requirement of the LDPC decoder. As an example, for the 0.4 rate LDPC code selected from Chinese Digital TV Terrestrial Broadcasting （DTTB）, our decoding saves over 80% memory blocks com- pared with the conventional decoding, and the decoder achieves 0.97 HUE. Finally, the 0.4 rate LDPC decoder is implemented on an FPGA device EP2S30 （speed grade -5）. Using 8 row processing units, the decoder can achieve a maximum net throughput of 28.5 Mbps at 20 iterations.

A High-Performance Codec Suitable for the GSM Half-Rate Coding System

In this paper we describe our research work in GSM half-rate coding system for the pan-Europeandigital mobile cellular radio system. The system consists of a speech coder and a channel coder. An overview of thespeech coding algorithm is given. The channel coder uses CRC check and a convolutional code. Interleaving is usedto randomize the channel bursts. The proposed half-rate codec is implemented with a single TMS320C30. Theinformal tests (based on MOS score) prove that our speech coder is of higher quality.