Genetic optimization of 5G-NR LDPC codes for lowering the error floor of BICM systems

With the wide range of commercial uses of fifth generation (5G), new radio (NR) communication networks, the wireless transmission becomes more efficient, reliable and faster. At the same time, high-quality signal transmission for 5G networks and beyond has also encountered new opportunities and challenges. Channel coding is a key technology to ensure reliable information transmission and service quality. However, the 5G-NR LDPC coded bit-interleaved coded modulation (BICM) sometimes suffers from relatively high error floors, so it can not always guarantee the high-quality and low-delay wireless transmission. In this paper, we propose a further redesign of the 5G-NR LDPC coded BICM based on genetic algorithm (GenAlg). By adjusting the number of the non-zero elements, the corresponding positions and shifting values in base matrix, we optimize the 5G-NR LDPC codes with GenAlg according to the error performances of coded BICM schemes. Simulation results show that the optimized 5G-NR LDPC codes which still support length and rate compatible coding have lower error floors with a little performance loss int the waterfall region compared to the standard 5G-NR LDPC codes with different modulation orders.     

Spectrally Efficient 3D Optical CDMA Using Coherent Spatial Phase–Time Coding/Decoding

We demonstrate a WDM compatible optical CDMA system incorporating 3D spectral phase–time encoding/decoding. We provide coding and decoding using binary [0, π] phase chips for six users at 6 Gb/s, with a single coded signal separated with an acceptable bit-error rate ≤10 ^?9. The coding and decoding method is based on 3D coding of tightly spaced phase-locked laser lines that is compatible with conventional WDM networking. In optical CDMA systems, we propose to provide encoding and decoding done by converting Hadamard codes (used for conventional CDMA system) to the phase codes. We report that duo-binary modulation format is the best with adequate bandwidth compression. We confirm that better simulation results are reached in terms of the Q factor and bit error rate.     

MAC protocol with delay-aware adaptive round time for split light-trail

Light-trail (LT) has been considered as an attractive solution for optical networks to support emerging services such as video-on-demand, pseudo-wires, and data-centers. The media access control (MAC) protocol is essential for LT networks because LT is a shared-medium. Recently, in order to enhance the throughput, a regular LT can be split into several sub-LTs at the split nodes where traffic undergoes optical-electronic-optical conversation. To deal with the split LT, a novel MAC protocol named Delay-aware adaptive round time for split LT (DAARTS) is developed on the basis of DAART MAC protocol and the schemes of splitting LT. To estimate the performance of the developed MAC protocol, ART, DAART and DAARTS protocols are simulated and compared in the scenarios of three different traffic patterns. Simulation results show that, for traffic 1 and traffic 2, DAARTS has stable throughput performance and can obtain almost 40.83% and 106.64% throughput improvement compared with DAART, respectively. In other words, DAARTS can further enhance the throughput of LT networks.     

Half-duplex relaying with serially concatenated low-density generator matrix (SCLDGM) codes

Recently, the integration of cooperation with coding has proven to be a very useful technique to enhance relay system performance. Relay systems based on low-density parity-check (LDPC) codes have the potential to approach the theoretical information limits very closely. However, LDPC codes have a disadvantage in that the encoding complexity is high. To solve this problem, serially concatenated low-density generator matrix (SCLDGM) codes are attracting attention owing to their low encoding complexity. However, the performance of SCLDGM coded relaying has not been investigated. In this paper, we apply SCLDGM codes to relay channel with the motivation of lowering the encoding complexity. Since SCLDGM codes are concatenated codes, we cannot use the same method as LDPC coded relaying. We propose a new relaying system and three cooperation protocols suited for SCLDGM codes. Computer simulation results show that the bit error rate (BER) performance of the proposed system is equal to that of conventional LDPC coded relaying system.     

量子Turbo乘积码

量子通信是经典通信和量子力学相结合的一门新兴交叉学科.量子纠错编码是实现量子通信的关键技术之一.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,许多经典的编码技术在量子领域中都可以找到其对应的编码方法.针对经典纠错码中最好码之一的Turbo乘积码,提出一种以新构造的CSS型量子卷积码为稳定子码的量子Turbo乘积码.首先,运用群的理论及稳定子码的基本原理构造出新的CSS型量子卷积码稳定子码生成元,并描述了其编码网络.接着,利用量子置换SWAP门定义推导出量子Turbo乘积码的交织编码矩阵.最后,推导出量子Turbo乘积码的译码迹距离与经典Turbo乘积码的译码距离的对应关系,并提出量子Turbo乘积码的编译码实现方案.这种编译码方法具有高度结构化,设计思路简单,网络易于实施的特点. 关键词： CSS码 量子卷积码 量子Turbo乘积码 量子纠错编码     

Joint signal alignment precoding and physical network coding for heterogeneous networks

Mobile traffic in cellular based networks is increasing exponentially, mainly due to the use of data intensive services like video. One effective way to cope with these demands is to reduce the cell-size by deploying small-cells along the coverage area of the current macro-cell system. The deployment of small-cells significantly improves the indoor coverage. Nevertheless, as additional spectrum licenses are difficult and expensive to acquire, it is expected that the macro and small-cells will coexist under the same spectrum. The coexistence of the two systems results in cross-tier/inter-system interference. In this context, we consider the application of joint signal alignment (SA) and physical network coding (PNC) for the uplink of heterogeneous networks, in order to cancel the interference generated from small-cells at the macro-cell user terminal. The joint design of SA and PNC allows to serve more users than the case where only PNC or interference alignment (IA) is employed individually. We compare our proposed joint SA-PNC schemes with the recently designed IA based techniques for the uplink heterogeneous systems. Simulation results show that the proposed SA-PNC is quite efficient to remove the inter-tier/system interference while allowing to increase the overall data rate, by serving more users, as compared with the IA based methods     

高速水声通信系统仿真研究

水声信道是较复杂的数据通信环境。本文设计了3种高速水声通信的系统结构,并通过系统的、全面的仿真比较了他们的性能。建立了包括时变衰落、多途和加性干扰的水声信道模型。3种方案都采用相位相干的QPSK调制技术,接收端采用空时联合的自适应均衡(内置DPLL)接收;前向纠错编码译码器分别采用3种方案:卷积码,串行级联码(卷积码+RS码),并行级联卷积码(Turbo码)。通过仿真研究了不同数目水声接收机的接收分集下的系统性能,研究了3种编码方案下的系统性能。     

Rate adaptation of convolutional coded optical CDMA systems for improved goodput

Rate adaptation is a technique that enables the selection of the most suitable error-correction coding rate according to the real-time channel quality, therefore increasing the overall throughput. We propose the use of rate adaptive convolutional codes for amplitude encoded, binary on–off keyed optical code-division multiple access (OCDMA) systems. Conventional OCDMA systems have a bit error probability floor due to optical multiple-user interference (OMUI). A convolutional coded OCDMA system (CC-OCDMA) lowers the error floors with increased coding rates but at the expense of reduced goodput (throughput minus the redundancy bits or symbols). However, by exploiting the variation of OMUI with user number, it is shown here that rate adaptation offers larger and consistent goodput improvements compared to fixed coding rate CC-OCDMA systems for various traffic profiles. This advantage is also observed in comparisons with OCDMA systems using improved receiver designs and 2D wavelength/time signatures codes. Based on the analytical results obtained here and the commercial availability of convolutional coding chipsets, rate-adaptive convolutional coding for OCDMA systems is worth to be considered for practical implementation.     

Variable cross-correlation code construction for spectral amplitude coding optical CDMA networks

We present, for the first time, several aspects of incoherent optical code-division multiple access (OCDMA) codes, focusing on the flexible variable cross-correlation code allocation and its potential for future optical networks. We briefly present a new version of the Random Diagonal (RD) codes for Spectral-Amplitude Coding (SAC) OCDMA approaches. We then concentrate on the properties specific to such schemes allowing for its increased scalability and flexibility. The main coding properties are reviewed. The RD codes provide simple matrix constructions compared to the other SAC-OCDMA codes such as Hadamard, MQC and MFH codes. This code possesses such a numerous advantages, including the efficient and easy code construction, simple encoder/decoder design, existence for every natural number n, and variable in-phase cross-correlation and easy to implement using Fiber Bragg Gratings (FBGs). Finally, a new detection scheme called “NAND” detection is developed for the variable cross-correlation RD code.     

Mobility-aware coded caching in D2D communication networks

In this paper, we consider a cache-enable device-to-device (D2D) communication network with user mobility and design a mobility-aware coded caching scheme to exploit multicasting opportunities for reducing network traffic. In addition to the static cache memory that can be used to reap coded caching gains, we assign a dynamic cache memory to mobile users such that users who never meet can still exchange contents via relaying. We consider content exchange as an information flow among dynamic cache memories of mobile users and leverage network coding to reduce network traffic. Specifically, we transfer our storage and broadcast problem into a network coding problem. By solving the formulated network coding problem, we obtain a dynamic content replacement and broadcast strategy. Numerical results verify that our algorithm significantly outperforms the random and greedy algorithms in terms of the amount of broadcasting data, and the standard Ford–Fulkerson algorithm in terms of the successful decoding ratio.     

Performance of multi-user transmitter preprocessing assisted MIMO system over correlated frequency-selective channels

In this contribution we present the performance of a multi-user transmitter preprocessing (MUTP) assisted multiple-input multiple-output (MIMO) space division multiple access (SDMA) system, aided by double space time transmit diversity (DSTTD) and space time block code (STBC) processing for downlink (DL) and uplink (UL) transmissions respectively. The MUTP is invoked by singular value decomposition (SVD) which exploits the channel state information (CSI) of all the users at the base station (BS) and only an individual user’s CSI at the mobile station (MS). Specifically, in this contribution, we investigate the performance of multi-user MIMO cellular systems in frequency-selective channels from a transmitter signal processing perspective, where multiple access interference (MAI) is the dominant channel impairment. In particular, the effects of three types of delay spread distributions on MUTP assisted MIMO SDMA systems pertaining to the Long Term Evolution (LTE) channel model are analyzed. The simulation results demonstrate that MUTP can perfectly eliminate MAI in addition to obviating the need for complex multi-user detectors (MUDs) both at the BS and MS. Further, SVD-based MUTP results in better achievable symbol error rate (SER) compared to popularly known precoding schemes such as block diagonalization (BD), dirty paper coding (DPC), Tomlinson–Harashima precoding (THP) and geometric mean decomposition (GMD). Furthermore, when turbo coding is invoked, coded SVD aided MUTP results in better achievable SER than an uncoded system.     

Modeling the lossy transmission of correlated sources in multiple access fading channels

In this paper, we develop accurate distortion models for the lossy transmission of two correlated sources in a multiple access Rayleigh fading channel. We focus on a class of real-life communication systems, where the source and channel coders have already been designed separately and can only be configured during the system operation. We investigate three different source coding schemes: distributed source coding (DSC), layered source coding, and independent compression through quantization. With the later scheme the sources are jointly decoded with minimum mean square error (MMSE) estimation at the receiver. We also consider two different transmission schemes: Orthogonal transmissions and interfering transmissions decoded with a successive interference cancellation (SIC) decoder. Our final closed-form analytical models are used to determine the optimal combination of source coding and transmission schemes, as well as their optimal configuration. Hence, we exercise joint source and channel coding (JSCC) by optimizing the system configuration. Through simulations, we first validate the analytical model and illustrate the performance of different schemes. Finally, we demonstrate the JSCC gains achieved by our system.     

Attaining Fairness in Communication for Omniscience

This paper studies how to attain fairness in communication for omniscience that models the multi-terminal compress sensing problem and the coded cooperative data exchange problem where a set of users exchange their observations of a discrete multiple random source to attain omniscience—the state that all users recover the entire source. The optimal rate region containing all source coding rate vectors that achieve omniscience with the minimum sum rate is shown to coincide with the core (the solution set) of a coalitional game. Two game-theoretic fairness solutions are studied: the Shapley value and the egalitarian solution. It is shown that the Shapley value assigns each user the source coding rate measured by their remaining information of the multiple source given the common randomness that is shared by all users, while the egalitarian solution simply distributes the rates as evenly as possible in the core. To avoid the exponentially growing complexity of obtaining the Shapley value, a polynomial-time approximation method is proposed which utilizes the fact that the Shapley value is the mean value over all extreme points in the core. In addition, a steepest descent algorithm is proposed that converges in polynomial time on the fractional egalitarian solution in the core, which can be implemented by network coding schemes. Finally, it is shown that the game can be decomposed into subgames so that both the Shapley value and the egalitarian solution can be obtained within each subgame in a distributed manner with reduced complexity.     

A novel non-coherent spectral OCDMA system using one-dimensional expanded Hybrid codes for two-code keying

We propose leveraging one-dimensional expanded Hybrid codes (1-D E-Hybrid codes) for two-code keying (TCK) in spectral amplitude coding (SAC) optical code division multiple access (OCDMA) networks. Compared with the existing work, the proposed system can utilize all codes and provide a larger code size to support more simultaneous users. The numerical results demonstrate that the 1-D E-Hybrid codes for TCK outperform the existing 1-D approaches in terms of bit error rate (BER), and the data transmission rate can achieve 2.5 Gbps.     

IRZ-Manchester coding for downstream signal modulation in an ONU-source-free WDM-PON

Inverted return-to-zero (IRZ)-Manchester coding is proposed for optical downstream signal using amplitude shift keying (ASK) modulation in an optical network unit (ONU)-source-free wavelength-division-multiplexing passive optical network (WDM-PON), and ASK modulation is used for the optical upstream signal generation using remodulation over the optical downstream signal. With IRZ-Manchester coding, differential phase shift keying (DPSK) modulation can be overlaid on the downstream optical ASK signal for broadcasting services. Our experimental results show that the IRZ-Manchester coded optical ASK downstream signal has no modulation extinction ratio restrictions from the overlaid DPSK modulation, and that the remodulated optical upstream signal has very limited signal crosstalk from the downstream signals. In comparison with the conventional schemes using only Manchester coding or IRZ modulation, the proposed IRZ-Manchester coded modulation scheme shows better performance under different PON upstream and downstream traffic bit rate ratios.     

Application of Turbo codes in optical OFDM multimode fiber communication system

In this paper, Turbo Code is proposed in optical OFDM multimode fiber communication system in order to decrease the bit error rate (BER) of the system, which is mainly affected by the deep nulls of the magnitude response of multimode fiber in the high frequency region (above 3 dB). A simulation system in SIMULINK is established. Based on the system, the BER of the system with Turbo Code is compare to the systems with another two typical coding schemes including convolutional code (CC) and serially concatenated code (SCC) which uses a concatenation of convolutional and RS codes when transmitting 10 Gbps data over various length multimode fibers. Different transmitting rate is also considered. The results show that Turbo coded system has a lower BER than the other two systems and the Turbo coded system can transmit 10 Gbps data to the distance of 300 m with BER below 1e−6.     

Comparison of sound fields generated by different coded excitations--experimental results

This work reports the results of measurements of spatial distributions of ultrasound fields obtained from five energizing schemes. Three different codes, namely, chirp signal and two sinusoidal sequences were investigated. The sequences were phase modulated with 13 bits Barker code and 16 bits Golay complementary codes. Moreover, two reference signals generated as two and sixteen cycle sine tone bursts were examined. Planar, 50% (fractional) bandwidth, 15 mm diameter source transducer operating at 2 MHz center frequency was used in all measurements. The experimental data were collected using computerized scanning system and recorded using wideband, PVDF membrane hydrophone (Sonora 804). The measured echoes were compressed, so the complete pressure field in the investigated location before and after compression could be compared. In addition to a priori anticipated increase in the signal to noise ratio (SNR) for the decoded pressure fields, the results indicated differences in the pressure amplitude levels, directivity patterns, and the axial distance at which the maximum pressure amplitude was recorded. It was found that the directivity patterns of non-compressed fields exhibited shapes similar to the patterns characteristic for sinusoidal excitation having relatively long time duration. In contrast, the patterns corresponding to compressed fields resembled those produced by brief, wideband pulses. This was particularly visible in the case of binary sequences. The location of the maximum pressure amplitude measured in the 2 MHz field shifted towards the source by 15 mm and 25 mm for Barker code and Golay code, respectively. The results of this work may be applicable in the development of new coded excitation schemes. They could also be helpful in optimizing the design of imaging transducers employed in ultrasound systems designed for coded excitation. Finally, they could shed additional light on the relationship between the spatial field distribution and achievable image quality and in this way facilitate optimization of the images obtained using coded systems.     

Performance characteristics and weight distribution analysis of turbo product code with Reed-Muller component codes

In this paper, we present simulation results for Reed-Muller (RM) turbo codes over AWGN and Rayleigh fading channels. We also compare the simulation results of turbo product codes and block turbo codes with RM component codes over an AWGN channel. We show that minimum distance is not important as far as the BER performance of long codes is concerned. The weight distribution of RM codes of different lengths and turbo product codes with first-order RM component codes are obtained and analyzed for their good performance. We show that the weight distribution asymptotically approaches that of random coding as the code length increases.     

Comparison and analysis of codes for remodulation WDM-PON with adaptive code selection

In a remodulation PON, the upstream signal quality can be improved when the downstream signal is coded. But low code efficiency may result in network congestion in downlink. Based on the downlink traffic, a self-adapting PON can select the proper downstream modulation codes to achieve the optimal network performance. With adaptive code selection, network congestion can be avoided and the remodulated upstream signal suffers minimal performance degradation. Some codes of various coding efficiency are required to be selected in this self-adapting PON. These codes should induce as little crosstalk to the upstream signal as possible. Several candidate codes with coding efficiencies from 50% to 80%, such as Manchester code, 3b5b code, 4b5b code, 4b6b code and 6b8b code are tested through simulation and experiment in this paper, and their performances are compared. The results show that the optimum code for downstream modulation depends on the downlink traffic and the upstream bit rate. The results will help the self-adapting remodulation WDM-PON to select the proper downstream modulation codes in different traffic situations.     

Coded Caching for Broadcast Networks with User Cooperation

Caching technique is a promising approach to reduce the heavy traffic load and improve user latency experience for the Internet of Things (IoT). In this paper, by exploiting edge cache resources and communication opportunities in device-to-device (D2D) networks and broadcast networks, two novel coded caching schemes are proposed that greatly reduce transmission latency for the centralized and decentralized caching settings, respectively. In addition to the multicast gain, both schemes obtain an additional cooperation gain offered by user cooperation and an additional parallel gain offered by the parallel transmission among the server and users. With a newly established lower bound on the transmission delay, we prove that the centralized coded caching scheme is order-optimal, i.e., achieving a constant multiplicative gap within the minimum transmission delay. The decentralized coded caching scheme is also order-optimal if each user’s cache size is larger than a threshold which approaches zero as the total number of users tends to infinity. Moreover, theoretical analysis shows that to reduce the transmission delay, the number of users sending signals simultaneously should be appropriately chosen according to the user’s cache size, and always letting more users send information in parallel could cause high transmission delay.