In this paper, we propose a method for predicting radio wave propagation using a correlation graph convolutional neural network (C-Graph CNN). We examine what kind of parameters are suitable to be used as system parameters in C-Graph CNN. Performance of the proposed method is evaluated by the path loss estimation accuracy and the computational cost through simulation.

In frequency hopping communication, time delay and Doppler shift incur interference. With the escalating upgrading of complicated interference, in this paper, the time-frequency two-dimensional (TFTD) partial Hamming correlation (PHC) properties of wide-gap frequency-hopping sequences (WGFHSs) with frequency shift are discussed. A bound on the maximum TFTD partial Hamming auto-correlation (PHAC) and two bounds on the maximum TFTD PHC of WGFHSs are got. Li-Fan-Yang bounds are the particular cases of new bounds for frequency shift is zero.

The orthogonal time frequency space (OTFS) technique proposed in recent years has excellent anti-Doppler frequency shift and time delay performance, enabling its application in high speed communication scenarios. In this article, a particle swarm optimization (PSO) signal detection algorithm for OTFS system is proposed, an adaptive mechanism for the individual learning factor and global learning factor in the speed formula of the algorithm is designed, and the position update method of the particles is improved, so as to increase the convergence accuracy and avoid the particles to fall into local optimum. The simulation results show that the improved PSO algorithm has the advantages of low bit error rate (BER) and high convergence accuracy compared with the traditional PSO algorithm, and has similar performance to the ideal state maximum likelihood (ML) detection algorithm with lower complexity. In the case of high Doppler shift, OTFS technology has better performance than orthogonal frequency division multiplexing (OFDM) technology by using improved PSO algorithm.

This study numerically investigates the symbol-level allocation of four-level pulse-amplitude modulation (PAM4) signals for optically pre-amplified receiver systems. Three level-allocation schemes are examined: intensity-equispaced, amplitude-equispaced, and numerically optimized. Numerical simulations are conducted to comprehensively compare the receiver sensitivities for these level-allocation schemes under various system conditions. The results show that the superiority or inferiority between the level allocations is significantly dependent on the system conditions of the bandwidth of amplified spontaneous emission light, modulation bandwidth, and signal extinction ratio (ER). The mechanisms underlying these dependencies are also discussed.

With the recent commercialization of fifth-generation mobile communication systems (5G), wireless communications are being used in various fields. Accordingly, the number of situations in which sensitive information, such as personal data is handled in wireless communications is increasing, and so is the demand for confidentiality. To meet this demand, we proposed a chaos-based radio-encryption modulation that combines physical layer confidentiality and channel coding effects, and we have demonstrated its effectiveness through computer simulations. However, there are no demonstrations of performances using real signals. In this study, we constructed a transmission system using Universal Software Radio Peripheral, a type of software-defined radio, and its control software LabVIEW. We conducted wired transmission experiments for the practical use of radio-frequency encrypted modulation. The results showed that a gain of 0.45dB at a bit error rate of 10-3 was obtained for binary phase-shift keying, which has the same transmission efficiency as the proposed method under an additive white Gaussian noise channel. Similarly, a gain of 10dB was obtained under fading conditions. We also evaluated the security ability and demonstrated that chaos modulation has both information-theoretic security and computational security.

Physical Unclonable Function (PUF) is a promising lightweight hardware security primitive that can extract device fingerprints for encryption or authentication. However, extracting fingerprints from either the chip or the board individually has security flaws and cannot provide hardware system-level security. This paper proposes a new Chip-PCB hybrid PUF(CPR PUF) in which Weak PUF on PCB is combined with Strong PUF inside the chip to generate massive responses under the control of challenges of on-chip Strong PUF. This structure tightly couples the chip and PCB into an inseparable and unclonable unit thus can verify the authenticity of chip as well as the board. To improve the uniformity and reliability of Chip-PCB hybrid PUF, we propose a lightweight key generator based on a reliability self-test and debiasing algorithm to extract massive stable and secure keys from unreliable and biased PUF responses, which eliminates expensive error correction processes. The FPGA-based test results show that the PUF responses after robust extraction and debiasing achieve high uniqueness, reliability, uniformity and anti-counterfeiting features. Moreover, the key generator greatly reduces the execution cost and the bit error rate of the keys is less than 10-9, the overall security of the key is also improved by eliminating the entropy leakage of helper data.

Conventional Nyquist folding receiver (NYFR) uses zero crossing rising (ZCR) voltage times to control the RF sample clock, which is easily affected by noise. Moreover, the analog and digital parts are not synchronized so that the initial phase of the input signal is lost. Furthermore, it is assumed in most literature that the input signal is in a single Nyquist zone (NZ), which is inconsistent with the actual situation. In this paper, we propose an improved architecture denominated as a dual-channel NYFR with adjustable local oscillator (LOS) and an information recovery algorithm. The simulation results demonstrate the validity and viability of the proposed architecture and the corresponding algorithm.

Automatic modulation recognition(AMR) of radar signals is a currently active area, especially in electronic reconnaissance, where systems need to quickly identify the intercepted signal and formulate corresponding interference measures on computationally limited platforms. However, previous methods generally have high computational complexity and considerable network parameters, making the system unable to detect the signal timely in resource-constrained environments. This letter firstly proposes an efficient modulation recognition network(EMRNet) with tiny and low latency models to match the requirements for mobile reconnaissance equipments. One-dimensional residual depthwise separable convolutions block(1D-RDSB) with an adaptive size of receptive fields is developed in EMRNet to replace the traditional convolution block. With 1D-RDSB, EMRNet achieves a high classification accuracy and dramatically reduces computation cost and network paraments. The experiment results show that EMRNet can achieve higher precision than existing 2D-CNN methods, while the computational cost and parament amount of EMRNet are reduced by about 13.93× and 80.88×, respectively.

In this letter, we propose a feature-based knowledge distillation scheme which transfers knowledge between intermediate blocks of teacher and student with flow-based architecture, specifically Normalizing flow in our implementation. In addition to the knowledge transfer scheme, we examine how configuration of the distillation positions impacts on the knowledge transfer performance. To evaluate the proposed ideas, we choose two knowledge distillation baseline models which are based on Normalizing flow on different domains: CS-Flow for anomaly detection and SRFlow-DA for super-resolution. A set of performance comparison to the baseline models with popular benchmark datasets shows promising results along with improved inference speed. The comparison includes performance analysis based on various configurations of the distillation positions in the proposed scheme.

We propose Quality Enhancement via a Side bitstream Network (QESN) technique for lossy image compression. The proposed QESN utilizes the network architecture of deep image compression to produce a bitstream for enhancing the quality of conventional compression. We also present a loss function that directly optimizes the Bjontegaard delta bit rate (BD-BR) by using a differentiable model of a rate-distortion curve. Experimental results show that QESN improves the rate by 16.7% in the BD-BR compared to Better Portable Graphics.

The design and adjustment of the divergence in audio applications using nonnegative matrix factorization (NMF) is still open problem. In this study, to deal with this problem, we explore a representation of the divergence using neural networks (NNs). Instead of the divergence, our approach extends the multiplicative update algorithm (MUA), which estimates the NMF parameters, using NNs. The design of the extended MUA incorporates NNs, and the new algorithm is referred to as the deep MUA (DeMUA) for NMF. While the DeMUA represents the algorithm for the NMF, interestingly, the divergence is obtained from the incorporated NN. In addition, we propose theoretical guides to design the incorporated NN such that it can be interpreted as a divergence. By appropriately designing the NN, MUAs based on existing divergences with a single hyper-parameter can be represented by the DeMUA. To train the DeMUA, we applied it to audio denoising and supervised signal separation. Our experimental results show that the proposed architecture can learn the MUA and the divergences in sparse denoising and speech separation tasks and that the MUA based on generalized divergences with multiple parameters shows favorable performances on these tasks.

In this paper, a novel reconfigurable intelligent surface (RIS)-aided full-duplex (FD) cooperative non-orthogonal multiple access (CNOMA) network is investigated over Nakagami-m fading channels, where two RISs are employed to help the communication of paired users. To evaluate the potential benefits of our proposed scheme, we first derive the closed-form expressions of the outage probability. Then, we derive users' diversity orders according to the asymptotic approximation at high signal-to-noise-ratio (SNR). Simulation results validate our analysis and reveal that users' diversity orders are affected by their channel fading parameters, the self-interference of FD, and the number of RIS elements.

Fractional Frequency Reuse (FFR), which was introduced by 3GPP is considered the powerful technique to improve user performance. However, implementation of FFR is a challenge due to strong dependence between base stations (BSs) in terms of resource allocations. This paper studies a modified and flexible FFR scheme that allows all BSs works independently. The analytical and simulation results prove that the modified FFR scheme outperforms the conventional FFR.

In order to improve the anomaly detection efficiency of network traffic, firstly, the model is established for network flows based on complex networks. Aiming at the uncertainty and fuzziness between network traffic characteristics and network states, the deviation extent is measured from the normal network state using deviation interval uniformly, and the intuitionistic fuzzy sets (IFSs) are established for the various characteristics on the network model that the membership degree, non-membership degree and hesitation margin of the IFSs are used to quantify the ownership of values to be tested and the corresponding network state. Then, the knowledge measure (KM) is introduced into the intuitionistic fuzzy weighted geometry (IFWGω) to weight the results of IFSs corresponding to the same network state with different characteristics together to detect network anomaly comprehensively. Finally, experiments are carried out on different network traffic datasets to analyze the evaluation indicators of network characteristics by our method, and compare with other existing anomaly detection methods. The experimental results demonstrate that the changes of various network characteristics are inconsistent under abnormal attack, and the accuracy of anomaly detection results obtained by our method is higher, verifying our method has a better detection performance.

This paper introduces a deep reinforcement learning approach to solve the virtual network function scheduling problem in dynamic scenarios. We formulate an integer linear programming model for the problem in static scenarios. In dynamic scenarios, we define the state, action, and reward to form the learning approach. The learning agents are applied with the asynchronous advantage actor-critic algorithm. We assign a master agent and several worker agents to each network function virtualization node in the problem. The worker agents work in parallel to help the master agent make decision. We compare the introduced approach with existing approaches by applying them in simulated environments. The existing approaches include three greedy approaches, a simulated annealing approach, and an integer linear programming approach. The numerical results show that the introduced deep reinforcement learning approach improves the performance by 6-27% in our examined cases.

In this paper, we investigate the sum rate (SR) maximization problem for downlink cooperative non-orthogonal multiple access (C-NOMA) system under in-phase and quadrature-phase (IQ) imbalance at the base station (BS) and destination. The BS communicates with users by a half-duplex amplified-and-forward (HD-AF) relay under imperfect IQ imbalance. The sum rate maximization problem is formulated as a non-convex optimization with the quality of service (QoS) constraint for each user. We first use the variable substitution method to transform the non-convex SR maximization problem into an equivalent problem. Then, a joint power and rate allocation algorithm is proposed based on successive convex approximation (SCA) to maximize the SR of the systems. Simulation results verify that the algorithm can improve the SR of the C-NOMA compared with the cooperative orthogonal multiple access (C-OMA) scheme.

In this paper, we investigate the Access Point (AP) selection problem in Cell-Free Massive multiple-input multiple-output (MIMO) system. Firstly, we add a connecting coefficient to the uplink data transmission model. Then, the problem of AP selection is formulated as a discrete combinatorial optimization problem which can be dealt with by the particle swarm algorithm. However, when the number of optimization variables is large, the search efficiency of the traditional particle swarm algorithm will be significantly reduced. Then, we propose an ‘user-centric’ cooperative coevolution scheme which includes the proposed probability-based particle evolution strategy and random-sampling-based particle evaluation mechanism to deal with the search efficiency problem. Simulation results show that proposed algorithm has better performance than other existing algorithms.

In this paper, user set selection in the allocation sequences of round-robin (RR) scheduling for distributed antenna transmission with block diagonalization (BD) pre-coding is proposed. In prior research, the initial phase selection of user equipment allocation sequences in RR scheduling has been investigated. The performance of the proposed RR scheduling is inferior to that of proportional fair (PF) scheduling under severe intra-cell interference. In this paper, the multi-input multi-output technology with BD pre-coding is applied. Furthermore, the user equipment (UE) sets in the allocation sequences are eliminated with reinforcement learning. After the modification of a RR allocation sequence, no estimated throughput calculation for UE set selection is required. Numerical results obtained through computer simulation show that the maximum selection, one of the criteria for initial phase selection, outperforms the weighted PF scheduling in a restricted realm in terms of the computational complexity, fairness, and throughput.

Autonomous driving technology is expected to be applied to various applications with unmanned vehicles (UVs), such as small delivery vehicles for office supplies and smart wheelchairs. UV remote control by a cloud server (CS) would achieve cost-effective applications with a large number of UVs. In general, dead time in real-time feedback control reduces the control accuracy. On remote path tracking control by the CS, UV control accuracy deteriorates due to transmission delay and jitter through the Internet. Digital twin computing (DTC) and jitter buffer are effective to solve this problem. In our previous study, we clarified effectiveness of them in UV remote control by CS. The jitter buffer absorbs the transmission delay jitter of control signals. This is effective to achieve accurate UV remote control. Adaptive buffering time optimization according to real-time transmission characteristics is necessary to achieve more accurate UV control in CS-based remote control system with DTC and jitter buffer. In this study, we proposed a method for the adaptive optimization according to real-time transmission delay characteristics. To quantitatively evaluate the effectiveness of the method, we created a UV remote control simulator of the control system. The results of simulations quantitatively clarify that the adaptive optimization by the proposed method improves the UV control accuracy.

It is very important to design an embedded real-time system as a fault-tolerant system to ensure dependability. In particular, when a power failure occurs, restart processing after power restoration is required in a real-time system using a conventional processor. Even if power is restored quickly, the restart process takes a long time and causes deadline misses. In order to design a fault-tolerant real-time system, it is necessary to have a processor that can resume operation in a short time immediately after power is restored, even if a power failure occurs at any time. Since current embedded real-time systems are required to execute many tasks, high schedulability for high throughput is also important. This paper proposes a non-stop microprocessor architecture to achieve a fault-tolerant real-time system. The non-stop microprocessor is designed so as to resume normal operation even if a power failure occurs at any time, to achieve little performance degradation for high schedulability even if checkpoint creations and restorations are performed many times, to control flexibly non-volatile devices through software configuration, and to ensure data consistency no matter when a checkpoint restoration is performed. The evaluation shows that the non-stop microprocessor can restore a checkpoint within 5µsec and almost hide the overhead of checkpoint creations. The non-stop microprocessor with such capabilities will be an essential component of a fault-tolerant real-time system with high schedulability.