This paper proposes a directional noise suppressor with a specified constant beamwidth for directional interferences and diffuse noise. A directional gain is calculated based on interchannel phase difference and combined with a spectral gain commonly used in single-channel noise suppressors. The beamwidth can be specified as passband edges of the directional gain. In order to implement frequency-independent constant beamwidth, frequency-proportionate directional gains are defined for different frequencies as a constraint. Evaluation with signals recorded by a commercial PC demonstrates good agreement between the theoretical and the measured directivity. The signal-to-noise ratio improvement and the PESQ score for the enhanced signal are improved by 24.4dB and 0.3 over a conventional noise suppressor. In a speech recognition scenario, the proposed directional noise suppressor outperforms both the conventional nondirectional noise suppressor and the conventional directional noise suppressor based on phase based T/F filtering with a negligible degradation in the word error rate for clean speech.

This paper mainly discusses the time-difference-of-arrival (TDOA) estimation problem of digital modulation signal under impulsive noise and cochannel interference environment. Since the conventional TDOA estimation algorithms based on the second-order cyclic statistics degenerate severely in impulsive noise and the TDOA estimation algorithms based on correntropy are out of work in cochannel interference, a novel signal-selective algorithm based on the generalized cyclic correntropy is proposed, which can suppress both impulsive noise and cochannel interference. Theoretical derivation and simulation results demonstrate the effectiveness and robustness of the proposed algorithm.

This paper proposes a stereo wind-noise suppressor with frequency-domain noise averaging. A directional gain for diffuse wind noise is estimated frame by frame using a null beamformer based on interchannel phase difference which blocks the target signal. The wind-noise gain estimate is commonly multiplied by the input noisy signal to generate channel dependent wind noise estimates in order to cope with interchannel wind-noise imbalance. Interchannel phase agreement by target signal dominance or incidentally equal wind-noise phase, which leads to underestimation, is offset by averaging channel dependent wind-noise estimates along frequency. Evaluation results show that the mean PESQ score by the proposed wind-noise suppressor reaches 2.1 which is 0.2 higher than that by the wind-noise suppressor without averaging and 0.3 higher than that by a conventional monaural-noise suppressor with a statistically significant difference.

A wind-noise suppressor with SNR based wind-noise detection and speech-wind discrimination is proposed. Wind-noise detection is performed in each frame and frequency based on the power ratio of the noisy speech and an estimated stationary noise. The detection result is modified by speech presence likelihood representing spectral smoothness to eliminate speech components. To suppress wind noise with little speech distortion, spectral gains are made smaller in the frame and the frequency where wind-noise is detected. Subjective evaluation results show that the 5-grade MOS for the proposed wind-noise suppressor reaches 3.4 and is 0.56 higher than that by a conventional noise suppressor with a statistically significant difference.

Dual-motor driving servo systems are widely used in many military and civil fields. Since backlash nonlinearity affects the dynamic performance and steady-state tracking accuracy of these systems, it is necessary to study a control strategy to reduce its adverse effects. We first establish the state-space model of a system. To facilitate the design of the controller, we simplify the model based on the state-space model. Then, we design an adaptive controller combining a projection algorithm with dynamic surface control applied to a dual-motor driving servo system, which we believe to be the first, and analyze its stability. Simulation results show that projection algorithm-based dynamic surface control has smaller tracking error, faster tracking speed, and better robustness and stability than mere dynamic surface control. Finally, the experimental analysis validates the effectiveness of the proposed control algorithm.

Reproducing quadruped locomotion from an engineering viewpoint is important not only to control robot locomotion but also to clarify the nonlinear mechanism for switching between locomotion patterns. In this paper, we reproduced a quadruped locomotion pattern, gallop, using a central pattern generator (CPG) hardware network based on the abelian group Z₄×Z₂, originally proposed by Golubitsky et al. We have already used the network to generate three locomotion patterns, walk, trot, and bound, by controlling the voltage, E_MLR, inputted to all CPGs which acts as a signal from the midbrain locomotor region (MLR). In order to generate the gallop and canter patterns, we first analyzed the network symmetry using group theory. Based on the results of the group theory analysis, we desymmetrized the contralateral couplings of the CPG network using a new parameter in addition to E_MLR, because, whereas the walk, trot, and bound patterns were able to be generated from the spatio-temporal symmetry of the product group Z₄×Z₂, the gallop and canter patterns were not. As a result, using a constant element $hat{kappa}$ on Z₂, the gallop and canter locomotion patterns were generated by the network on ${f Z}_4+hat{kappa}{f Z}_4$, and actually in this paper, the gallop locomotion pattern was generated on the actual circuit.

The Jacobi-Davidson method and the Riccati method for eigenvalue problems are studied. In the methods, one has to solve a nonlinear equation called the correction equation per iteration, and the difference between the methods comes from how to solve the equation. In the Jacobi-Davidson/Riccati method the correction equation is solved with/without linearization. In the literature, avoiding the linearization is known as an improvement to get a better solution of the equation and bring the faster convergence. In fact, the Riccati method showed superior convergence behavior for some problems. Nevertheless the advantage of the Riccati method is still unclear, because the correction equation is solved not exactly but with low accuracy. In this paper, we analyzed the approximate solution of the correction equation and clarified the point that the Riccati method is specialized for computing particular solutions of eigenvalue problems. The result suggests that the two methods should be selectively used depending on target solutions. Our analysis was verified by numerical experiments.

The QC-MDPC McEliece scheme was considered one of the most promising public key encryption schemes for efficient post-quantum secure encryption. As a variant of the McEliece scheme, it is based on the syndrome decoding problem, which is a hard problem from Coding Theory. Its key sizes are competitive with the ones of the widely used RSA cryptosystem, and it came with an apparently strong security reduction. For three years, the scheme has not suffered major threats, until the end of 2016, at the Asiacrypt, when Guo, Johansson, and Stankovski presented a reaction attack on the QC-MDPC that exploits one aspect that was not considered in the security reduction: the probability of a decoding failure to occur is lower when the secret key and the error used for encryption share certain properties. Recording the decoding failures, the attacker obtains information about the secret key and then use the information gathered to reconstruct the key. Guo et al. presented an algorithm for key reconstruction for which we can point two weaknesses. The first one is that it cannot deal with partial information about the secret key, resulting in the attacker having to send a large number of decoding challenges. The second one is that it does not scale well for higher security levels. To improve the attack, we propose a key reconstruction algorithm that runs faster than Guo's et al. algorithm, even using around 20% less interactions with the secret key holder than used by their algorithm, considering parameters suggested for 80 bits of security. It also has a lower asymptotic complexity which makes it scale much better for higher security parameters. The algorithm can be parallelized straightforwardly, which is not the case for the one by Guo et al.

Differential microphone arrays have been widely used in hands-free communication systems because of their frequency-invariant beampatterns, high directivity factors and small apertures. Considering the position of acoustic source always moving within a certain range in real application, this letter proposes an approach to construct the steerable first-order differential beampattern by using four omnidirectional microphones arranged in a non-orthogonal circular geometry. The theoretical analysis and simulation results show beampattern constructed via this method achieves the same direction factor (DF) as traditional DMAs and higher white noise gain (WNG) within a certain angular range. The simulation results also show the proposed method applies to processing speech signal. In experiments, we show the effectiveness and small computation amount of the proposed method.

In this letter, a new semi-blind approach incorporating the bounded nature of communication sources with the distance between the equalizer outputs and the training sequence is proposed. By utilizing the sparsity property of l₁-norm cost function, the proposed algorithm can outperform the semi-blind method based on higher-order statistics (HOS) criterion especially for transmitting sources with non-constant modulus. Experimental results demonstrate that the proposed method shows superior performance over the HOS based semi-blind method and the classical training-based method for QPSK and 16QAM sources equalization. While for 64QAM signal inputs, the proposed algorithm exhibits its superiority in low signal-to-noise-ratio (SNR) conditions compared with the training-based method.

In compressed sensing, most previous researches have studied the recovery performance of a sparse signal x based on the acquired model y=Φx+n, where n denotes the noise vector. There are also related studies for general perturbation environment, i.e., y=(Φ+E)x+n, where E is the measurement perturbation. IHT and HTP algorithms are the classical algorithms for sparse signal reconstruction in compressed sensing. Under the general perturbations, this paper derive the required sufficient conditions and the error bounds of IHT and HTP algorithms.

This letter proposes a track before detect scheme embedded in coherent repeated interference with the aid of frequency diversity array. The unmatched properties between echo and interferences are firstly discussed from both signal processing and data processing standpoints. Afterward, the interference suppression algorithm with virtual channel weighting at continue sampling stage is proposed, followed with kinematics constraint correspondingly. Further, the evaluations of the interference suppression performance are carried out through simulations which illustrate the feasibility and validity of the proposed algorithm.

The present Letter proposes a design procedure for inducing synchronization in delayed-coupled one-dimensional map networks. We assume the practical situation where the connection delay, the detailed information about the network topology, and the number of the maps are unknown in advance. In such a situation, it is difficult to guarantee the stability of synchronization, since the local stability of a synchronized manifold is equivalent to that of a linear time-variant system. A sufficient condition in robust control theory helps us to derive a simple design procedure. The validity of our design procedure is numerically confirmed.

In an approximately synchronized (AS) code-division multiple-access (CDMA) communication system, zero correlation zone (ZCZ) sequences can be used as its spreading sequences so that the system suppresses multiple access interference (MAI) and multi-path interference (MPI) fully and synchronously. In this letter, the mutually orthogonal (MO) ZCZ polyphase sequence sets proposed by one of the authors are improved, and the resultant ZCZ sequences in each set arrive at the theoretical bound regarding ZCZ sequences under some conditions. Therefore, the improved MO ZCZ sequence sets are optimal.

Zero-difference balanced (ZDB) functions, which have many applications in coding theory and sequence design, have received a lot of attention in recent years. In this letter, based on two known classes of ZDB functions, a new class of ZDB functions, which is defined on the group (Z_2^e-1×Z_n,+) is presented, where e is a prime and n=p₁^m₁p₂^m₂…p_k^m_k, p_i is odd prime satisfying that e|(p_i-1) for any 1≤i≤k . In the case of gcd(2^e-1,n)=1, the new constructed ZDB functions are cyclic.

In this paper, we study self-dual cyclic codes of length n over the ring R=Z₄[u]/<u²-1>, where n is an odd positive integer. We define a new Gray map φ from R to Z₄². It is a bijective map and maintains the self-duality. Furthermore, we give the structures of the generators of cyclic codes and self-dual cyclic codes of odd length n over the ring R. As an application, some self-dual codes of length 2n over Z₄ are obtained.

To track the players and shuttlecock in broadcast badminton video is a challenge, especially for tracking the small size and fast moving shuttlecock. There are many situations that may cause occlusion or misdetection. In this paper, a method is proposed to track players and shuttlecock in broadcast badminton videos. We apply adaptive Kalman filter, trajectory confidence estimation and confidence-update (Location Similarity and Relative Motion Relation, RMR) to improve the accuracy of object trajectories. In our experiments, the proposed method significantly enhance the tracking success rate of players and shuttlecock.