In this paper, we propose a use of the group sparsity in adaptive learning of second-order Volterra filters for the nonlinear acoustic echo cancellation problem. The group sparsity indicates sparsity across the groups, i.e., a vector is separated into some groups, and most of groups only contain approximately zero-valued entries. First, we provide a theoretical evidence that the second-order Volterra systems tend to have the group sparsity under natural assumptions. Next, we propose an algorithm by applying the adaptive proximal forward-backward splitting method to a carefully designed cost function to exploit the group sparsity effectively. The designed cost function is the sum of the weighted group l₁ norm which promotes the group sparsity and a weighted sum of squared distances to data-fidelity sets used in adaptive filtering algorithms. Finally, Numerical examples show that the proposed method outperforms a sparsity-aware algorithm in both the system-mismatch and the echo return loss enhancement.

This paper deals with the problem of underdetermined blind source separation (BSS) where the number of sources is unknown. We propose a BSS approach that simultaneously estimates the number of sources, separates the sources based on the sparseness of speech, estimates the direction of arrival of each source, and performs permutation alignment. We confirmed experimentally that reasonably good separation was obtained with the present method without specifying the number of sources.

Sparse representation has been studied within the field of signal processing as a means of providing a compact form of signal representation. This paper introduces a sparse representation based framework named Sparse Probabilistic Linear Discriminant Analysis in speaker recognition. In this latent variable model, probabilistic linear discriminant analysis is modified to obtain an algorithm for learning overcomplete sparse representations by replacing the Gaussian prior on the factors with Laplace prior that encourages sparseness. For a given speaker signal, the dictionary obtained from this model has good representational power while supporting optimal discrimination of the classes. An expectation-maximization algorithm is derived to train the model with a variational approximation to a range of heavy-tailed distributions whose limit is the Laplace. The variational approximation is also used to compute the likelihood ratio score of all trials of speakers. This approach performed well on the core-extended conditions of the NIST 2010 Speaker Recognition Evaluation, and is competitive compared to the Gaussian Probabilistic Linear Discriminant Analysis, in terms of normalized Decision Cost Function and Equal Error Rate.

This paper presents a voice conversion (VC) technique for noisy environments, where parallel exemplars are introduced to encode the source speech signal and synthesize the target speech signal. The parallel exemplars (dictionary) consist of the source exemplars and target exemplars, having the same texts uttered by the source and target speakers. The input source signal is decomposed into the source exemplars, noise exemplars and their weights (activities). Then, by using the weights of the source exemplars, the converted signal is constructed from the target exemplars. We carried out speaker conversion tasks using clean speech data and noise-added speech data. The effectiveness of this method was confirmed by comparing its effectiveness with that of a conventional Gaussian Mixture Model (GMM)-based method.

A directional lapped orthogonal transform (DirLOT) is an orthonormal transform of which basis is allowed to be anisotropic with the symmetric, real-valued and compact-support property. Due to its directional property, DirLOT is superior to the existing separable transforms such as DCT and DWT in expressing diagonal edges and textures. The goal of this paper is to enhance the ability of DirLOT further. To achieve this goal, we propose a novel image restoration technique using multiple DirLOTs. This paper generalizes an image denoising technique in [1], and expands the application of multiple DirLOTs by introducing linear degradation operator P. The idea is to use multiple DirLOTs to construct a redundant dictionary. More precisely, the redundant dictionary is constructed as a union of symmetric orthonormal discrete wavelet transforms generated by DirLOTs. To select atoms fitting a target image from the dictionary, we formulate an image restoration problem as an l₁-regularized least square problem, which can efficiently be solved by the iterative-shrinkage/thresholding algorithm (ISTA). The proposed technique is beneficial in expressing multiple directions of edges/textures. Simulation results show that the proposed technique significantly outperforms the non-subsampled Haar wavelet transform for deblurring, super-resolution, and inpainting.

This paper presents a method of synthesizing covariance matrix elements of array input signal for high resolution 2-D Direction-Of-Arrival (DOA) estimation via antenna (sensor) switching. Antenna array generally has the same number of array elements and receiver modules which often leads large receiver hardware cost. Two of the authors have already studied a way of antenna switching to reduce receiver cost, but it can be applied only for periodic incident signals like sinusoid. In this paper, we propose two simple methods of DOA estimation from sparse data by synthesizing covariance matrix elements of array input signal via antenna switching, which can also be applied to DOA estimation of antiperiodic incident signals. Performance of the proposed approach is evaluated in detail through some computer simulation.

We propose a maximum likelihood estimation approach for the recovery of continuously-defined sparse signals from noisy measurements, in particular periodic sequences of Diracs, derivatives of Diracs and piecewise polynomials. The conventional approach for this problem is based on least-squares (a.k.a. annihilating filter method) and Cadzow denoising. It requires more measurements than the number of unknown parameters and mistakenly splits the derivatives of Diracs into several Diracs at different positions. Moreover, Cadzow denoising does not guarantee any optimality. The proposed approach based on maximum likelihood estimation solves all of these problems. Since the corresponding log-likelihood function is non-convex, we exploit the stochastic method called particle swarm optimization (PSO) to find the global solution. Simulation results confirm the effectiveness of the proposed approach, for a reasonable computational cost.

In this paper, online sparse Volterra system identification is proposed. For that purpose, the conventional adaptive projection-based algorithm with weighted l₁ balls (APWL1) is revisited for nonlinear system identification, whereby the linear-in-parameters nature of Volterra systems is utilized. Compared with sparsity-aware recursive least squares (RLS) based algorithms, requiring higher computational complexity and showing faster convergence and lower steady-state error due to their long memory in time-invariant cases, the proposed approach yields better tracking capability in time-varying cases due to short-term data dependence in updating the weight. Also, when N is the number of sparse Volterra kernels and q is the number of input vectors involved to update the weight, the proposed algorithm requires O(qN) multiplication complexity and O(Nlog ₂N) sorting-operation complexity. Furthermore, sparsity-aware least mean-squares and affine projection based algorithms are also tested.

Genetic algorithm (GA) is now an important tool in the field of wireless communications. For multiple-input/multiple-output (MIMO) wireless communications system employing spatial multiplexing transmission, we evaluate the effects of GA parameters value on channel parameters in fading channels. We assume transmit-correlated Rayleigh and Rician fading with realistic Laplacian power azimuth spectrum. Azimuth spread (AS) and Rician K-factor are selected according to the measurement-based WINNER II channel model for several scenarios. Herein we have shown the effects of GA parameters and channel parameters in different WINNER II scenarios (i.e., AS and K values) and rank of the deterministic components. We employ meta GA that suitably selects the population (P), generation (G) and mutation probability (p_m) for the inner GA. Then we show the cumulative distribution function (CDF) obtain experimentally for the condition number C of the channel matrix H. It is found that, GA parameters depend on the channel parameters, i.e., GA parameters are the functions of the channel parameters. It is also found that for the poorer channel conditions smaller GA parameter values are required for MIMO detection. This approach will help to achieve maximum performance in practical condition for the lower numerical complexity.

For quantized control, one of the powerful approaches is to use a dynamic quantizer, which has internal memories for signal quantization, with a conventional controller in the feedback control loop. The design of dynamic quantizers has become a major topic, and a number of results have been derived so far. In this paper, we extend the authors' recent result on dynamic quantizers, and applied them to a more general class of nonlinear systems, called the nonaffine nonlinear systems. Based on the performance index representing the degradation caused by the signal quantization, we propose practical dynamic quantizers, which include the authors' former result as a special case. Moreover, we provide theoretical results on the performance and on the stability of the resulting quantized systems.

Variable-rate linear network codes are investigated in this paper, which are referred to as linear network codes that can support a demanded range of transmission rates on a common netowrk. A new kind of linear network code, called as strict linear broadcast, is defined. Compared with general linear broadcast, it imposes more rigid constraints on the global encoding kernels, but does not require larger finite field size for construction. Then, an efficient scheme is proposed to construct variable-rate linear broadcasts based on the strict linear broadcast. Instead of construcing a fix-rate linear broadcast for each demanded transmission rate, this scheme implements variable-rate linear broadcasts with a single-rate strict linear broadcast. Every node in the network, including the source node, needs to store only one local encoding kernel. When transmission rate varies, the coding operations performed on every network node remain unchanged. Thus, small storage space and no kernel-swithching operations are required on any network code. Furthermore, by combining the strict linear broadcast with a special source-data packetization strategy, a hierarchical broadcast scheme is proposed. With this scheme, multi-rate service can be provided by a single-rate strict linear broadcast to heterogeneous receivers, even at variable transmission rate. Thus, the variable-rate linear broadcasts constructed in this paper are also applicable to the network with heterogeneous receivers.

Vehicles' speed is one of the key factors in vehicle travel efficiency, as speed is related to vehicle travel time, travel safety, fuel consumption, and exhaust gas emissions (e.g., CO₂ emissions). Therefore, to improve the travel efficiency, a recommended speed calculation scheme is proposed to assist driving in Vehicle Ad hoc networks (VANETs) circumstances. In the proposed scheme, vehicles' current speed and space headway are obtained by Vehicle-to-Roadside unit (V2R) communication and Vehicle-to-Vehicle (V2V) communication. Based on the vehicles' current speed and adjacent vehicles' space headway, a recommended speed is calculated by on-board units installed in the vehicles, and then this recommended speed is provided to drivers. The drivers can change their speed to the recommended speed. At the recommended speed, vehicle travel efficiency can be improved: vehicles can arrive at destinations in a shorter travel time with fewer stop times, lower fuel consumption, and less CO₂ emission. In particular, when approaching intersections, vehicles can pass through the intersections with less red light waiting time and a higher non-stop passing rate.

In this paper, Hermite polynomial representation is proposed as an alternative way to represent finite fields of characteristic two. We show that multiplication in Hermite polynomial representation can be achieved with subquadratic space complexity. This representation enables us to find binomial or trinomial irreducible polynomials which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. We then show that the product of two elements in Hermite polynomial representation can be performed as Toeplitz matrix-vector product. This representation is very interesting for NIST recommended binary field GF(2⁵⁷¹) since there is no ONB for the corresponding extension. This representation can be used to obtain more efficient finite field arithmetic.

In this paper, we propose a speech-presence uncertainty estimation to improve the global soft decision-based speech enhancement technique by using the spectral gradient scheme. The conventional soft decision-based speech enhancement technique uses a fixed ratio (Q) of the a priori speech-presence and speech-absence probabilities to derive the speech-absence probability (SAP). However, we attempt to adaptively change Q according to the spectral gradient between the current and past frames as well as the status of the voice activity in the previous two frames. As a result, the distinct values of Q to each frequency in each frame are assigned in order to improve the performance of the SAP by tracking the robust a priori information of the speech-presence in time.

The optimal design of an extrapolated impulse response (EIR) filter (in the mini-max sense) is a non-linear programming problem. In this paper, the optimal design of the EIR filter by the semi-infinite programming (SIP) is investigated and an iterative technique for optimally designing the EIR filter is proposed. The simulation experiment validates the effectiveness of the SIP technique and the proposed iterative technique in the optimal design of the EIR filter.

In this letter, we consider the global exponential stabilization problem by output feedback for a class of nonlinear systems. Along with a newly proposed matrix inequality condition, the proposed control method has improved flexibility in dealing with nonlinearity, over the existing methods. Analysis and examples are given to illustrate the improved features of our control method.

Quantum steganography is to send secret quantum information through a quantum channel, such that an unauthorized user will not be aware of the existence of secret data. The depolarizing channel can hide quantum information by disguising it as channel errors of a quantum error-correcting code. We improve the efficiency of quantum steganography with noisy depolarizing channels, by modifying the twirling procedure and adding quantum teleportation. The proposed scheme not only meets the requirements of quantum steganography but also has higher efficiency.

Binary sequences with low autocorrelation have important applications in communication systems and cryptography. In this paper, the autocorrelation values of binary Whiteman generalized cyclotomic sequences of order six and period pq are discussed. Our result shows that the autocorrelation of these sequences is four-valued and that the corresponding values are in {-1,3,-5,pq} if the parameters are chosen carefully.

This paper contributes to k-error linear complexity of some generalized cyclotomic binary sequences of length 2p^m and p^m constructed in recent years. By defining related reference sequences, we find that these sequences possess very low k-error linear complexity for some certain values of the parameter k even though they have high linear complexity. Moreover, we point out that (p-1)-tuple distributions of all these sequences are not span. Thus they should be selected carefully for use in stream cipher systems.

The outage performance of a multiuser two-way amplify-and-forward (AF) relaying network, where N-th best selection scheme with the consideration to the feedback delay, is investigated. Specifically, the new closed-form expressions for cumulative distribution function (CDF) and outage probability (OP) are presented over time varying Rayleigh-fading channels. Furthermore, simple approximate OP is derived assessing the high signal-to-noise-ratio (SNR), which identifies the diversity behavior. Numerical results show excellent agreement with theoretical results.

This letter deals with blind carrier frequency offset estimation by exploiting the minimum variance distortionless response (MVDR) criterion for interleaved uplink orthogonal frequency division multiple access (OFDMA). It has been shown that the complexity and estimation accuracy of MVDR strictly depend on the grid size used during the search. For the purpose of efficient estimation, we present an improved polynomial rooting estimator that is robust in low signal-to-noise ratio scenario. Simulation results are provided for illustrating the effectiveness of the proposed estimator.

In this letter, a fast transmit antenna selection algorithm is proposed for the spatial-temporal combining-based spatial multiplexing ultra-wideband systems on a log-normal multipath fading channel. The presented suboptimum algorithm selects the transmit antennas associated with the largest signal to noise ratio value computed by one QR decomposition operation of the full channel matrix spatially and temporally combined. It performs the iterative channel scaling operation about the channel matrix and singular value decomposition about the channel scaled matrix. It is shown that the proposed antenna selection algorithm leads to a substantial improvement in the error performance while keeping low-complexity, and obtains almost the same error performance as the exhaustive search-based optimal antenna selection algorithm.

In this paper, we propose a novel multi-frame image denoising technique, which achieves the minimum variance of noise. Zero-mean and unknown variance white noise with an arbitrary distribution is considered in this paper. The proposed method consists of two parts. The first one is the estimation of the variance of noise for each image by considering the differences of all pairs of images. The second one is an actual denoising process in which the convex combination of all images with weight coefficients determined by the estimated variances is constructed. We also give an efficient algorithm by which we can obtain the same result by successive convex combinations. The efficacy of the proposed method is confirmed by computer simulations.