1-10hit |
Arata KAWAMURA Kensaku FUJII Yoshio ITOH Yutaka FUKUI
A technique that uses a linear prediction error filter (LPEF) and an adaptive digital filter (ADF) to achieve noise reduction in a speech degraded by additive background noise is proposed. It is known that the coefficients of the LPEF converge such that the prediction error signal becomes white. Since a voiced speech can be represented as the stationary periodic signal over a short interval of time, most of voiced speech cannot be included in the prediction error signal of the LPEF. On the other hand, when the input signal of the LPEF is a background noise, the prediction error signal becomes white. Assuming that the background noise is represented as generate by exciting a linear system with a white noise, then we can reconstruct the background noise from the prediction error signal by estimating the transfer function of noise generation system. This estimation is performed by the ADF which is used as system identification. Noise reduction is achieved by subtracting the noise reconstructed by the ADF from the speech degraded by additive background noise.
Jianming LU Hua LIN Xiaoqiu WANG Takashi YAHAGI
Linear adaptive digital filters are applied to various fields for their simplicity in the design and implementation. Considering many kinds of nonlinearities inherent in practical systems, however, nonlinear adaptive filtering will be more desirable. This paper presents a design method for multi-input single-output nonlinear adaptive digital filters using recurrent neural networks. Furthermore, in comparison with this method and the method based on the conventional linear theory, if the proposed method is used, better results can be obtained, and, it is possible that the learning efficiency is improved, because the parallel learning is carried out in this method. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.
Masahide ABE Masayuki KAWAMATA
This paper proposes distributed evolutionary digital filters (EDFs) as an improved version of the original EDF. The EDF is an adaptive digital filter which is controlled by adaptive algorithm based on evolutionary computation. In the proposed method, a large population of the original EDF is divided into smaller subpopulations. Each sub-EDF has one subpopulation and executes the small-sized main loop of the original EDF. In addition, the distributed algorithm periodically selects promising individuals from each subpopulation. Then, they migrate to different subpopulations. Numerical examples show that the distributed EDF has a higher convergence rate and smaller steady-state value of the square error than the LMS adaptive digital filter, the adaptive digital filter based on the simple genetic algorithm and the original EDF.
Dongshik KANG Sigeru OMATU Michifumi YOSHIOKA
Classification of the new and used bills using the spectral patterns of raw time-series acoustic data (observation data) poses some difficulty. This is the fact that the observation data include not only a bill sound, but also some motor sound and noise by a transaction machine. We have already reported the method using adaptive digital filters (ADFs) to eliminate the motor sound and noise. In this paper, we propose an advanced technique to eliminate it by the neural networks (NNs). Only a bill sound is extracted from observation data using prediction ability of the NNs. Classification processing of the new and used bills is performed by using the spectral data obtained from the result of the ADFs and the NNs. Effectiveness of the proposed method using the NNs is illustrated in comparison with former results using ADFs.
Akio HARADA Kiyoshi NISHIKAWA Hitoshi KIYA
A pipelined architecture is proposed for the normalized least mean square (NLMS) adaptive digital filter (ADF). Pipelined implementation of the NLMS has not yet been proposed. The proposed architecture is the first attempt to implement the NLMS ADF in the pipelined fashion. The architecture is based on an equivalent expression of the NLMS derived in this study. It is shown that the proposed architecture achieves a constant and a short critical path without producing output latency. In addition, it retains the advantage of the NLMS, i. e. , that the step size that assures the convergence is determined automatically. Computer simulation results that confirm that the proposed architecture achieves convergence characteristics identical to those of the NLMS.
Akio HARADA Kiyoshi NISHIKAWA Hitoshi KIYA
In this paper, we propose two new pipelined adaptive digital filter architectures. The architectures are based on an equivalent expression of the least mean square (LMS) algorithm. It is shown that one of the proposed architectures achieves the minimum output latency, or zero without affecting the convergence characteristics. We also show that, by increasing the output latency be one, the other architecture can be obtained which has a shorter critical path.
Kiyoshi NISHIKAWA Takuya YAMAUCHI Hitoshi KIYA
In this paper, we consider the selection of analysis filters used in the delayless subband adaptive digital filter (SBADF) and propose to use simple analysis filters to reduce the computational complexity. The coefficients of filters are determined using the components of the first order Hadamard matrix. Because coefficients of Hadamard matrix are either 1 or -1, we can analyze signals without multiplication. Moreover, the conditions for convergence of the proposed method is considered. It is shown by computer simulations that the proposed method can converge to the Wiener filter.
Masahide ABE Masayuki KAWAMATA
In this paper, we compare the performance of evolutionary digital filters (EDFs) for IIR adaptive digital filters (ADFs) in terms of convergence behavior and stability, and discuss their advantages. The authors have already proposed the EDF which is controlled by adaptive algorithm based on the evolutionary strategies of living things. This adaptive algorithm of the EDF controls and changes the coefficients of inner digital filters using the cloning method or the mating method. Thus, the adaptive algorithm of the EDF is of a non-gradient and multi-point search type. Numerical examples are given to demonstrate the effectiveness and features of the EDF such that (1) they can work as adaptive filters as expected, (2) they can adopt various error functions such as the mean square error, the absolute sum error, and the maximum error functions, and (3) the EDF using IIR filters (IIR-EDF) has a higher convergence rate and smaller adaptation noise than the LMS adaptive digital filter (LMS-ADF) and the adaptive digital filter based on the simple genetic algorithm (SGA-ADF) on a multiple-peak surface.
Masahide ABE Masayuki KAWAMATA Tatsuo HIGUCHI
This letter proposes evolutionary digital filters (EDFs) as new adaptive digital filters. The EDF is an adaptive filter which is controlled by adaptive algorithm based on the evolutionary strategies of living things. It consists of many linear/time-variant inner digital filters which correspond to individuals. The adaptive algorithm of the EDF controls and changes the coefficients of inner filters using the cloning method (the asexual reproduction method) or the mating method (the sexual reproduction method). Thus, the search algorithm of the EDF is a non-gradient and multi-point search algorithm. Numerical examples are given to show the effectiveness and features of the EDF such that they are not susceptible to local minimum in the multiple-peak performance surface.
Miwa SAKAI Kiyoharu AIZAWA Mitsutoshi HATORI
An adaptive digital filter with adaptive sampling phase is proposed. The structure of the filter makes use of an adaptive delay device at the input of the filter. The algorithm is derived to determine the value of the delay and the filter coefficients by minimizing MSE (mean square error) between the desired signal and the filter output. The computer simulation of the convergence of the proposed adaptive filter with the input of sinusoidal wave and BPSK modulated wave are shown. According to the simulation, the MSE of the proposed adaptive delay algorithm is lower than that of the conventional LMS algorithm.