Orthogonal frequency division multiplexing (OFDM) technique has been widely used in communication systems in pursuit of the most efficient utilization of spectrum. However, the increase of the number of orthogonal subcarriers will lead to the rise of the peak-to-average power ratio (PAPR) of the waveform, thus reducing the efficiency of the power amplifiers. In this letter we propose a phase-changed PAPR reduction technique based on windowing function architecture for OFDM systems. This technique is based on the idea of phase change, which makes the spectrum of output signal almost free of regrowth caused by peak clipping. It can reduce more than 28dBc adjacent channel power ratio (ACPR) compared with the traditional peak windowing clipping methods in situation that peak is maximally suppressed. This technique also has low algorithm complexity so it can be easily laid out on hardware. The proposed algorithm has been laid out on a low-cost field-programmable gate array (FPGA) to verify its effectiveness and feasibility. A 64-QAM modulated 20M LTE-A waveform is used for measurement, which has a sampling rate of 245.67M.

Counting the number of differentially active S-boxes is of great importance in evaluating the security of a block cipher against differential attack. Mouha et al. proposed a technique based on Mixed-Integer Linear Programming (MILP) to automatically calculate a lower bound of the number of differentially active S-boxes for word-oriented block ciphers, and applied it to symmetric ciphers AES and Enocoro-128v2. Later Sun et al. extended the method by introducing bit-level representations for S-boxes and new constraints in the MILP problem, and applied the extended method to PRESENT-80 and LBlock. This kind of methods greatly depends on the constraints in the MILP problem describing the differential propagation of the block cipher. A more accurate description of the differential propagation leads to a tighter bound on the number of differentially active S-boxes. In this paper, we refine the constraints in the MILP problem describing XOR operations, and apply the refined MILP modeling to determine a lower bound of the number of active S-boxes for the Lai-Massey type block cipher FOX in the model of single-key differential attack, and obtain a tighter bound in FOX64 than existing results. Experimental results show that 6, instead of currently known 8, rounds of FOX64 is strong enough to resist against basic single-key differential attack since the differential characteristic probability is upper bounded by 2-64, and thus the maximum differential characteristic probability of 12-round FOX64 is upper bounded by 2-128, where 128 is the key-length of FOX64. We also get the lower bound of the number of differentially active S-boxes for 5-round FOX128, and proved the security of the full-round FOX128 with respect to single-key differential attack.

Low Power Wide Area Network (LPWAN) is designed for low-bandwidth, low-power, long-distance, large-scale connected IoT applications and realistic for networking in an emergency or restricted situation, so it has been proposed as an attractive communication technology to handle unexpected situations that occur during and/or after a disaster. However, the traditional LPWAN with its default protocol will reduce the communication efficiency in disaster situation because a large number of users will send and receive emergency information result in communication jams and soaring error rates. In this paper, we proposed a LPWAN based decentralized network structure as an extension of our previous Disaster Information Sharing System (DISS). Our network structure is powered by Named Node Networking (3N) which is based on the Information-Centric Networking (ICN). This network structure optimizes the excessive useless packet forwarding and path optimization problems with node name routing (NNR). To verify our proposal, we conduct a field experiment to evaluate the efficiency of packet path forwarding between 3N+LPWA structure and ICN+LPWA structure. Experimental results confirm that the load of the entire data transmission network is significantly reduced after NNR optimized the transmission path.

Global Navigation Satellite System (GNSS) receivers often realize anti-jamming capabilities by combining array antennas with space-time adaptive processing (STAP). Unfortunately, in suppressing the interference, basic STAP degrades the GNSS signal. For one thing, additional carrier phase errors and code phase errors to the GNSS signal are introduced; for another, the shape of the cross-correlation function (CCF) will be distorted by STAP, introducing tracking errors when the receiver is in tracking mode. Both of them will eventually cause additional Pseudo-Range (PR) bias, and these problems prevent STAP from being directly applied to high-precision satellite navigation receivers. The paper proposes a novel anti-jamming method based on STAP that solves the above problems. First, the proposed method constructs a symmetric STAP by constraining the STAP coefficients. Subsequently, with the information of the steering vector, a compensation FIR filter is cascaded after the symmetric STAP. This approach ensures that the proposed method introduces only a fixed offset to the code phase and carrier phase, and the order of the STAP completely determines the offset, which can be compensated during PR measurements. Meanwhile, the proposed method maintains the symmetry of the CCF, and the receiver can accurately track the carrier phase and code phase in tracking mode. The effectiveness of the proposed method is validated through simulations, which suggest that, in the worst case, our method does not increase carrier and code phase errors and tracking error at the expense of only a 2.86dB drop in interference suppression performance.

Mutual coupling between antenna array elements will significantly degrade the performance of the array signal processing methods. Due to the Toeplitz structure of mutual coupling matrix (MCM), there exist some mutual coupling calibration algorithms for the uniform linear array (ULA) or uniform circular array (UCA). But few methods for other arrays. In this letter, we derive a new transformation formula for the MCM of the 7-elements hexagonal array (HA-7). Further, we extend two mutual coupling auto-calibration methods from UCA to HA by the transformation formula. Simulation results demonstrate the validity of the proposed two methods.

The rise of next-generation logistics systems featuring autonomous vehicles and drones has brought to light the severe problem of Global navigation satellite system (GNSS) location data spoofing. While signal-based anti-spoofing techniques have been studied, they can be challenging to apply to current commercial GNSS modules in many cases. In this study, we explore using multiple sensing devices and machine learning techniques such as decision tree classifiers and Long short-term memory (LSTM) networks for detecting GNSS location data spoofing. We acquire sensing data from six trajectories and generate spoofing data based on the Software-defined radio (SDR) behavior for evaluation. We define multiple features using GNSS, beacons, and Inertial measurement unit (IMU) data and develop models to detect spoofing. Our experimental results indicate that LSTM networks using ten-sequential past data exhibit higher performance, with the accuracy F1 scores above 0.92 using appropriate features including beacons and generalization ability for untrained test data. Additionally, our results suggest that distance from beacons is a valuable metric for detecting GNSS spoofing and demonstrate the potential for beacon installation along future drone highways.

This letter provides an efficient massive multiple-input multiple-output (MIMO) detector based on quasi-newton methods to speed up the convergence performance under realistic scenarios, such as high user load and spatially correlated channels. The proposed method leverages the information of the Hessian matrix by merging Barzilai-Borwein method and Limited Memory-BFGS method. In addition, an efficient initial solution based on constellation mapping is proposed. The simulation results demonstrate that the proposed method diminishes performance loss to 0.7dB at the bit-error-rate of 10-2 at 128×32 antenna configuration with low complexity, which surpasses the state-of-the-art (SOTA) algorithms.

Solution space smoothing allows a local search heuristic to escape from a poor, local minimum. In this paper, we propose a technique that can smooth the rugged terrain surface of the solution space of a placement problem. We test the smoothing heuristics for MCNC benchmarks, and for VLSI placement with pre-placed modules and placement with consideration of congestion. Experiment results demonstrated that solution space smoothing is very efficient for VLSI module placement, and it can be applied to all floorplanning representations proposed so far.

Low Earth Orbit (LEO) satellite networks serve as a powerful complement to the terrestrial networks because of their ability to provide global coverage. In LEO satellite networks, the network is prone to congestion due to several reasons. First, the terrestrial gateways are usually located within a limited region leading to congestion of the nodes near the gateways. Second, routing algorithms that merely adopt shortest paths fail to distribute the traffic uniformly in the network. Finally, the traffic input may exceed the network capacity. Therefore, rate control and load-balancing routing are needed to alleviate network congestion. Moreover, different kinds of traffic have different Quality of Service (QoS) requirements which need to be treated appropriately. In this paper, we investigate joint rate control and load-balancing routing in LEO satellite networks to tackle the problem of network congestion while considering the QoS requirements of different traffic. The joint rate control and routing problem is formulated with the throughput and end-to-end delay requirements of the traffic taken into consideration. Two routing schemes are considered which differ in whether or not different traffic classes can be assigned different paths. For each routing scheme, the joint rate control and routing problem is formulated. A heuristic algorithm based on simulated annealing is proposed to solve the problems. Besides, a snapshot division method is proposed to increase the connectivity of the network and reduce the number of snapshots by merging the links between satellites and gateways. The simulation results show that compared with methods that perform routing and rate control separately, the proposed algorithm improves the overall throughput of the network and provides better QoS guarantees for different traffic classes.

Broadband amplifiers have been used in modern wireless communication systems. However, the accompanying disadvantage is that there is more nonlinear interference in the available operating frequency band. In addition to the in-band intermodulation distortion which affecting adjacent frequency bands the most important is harmonic distortion. In this letter we present a robust and low complex digital harmonic canceling model called cross-disturbing harmonic (CDH) model for broadband power amplifiers (PAs). The approach introducing cross terms is used to enhance the robustness of the model, thereby significantly increase the stability of the system. The CDH model still has excellent performance when actively reducing the number of coefficients. Comparisons are conducted between the CDH model and the other state-of-the-art model called memory polynomial harmonic (MPM) model. Experimental results show that the CDH model can achieve comparable performance as the MPM model but with much fewer (43%) coefficients.