This paper deals with the design of a broad class of 2-D recursive digital filters including general fan, diamond and elliptically-symmetric filters. At first, the explicit design of quadrant and +/- 45-degrees fan fi...
详细信息
This paper deals with the design of a broad class of 2-D recursive digital filters including general fan, diamond and elliptically-symmetric filters. At first, the explicit design of quadrant and +/- 45-degrees fan filters is reviewed. A full-plane diamond filter (both axes are nearly of length 2 pi) can easily be obtained through an appropriate transformation of a +/- 45-degrees fan filter. Using this diamond filter as a prototype, a very simple spectral transformation is then proposed to design full-plane circularly-symmetric filters (radius almost-equal-to pi). These filters share the same lattice wave digital structure and employ only first or second order all-pass sections which can be realized by two-port adaptors. They provide very desirable properties such as low sensitivity, high dynamic range and good stability even under finite arithmetic conditions. Using the above mentioned filters as prototypes, a multirate approach is then introduced to deal with the design of fan filters with arbitrary angle and orientation, diamond and elliptically-symmetric filters with arbitrary length of axes. Finally, some design examples are given.
We describe the parallel implementation of fully recurrent neural networks (RRN) on a transputer-based multiprocessor system. To train the RNN, the real-time recurrent learning (RTRL) algorithm was used. The computati...
详细信息
We describe the parallel implementation of fully recurrent neural networks (RRN) on a transputer-based multiprocessor system. To train the RNN, the real-time recurrent learning (RTRL) algorithm was used. The computationally intensive sequential RTRL algorithm has been transformed to an equivalent parallel algorithm, realized in a ring topology that can be matched to a variety of target architectures, ranging from application specific VLSI arrays to general purpose multiprocessor systems. A ring array of up to 19 T800 transputers was programmed to efficiently perform the parallel RTRL algorithm. The speedup of the transputer implementation was estimated both analytically and through simulations, and the effect of the communication overhead is discussed. It is shown that as more neuron units are allocated to the same processor the efficiency is increased.
In this brief paper, the Real Time Recurrent Learning (RTRL) algorithm for training fully recurrent neural networks in real time, is extended for the case of a recurrent neural network whose inputs, outputs, weights a...
详细信息
In this brief paper, the Real Time Recurrent Learning (RTRL) algorithm for training fully recurrent neural networks in real time, is extended for the case of a recurrent neural network whose inputs, outputs, weights and activation functions are complex. A practical definition of the complex activation function is adopted and the complex form of the conventional RTRL algorithm is derived. The performance of the proposed algorithm is demonstrated with an application in complex communication channel equalization.
In this paper we address the problem of reconstruction of signals from their nonequally spaced samples. Exploiting the close-to-band structure of the composing matrix, a two-stage procedure for the recovery of uniform...
详细信息
In this paper we address the problem of reconstruction of signals from their nonequally spaced samples. Exploiting the close-to-band structure of the composing matrix, a two-stage procedure for the recovery of uniform samples from nonuniform samples has been suggested by Plotkin and Swamy (1987). In order to reduce the computational complexity, a special procedure of partitioning the composing matrix into a set of overlapping submatrices was used. Then the error in the estimate was reduced by applying an iterative procedure. The present paper is an extension of results presented by Plotkin and Swamy (1987). In this we propose a modification to their procedure, so as to recover an equal number of uniformly spaced samples as are those in the nonuniform set. We show that the iterative algorithm converges conditionally and the conditions are weak and may be implemented easily. computer simulation results have been presented which show that the proposed technique performs well even for deviations of nonuniform sample positions well beyond the corresponding uniform positions. The proposed method is attractive from computational point of view also.
A two-stage multiuser detector for the code division multiple access environment employing a combination of a decorrelator and a nonlinear multiuser interference canceler is considered. The weights of the canceler are...
详细信息
The known eigendecomposition-based subspace techniques for parameter estimation of multiple signals in additive white noise or the directions of arrivals of wavefronts at an array of sensors use either the information...
Obtaining a satisfactory precision on estimates of low bit error rates (BER's) in digital communication systems using the conventional Monte Carlo (MC) method can be a prohibitive task due to long run time. While ...
详细信息
Obtaining a satisfactory precision on estimates of low bit error rates (BER's) in digital communication systems using the conventional Monte Carlo (MC) method can be a prohibitive task due to long run time. While maintaining the same precision, importance sampling (IS) techniques can substantially reduce this run time using MC simulation. To obtain these speed-up factors, the IS parameters specifying the simulation probability density function (pdf) must be carefully chosen. The authors present an IS technique for the efficient simulation of baseband communication systems characterized by a static channel and a recursive least square (RLS) linear adaptive equalizer in the presence of additive white Gaussian noise (AWGN). This IS technique is based on a stochastic gradient descent (SGD) optimisation algorithm. Speed-up factors of 6 to 9 orders of magnitude over conventional the MC method were attained for error probabilities in the range of 10/sup -6/ to 10/sup -9/.< >
In this paper, we introduce two new types of local instabilities which exclusively pertain to a linear time-varying (LTV) system. Investigation of these local instabilities has lead to new necessary and sufficient con...
详细信息
In this paper, we introduce two new types of local instabilities which exclusively pertain to a linear time-varying (LTV) system. Investigation of these local instabilities has lead to new necessary and sufficient conditions for a LTV system to be globally stable. It is shown that a direct extension of the stability conditions of a linear time-invariant (LTI) system is not applicable to a LTV system. The admissible area for a set of coefficients of a globally stable LTV system has been established and this area is found to be much larger than its LTI system counterpart.
The necessity for an efficient bit-reversal routine in the implementation of fast discrete Fourier transform algorithms is well known. In this paper, we propose a bit-reversal algorithm that reduces the computational ...
详细信息
The necessity for an efficient bit-reversal routine in the implementation of fast discrete Fourier transform algorithms is well known. In this paper, we propose a bit-reversal algorithm that reduces the computational effort to an extent that it becomes negligible compared with the data swapping operation for which the bit-reversal is required.< >
The problem of scheduling interference-free transmissions with maximum throughput in a multi-hop radio network is NP-complete. The computational complexity becomes intractable as the network size increases. In this pa...
详细信息
The problem of scheduling interference-free transmissions with maximum throughput in a multi-hop radio network is NP-complete. The computational complexity becomes intractable as the network size increases. In this paper, the scheduling is formulated as a combinatorial optimization problem. An efficient neural network approach, namely, mean field annealing, is applied to obtain optimal transmission schedules. Numerical examples show that this method is capable of finding an interference-free schedule with (almost) optimal throughput.< >
暂无评论