Phase interferometer using baseline composed by uniform linear array (ULA) with stable phase center for estimating the angle of arrival (AOA) is always employed in the direction finding (DF) system. However, the phase center of antenna element could vary with the incident angle, frequency, multipath and so on. To deal with these problems, a novel method is proposed in this paper to calibrate the phase center over ultra-wideband (UWB). Meanwhile, the restrictions of this method are discussed. Numerical simulations reveal that higher accuracy and larger unambiguous angle range can be obtained by the proposed method.

As a generalization of perfect nonlinear (PN) functions, zero-difference balanced (ZDB) functions play an important role in coding theory, cryptography and communications engineering. Inspired by a foregoing work of Liu et al. [1], we present a class of ZDB functions with new parameters based on the cyclotomy in finite fields. Employing these ZDB functions, we obtain simultaneously optimal constant composition codes and perfect difference systems of sets.

Satellite broadcasting of 4K/8K ultra-high definition television (UHDTV) was launched in Japan in December 2018. Because this system uses the amplitude and phase shift keying (APSK) modulation scheme, there is a need to improve the non-linear characteristics of the satellite transponders. To meet this requirement, we have been developing a 120-W-class Ku-band solid state power amplifier (SSPA) as a replacement for the currently used traveling wave tube amplifier (TWTA). In this study, we developed a gallium-nitride (GaN) SSPA and linearizer (LNZ). The SSPA achieved an output power of 120W while maintaining a power added efficiency (PAE) of 31%. We evaluated the transmission performance of 16APSK in this SSPA channel in comparison with that in the TWTA channel.

An adaptive bit allocation scheme for zero-forcing (ZF) Tomlinson-Harashima precoding (THP) is proposed. The ZF-THP enables us to achieve feasible bit error rate (BER) performance when appropriate substream permutations are installed at the transmitter. In this study, the number of bits in each substream is adaptively allocated to minimize the average BER in fading environments. Numerical examples are provided to compare the proposed method with eigenbeam space division multiplexing (E-SDM) method.

We research device-free (DF) multi-target tracking scheme in this paper. The existing localization and tracking algorithms are always pay attention to the single target and need to collect a large amount of localization information. In this paper, we exploit the sparse property of multiple target locations to achieve target trace accurately with much less sampling both in the wireless links and the time slots. The proposed approach mainly includes the target localization part and target trace recovery part. In target localization part, by exploiting the inherent sparsity of the target number, Compressive Sensing (CS) is utilized to reduce the wireless links distributed. In the target trace recovery part, we exploit the compressive property of target trace, as well as designing the measurement matrix and the sparse matrix, to reduce the samplings in time domain. Additionally, Kronecker Compressive Sensing (KCS) theory is used to simultaneously recover the multiple traces both of the X label and the Y Label. Finally, simulations show that the proposed approach holds an effective recovery performance.

This letter proposes a novel dynamic channel assignment (DCA) scheme to improve the downlink system capacity in heterogeneous networks (HetNets) with fractional frequency reuse (FFR). In the proposed DCA scheme, the macro base station (MBS) finds small-cell base stations (SBSs) that give strong interference to macro user equipments (MUEs) and then dynamically assigns subchannels to the SBSs to serve their small-cell user equipments (SUEs) according to the cross-tier interference information to MUEs. Through simulation results, it is shown that the proposed DCA scheme outperforms other schemes in terms of the total system capacity.

This paper studies the problem of real-time routing in a multi-autonomous robot enhanced network at uncertain and vulnerable tactical edge. Recent network protocols, such as opportunistic mobile network routing protocols, engaged social network in communication network that can increase the interoperability by using social mobility and opportunistic carry and forward routing algorithms. However, in practical harsh environment such as a battlefield, the uncertainty of social mobility and complexity of vulnerable environment due to unpredictable physical and cyber-attacks from enemy, would seriously affect the effectiveness and practicality of these emerging network protocols. This paper presents a GT-SaRE-MANET (Game Theoretic Situation-aware Robot Enhanced Mobile Ad-hoc Network) routing protocol that adopt the online reinforcement learning technique to supervise the mobility of multi-robots as well as handle the uncertainty and potential physical and cyber attack at tactical edge. Firstly, a set of game theoretic mission oriented metrics has been introduced to describe the interrelation among network quality, multi-robot mobility as well as potential attacking activities. Then, a distributed multi-agent game theoretic reinforcement learning algorithm has been developed. It will not only optimize GT-SaRE-MANET routing protocol and the mobility of multi-robots online, but also effectively avoid the physical and/or cyber-attacks from enemy by using the game theoretic mission oriented metrics. The effectiveness of proposed design has been demonstrated through computer aided simulations and hardware experiments.

In this paper, we consider a hybrid satellite terrestrial cooperative network with a multi-antenna relay where the satellite links follows the shadowed-Rician fading and the terrestrial link undergoes the correlated Rayleigh fading. Specifically, two different channel state information (CSI) assumptions are considered: 1) full CSI at the relay; 2) full CSI of satellite-relay link and statistical CSI of relay-destination link at the relay. In addition, selection combining (SC) or maximal ratio combining (MRC) are used at the destination to combine the signals from direct link and relay link. By considering the above four cases, we derived the closed-form expressions for the outage probability (OP) respectively. Furthermore, the asymptotic OP expressions at high signal-to-noise (SNR) are developed to reveal the diversity orders and the array gains of the considered network. Finally, numerical results are provided to validate our analytical expressions as well as the system performance for different cases.

Energy consumption is one of the important issues in communication networks, and it is expected that network devices such as network interface cards will be turned off to decrease the energy consumption. Moreover, fast failure recovery is an important issue in large-scale communication networks to minimize the impact of failure on data transmission. In order to realize both low energy consumption and fast failure recovery, a method called LE-MRC (Low-Energy based Multiple Routing Configurations) has been proposed. However, LE-MRC can degrade network robustness because some links ports are turned off for reducing the energy consumption. Nevertheless, network robustness is also important for maintaining the performance of data transmission and the network functionality. In this paper, for realizing both low energy consumption and fast failure recovery while maintaining network robustness, we propose Robustness and Low-Energy based Multiple Routing Configurations (RLE-MRC). In RLE-MRC, some links are categorized into unnecessary links, and those links are turned off to lower the energy consumption. In particular, the number of excluded links is determined based on the network robustness. As a result, the energy consumption can be reduced so as not to degrade the network robustness significantly. Simulations are conducted on some network topologies to evaluate the performance of RLE-MRC. We also use ns-3 to evaluate how the performance of data transmission and network robustness are changed by using RLE-MRC. Numerical examples show that the low energy consumption and the fast failure recovery can be achieved while maintaining network robustness by using RLE-MRC.

In millimeter wave (mmWave) vehicular communications, multi-hop relay disconnection by line-of-sight (LOS) blockage is a critical problem, particularly in the early diffusion phase of mmWave-available vehicles, where not all vehicles have mmWave communication devices. This paper proposes a distributed position control method to establish long relay paths through road side units (RSUs). This is realized by a scheme via which autonomous vehicles change their relative positions to communicate with each other via LOS paths. Even though vehicles with the proposed method do not use all the information of the environment and do not cooperate with each other, they can decide their action (e.g., lane change and overtaking) and form long relays only using information of their surroundings (e.g., surrounding vehicle positions). The decision-making problem is formulated as a Markov decision process such that autonomous vehicles can learn a practical movement strategy for making long relays by a reinforcement learning (RL) algorithm. This paper designs a learning algorithm based on a sophisticated deep reinforcement learning algorithm, asynchronous advantage actor-critic (A3C), which enables vehicles to learn a complex movement strategy quickly through its deep-neural-network architecture and multi-agent-learning mechanism. Once the strategy is well trained, vehicles can move independently to establish long relays and connect to the RSUs via the relays. Simulation results confirm that the proposed method can increase the relay length and coverage even if the traffic conditions and penetration ratio of mmWave communication devices in the learning and operation phases are different.

An underdetermined direction of arrival estimation method based on signal sparsity is proposed when independent and coherent signals coexist. Firstly, the estimate of the mixing matrix of the impinging signals is obtained by clustering the single source points which are detected by the ratio of time-frequency transforms of the received signals. Then, each column vector of the mixing matrix is processed by exploiting the forward and backward vectors in turn to obtain the directions of arrival of all signals. The number of independent signals and coherent signal groups that can be estimated by the proposed method can be greater than the number of sensors. The validity of the method is demonstrated by simulations.

Recognizing the different segments of speech belonging to the same speaker is an important speech analysis task in various applications. Recent works have shown that there was an underlying manifold on which speaker utterances live in the model-parameter space. However, most speaker clustering methods work on the Euclidean space, and hence often fail to discover the intrinsic geometrical structure of the data space and fail to use such kind of features. For this problem, we consider to convert the speaker i-vector representation of utterances in the Euclidean space into a network structure constructed based on the local (k) nearest neighbor relationship of these signals. We then propose an efficient community detection model on the speaker content network for clustering signals. The new model is based on the probabilistic community memberships, and is further refined with the idea that: if two connected nodes have a high similarity, their community membership distributions in the model should be made close. This refinement enhances the local invariance assumption, and thus better respects the structure of the underlying manifold than the existing community detection methods. Some experiments are conducted on graphs built from two Chinese speech databases and a NIST 2008 Speaker Recognition Evaluations (SREs). The results provided the insight into the structure of the speakers present in the data and also confirmed the effectiveness of the proposed new method. Our new method yields better performance compared to with the other state-of-the-art clustering algorithms. Metrics for constructing speaker content graph is also discussed.

Zero-effort bilateral authentication was introduced recently to use a trusted wristwear to continuously authenticate a smartphone user. A user is allowed to use the smartphone if both wristwear and smartphone are determined to be held by the same person by comparing the wristwear's motion with the smartphone's input or motion, depending on the grip — which hand holds the smartphone and which hand provides the input. Unfortunately, the scheme has several shortcomings. First, it may work improperly when the user is walking since the gait can conceal the wrist's motions of making touches. Second, it continuously compares the motions of the two devices, which incurs a heavy communication burden. Third, the acceleration-based grip inference, which assumes that the smartphone is horizontal with the ground is inapplicable in practice. To address these shortcomings, we propose WearAuth, wristwear-assisted user authentication for smartphones in this paper. WearAuth applies wavelet-based multi-resolution analysis to extract the desired touch-specific movements regardless of whether the user is stationary or moving; uses discrete Fourier transform-based approximate correlation to reduce the communication overhead; and takes a new approach to directly compute the relative device orientation without using acceleration to infer the grip more precisely. In two experiments with 50 subjects, WearAuth produced false negative rates of 3.6% or less and false positive rates of 1.69% or less. We conclude that WearAuth operates properly under various usage cases and is robust to sophisticated attacks.

Software diversity can be utilized in cyberspace security to defend against the zero-day attacks. Existing researches have proved the effectiveness of diversity in bringing security benefits, but few of them touch the problem that whether there is a positive correlation between the security and the diversity. In addition, there is little guidance on how to construct an effective diversified system. For that, this paper develops two diversity metrics based on system attribute matrix, proposes a diversity measurement and verifies the effectiveness of the measurement. Through several simulations on the diversified systems which use voting strategy, the relationship between diversity and security is analyzed. The results show that there is an overall positive correlation between security and diversity. Though some cases are against the correlation, further analysis is made to explain the phenomenon. In addition, the effect of voting strategy is also discussed through simulations. The results show that the voting strategy have a dominant impact on the security, which implies that security benefits can be obtained only with proper strategies. According to the conclusions, some guidance is provided in constructing a more diversified as well as securer system.

This study designs a low-cost portable device that functions as a coaching assistant system which can support table tennis practice. Although deep learning technology is a promising solution to realizing human activity recognition, we propose using cosine similarity in making inferences. Our experiments show that the cosine similarity based inference can be a good alternative to the deep learning based inference for the assistant system when resources are limited.

In racetrack memories (RM), a position error (insertion or deletion error) results from unstable data reading. For position errors in RM with multiple read-heads (RHs), we propose a protograph-based LDPC coded system specified by a protograph and a protograph-aware permutation. The protograph-aware permutation facilitates the design and analysis of the coded system. By solving a multi-objective optimization problem, the coded system attains the properties of fast convergence decoding, a good decoding threshold, and a linear minimum distance growth. In addition, the coded system can adapt to varying numbers of RHs without any modification. The asymptotic decoding thresholds with a limited number of iterations verify the good properties of the system. Furthermore, for varying numbers of RHs, the simulation results with both small and large number of iterations, exhibit excellent decoding performances, both with short and long block lengths, and without error floors.

In this letter, a polarization filtering based transmission (PFBT) scheme is proposed to enhance the spectrum efficiency in wireless communications. In such scheme, the information is divided into several parts and each is conveyed by a polarized signal with a unique polarization state (PS). Then, the polarized signals are added up and transmitted by the dual-polarized antenna. At the receiver side, the oblique projection polarization filters (OPPFs) are adopted to separate each polarized signal. Thus, they can be demodulated separately. We mainly focus on the construction methods of the OPPF matrix when the number of the separate parts is 2 and 3 and evaluate the performance in terms of the capacity and the bit error rate. In addition, we also discuss the probability of the signal separation when the number of the separate parts is equal or greater than 4. Theoretical results and simulation results demonstrate the performance of the proposed scheme.

In order to solve the influence of scale change on target tracking using the drone, a multi-scale target tracking algorithm is proposed which based on the color feature tracking algorithm. The algorithm realized adaptive scale tracking by training position and scale correlation filters. It can first obtain the target center position of next frame by computing the maximum of the response, where the position correlation filter is learned by the least squares classifier and the dimensionality reduction for color features is analyzed by principal component analysis. The scale correlation filter is obtained by color characteristics at 33 rectangular areas which is set by the scale factor around the central location and is reduced dimensions by orthogonal triangle decomposition. Finally, the location and size of the target are updated by the maximum of the response. By testing 13 challenging video sequences taken by the drone, the results show that the algorithm has adaptability to the changes in the target scale and its robustness along with many other performance indicators are both better than the most state-of-the-art methods in illumination Variation, fast motion, motion blur and other complex situations.

This paper proposes an XOR physical layer network coding (XOR-PLNC) with non-linear precoding for quadrature amplitude modulations (QAMs) in bi-directional MIMO relay systems. The proposed XOR-PLNC applies power loading in order to improve the transmission performance. The proposed XOR-PLNC introduces a modulus adapted to channel gains. Moreover, the modulus is further reduced in cooperation with modulo operation which the non-linear precoding employs for improvement of transmission power efficiency. The use of the reduced modulus improves the energy efficiency of the signal transmission, which improves the transmission performance in the proposed XOR-PLNC. The performance is evaluated by computer simulations in bi-directional MIMO relay channels with 16QAM to 1024QAM.