Closed-loop power control in the reverse link of a DS/CDMA system is analysed. The transmitter/receiver based on IS-95 and the radio propagation channel under mobile communication environments are modelled and a new p...
详细信息
Closed-loop power control in the reverse link of a DS/CDMA system is analysed. The transmitter/receiver based on IS-95 and the radio propagation channel under mobile communication environments are modelled and a new power control algorithm is proposed. This algorithm utilises the burst error characteristics of the channel and can be directly applied to the current IS-95 system. The new power control algorithm. with respect to the SIR (signal to interference ratio), increases;he service quality, and finally, enhances the system capacity.
The application of an innovations-based detection algorithm (IBDA) in moving target detector (MTD) radars has been shown to be efficient. In this correspondence, an adaptive algorithm for the IBDA is derived. This alg...
详细信息
The application of an innovations-based detection algorithm (IBDA) in moving target detector (MTD) radars has been shown to be efficient. In this correspondence, an adaptive algorithm for the IBDA is derived. This algorithm behaves well in numerical properties and computational complexity. Also, it possesses high computing parallelism and data locality which lead to the feasibility of VLSI array realization. A systolic array is designed with the iteration time being (2n + 1) and the number of processing elements being [(n2 + 3n)/2], where n is the length of the adaptive filter.
This correspondence studies the effect of a nonzero delay on the performance of the leaky LMS algorithm, The stability bound on the stepsize is derived for error convergence, It is shown that leakage allows for larger...
详细信息
This correspondence studies the effect of a nonzero delay on the performance of the leaky LMS algorithm, The stability bound on the stepsize is derived for error convergence, It is shown that leakage allows for larger bounds on the step size of the delayed LMS algorithm, Theoretical bounds are verified by simulations.
The transient and steady-state weight correlation statistics of both the real and complex LMS adaptive filters are obtained when the inputs are independent samples from real and circularly Gaussian processes, respecti...
详细信息
The transient and steady-state weight correlation statistics of both the real and complex LMS adaptive filters are obtained when the inputs are independent samples from real and circularly Gaussian processes, respectively. A matrix relationship is derived between the covariance matrix of the weight vector at two different times and the covariance matrix of the weights at one time. These expressions show that the weight fluctuations have the same time constants as the mean behavior of the LMS algorithm itself (i.e., the weights are correlated over the same number of iterations that it takes for the algorithm to converge to the Wiener weights for stationary inputs).
A simple algorithm is presented and investigated for adaptively steering the broad-band null in a two-element power inversion array which employs a tapped delay line filter as the processing element. Basically, by per...
详细信息
A simple algorithm is presented and investigated for adaptively steering the broad-band null in a two-element power inversion array which employs a tapped delay line filter as the processing element. Basically, by performing a simple signal trasformation, the algorithm constrains some of the filter weights so that a variable lenght delay line is being approximated in the maximally flat sense. By using the least mean square (LMS) algorithm to adjust the weights controlling the length and gain of the delay line, a broad-band null is then adaptively formed to track and reject the broad-band jammer. As studied analytically and by using simulation results, the convergence begavior of the algorithm is fast and depends only on the tolerable level of misadjustment noise. Yet, its implementation complexity is comparable to that of using the LMS algorithm directly.
A new adaptive algorithm for noise subspace estimation and tracking that is based on Rayleigh's quotient is proposed. The algorithm has a number of interesting properties such as low computational complexity and g...
详细信息
A new adaptive algorithm for noise subspace estimation and tracking that is based on Rayleigh's quotient is proposed. The algorithm has a number of interesting properties such as low computational complexity and good numerical stability. It can have many applications, in particular, in digital signal processing and communications.
In this letter, we propose a new adaptive algorithm for the generalized symmetric eigenvalue problem, which can extract the principal and minor generalized eigenvectors, as well as their corresponding subspaces, at a ...
详细信息
In this letter, we propose a new adaptive algorithm for the generalized symmetric eigenvalue problem, which can extract the principal and minor generalized eigenvectors, as well as their corresponding subspaces, at a low computational cost. A comparison with other adaptive algorithms from the literature, including the batch generalized singular value decomposition (GSVD) technique, is also given to show the superiority of the proposed algorithm in terms of convergence performance and computational complexity.
By using an adaptive algorithm, we design a single-chip Viterbi decoder for a rate 1/2 binary convolutional code. The adaptive algorithm is realized by threshold checking at each stage. The survivor paths that are les...
详细信息
By using an adaptive algorithm, we design a single-chip Viterbi decoder for a rate 1/2 binary convolutional code. The adaptive algorithm is realized by threshold checking at each stage. The survivor paths that are less likely are ignored and hence the number of states at each decoding stage to be computed is reduced significantly in comparison with the conventional Viterbi decoder. Therefore, the decoding speed can be increased. A single-chip hard-decision decoder for a rate 1/2 convolutional code with constraint length K=6 (64 states) has been fabricated in 1.2 mu m CMOS technology. Experimental results show that this improved algorithm can achieve a data throughput rate about 3 times faster than that using a conventional algorithm without sacrificing the decoding reliability.
We present a new nongradient algorithm that has reduced adaptive filter weight fluctuations caused by high variance input data. The algorithm adapts a single weight at each time step and has approximately the same com...
详细信息
We present a new nongradient algorithm that has reduced adaptive filter weight fluctuations caused by high variance input data. The algorithm adapts a single weight at each time step and has approximately the same computational requirements as the LMS algorithm.
A parallel-type adaptive algorithm is proposed which utilizes the fast least-squares method. Its computational complexity is much less than that of L. Landau's (1978) method, which is based on hyperstability theor...
详细信息
A parallel-type adaptive algorithm is proposed which utilizes the fast least-squares method. Its computational complexity is much less than that of L. Landau's (1978) method, which is based on hyperstability theory Hyperstability requires much computation because it involves matrix operations. The proposed method has nothing to do with hyperstability. It is also shown theoretically and using computer simulation, that the convergence performance of the proposed method is better than that of the series-parallel-type fast least-squares method.< >
暂无评论