A nonasymptotic performance comparison is presented between the Min-Norm and MUSIC algorithms for estimating the directions of arrival of narrowband plane waves impinging on an array of sensors. The analysis is based ...
详细信息
A nonasymptotic performance comparison is presented between the Min-Norm and MUSIC algorithms for estimating the directions of arrival of narrowband plane waves impinging on an array of sensors. The analysis is based on a finite amount of sensor data. The analysis makes the assumption of high signal-to-noise ratio (SNR), and it applies to arrays of arbitrary geometry. It is shown that Min-Norm can be expressed as a certain data-dependent weighted MUSIC algorithm, and that this relationship allows a unified performance comparison. It is also shown that the variances of the estimated directions-of-arrival from the MUSIC algorithm are always smaller than those of the Min-Norm algorithm at high SNR when both algorithms employ a numerical search procedure to obtain the estimates.< >
A novel, numerically efficient algorithm to find all the solutions to load flow equations is presented in this paper. This algorithm is based on the analysis of the topological structures of the solution set defined b...
详细信息
A novel, numerically efficient algorithm to find all the solutions to load flow equations is presented in this paper. This algorithm is based on the analysis of the topological structures of the solution set defined by the parameterized load flow equation. It is found that the load flow solutions are connected by one-dimension manifolds (curves) to form a connected graph. All the load flow solutions can be found by tracing these curves. The significance of this algorithm is that it can be guaranteed to find all the solutions while reducing the amount of computations to the point that this task can be attempted on real power systems. Results on two example systems are provided to demonstrate the numerical performances of the algorithm and to provide a comparison with the currently available method.
The convergence properties of an adaptive linear mean-square estimator that uses a modified LMS algorithm are established for generally dependent processes. Bounds on the mean-square error of the estimates of the filt...
详细信息
The convergence properties of an adaptive linear mean-square estimator that uses a modified LMS algorithm are established for generally dependent processes. Bounds on the mean-square error of the estimates of the filter coefficients and on the excess error of the estimate of the signal are derived for input processes which are either strong mixing or asymptotically uncorrelated. It is shown that the mean-square deviation is bounded by a constant multiple of the adaptation step size and that the same holds for the excess error of the signal estimation. The present findings extend earlier results in the literature obtained for independent and M-dependent input data.< >
This paper addresses the problem of Radio Access Technology (RAT) selection in heterogeneous multiaccess/multiservice scenarios. For such purpose, a Markov model is proposed to compare the performance of various RAT s...
详细信息
This paper addresses the problem of Radio Access Technology (RAT) selection in heterogeneous multiaccess/multiservice scenarios. For such purpose, a Markov model is proposed to compare the performance of various RAT selection policies within these scenarios. The novelty of the approach resides in the embedded definition of the aforementioned RAT selection policies within the Markov chain. In addition, the model also considers the constraints imposed by those users with terminals that only support a subset of all the available RATS (i.e., multimode terminal capabilities). Furthermore, several performance metrics may be measured to evaluate the behavior of the proposed RAT selection policies under varying offered traffic conditions. In order to illustrate the validation and suitability of the proposed model, some examples of operative radio access networks are provided, including the GSM/EDGE Radio Access Network (GERAN) and the UMTS Radio Access Network (UTRAN), as well as several service-based, load-balancing, and terminal-driven RAT selection strategies. The flexibility exhibited by the presented model enables to extend these RAT selection policies to others responding to diverse criteria. The model is successfully validated by means of comparing the Markov model results with those of system-level simulations.
An algorithm for computing length-2/sup M/ discrete Fourier transforms (DFTs), called the split-radix FFT, has recently been developed. The split-radix algorithm has fewer multiplies than the radix-8 Cooley-Tukey algo...
详细信息
An algorithm for computing length-2/sup M/ discrete Fourier transforms (DFTs), called the split-radix FFT, has recently been developed. The split-radix algorithm has fewer multiplies than the radix-8 Cooley-Tukey algorithm, and many fewer additions that the minimum-multiply algorithms. It is shown that it involves significantly more butterfly computations than the radix-4 Cooley-Tukey algorithms which have butterflies of similar complexity. Consequently, the split-radix algorithm is advantageous for hardware in which a multiplier/accumulator is the basic processor, as might be the case with some VLSI implementations. In addition, the split-radix algorithm has varying numbers of butterflies in successive stages, complicating the design of efficient multiprocessor implementations. A few simple strategies for balancing the computational load among the stages are considered, and their average efficiencies are computed.< >
A block interconnection algorithm for a general cell VLSI is described, which consists of a number of procedures such as a global router with signal delays taken into account, a router for power and ground, a block po...
详细信息
A block interconnection algorithm for a general cell VLSI is described, which consists of a number of procedures such as a global router with signal delays taken into account, a router for power and ground, a block positioning scheme to minimize the chip size, a channel construction scheme with the use of L-shaped channels, and a grid-free channel router. The algorithm has been employed in a layout design system SMILE for general cell VLSI's for more than one year. Some of the experimental results are also shown.
The goal in designing an ionospheric time-delay correctionalgorithm for the single-frequency global positioning system userwas to include the main features of the complex behavior of theionosphere, yet require a minim...
详细信息
The goal in designing an ionospheric time-delay correctionalgorithm for the single-frequency global positioning system userwas to include the main features of the complex behavior of theionosphere, yet require a minimum of coefficients and usercomputational time, while still yielding an rms correction of at least50 percent. The algorithmdesigned for this purpose, andimplemented in the GPS satellites, requires only eight coefficientssent as part of the satellite message, contains numerousapproximations designed to reduce user computationalrequirements, yet preserves the essential elements required to obtaingroup delay values along multiple satellite viewing directions.
In this paper, noniterative algorithms for the nonlinear image restoration problem are investigated. A general, nonlinear image formation model is considered in conjunction with a minimum-mean-square-error (MMSE) rest...
详细信息
In this paper, noniterative algorithms for the nonlinear image restoration problem are investigated. A general, nonlinear image formation model is considered in conjunction with a minimum-mean-square-error (MMSE) restoration approach. In the special case of a logarithmic nonlinearity, the optimal estimator is analytically derived within the class of algorithms that involve the inverse of the system's nonlinearity, followed by a linear transformation. This class of estimators is initiated by the nonlinear pseudo-inverse solution. The introduction of a combined-objective-function approach compensates for the stationarity assumption, incorporating both spatial and spectral information in the nonlinear MMSE algorithm. This approach results in an adaptive algorithm, which adjusts its performance with respect to the detailed structure of the image. The nonlinear restoration algorithms introduced are demonstrated through examples.
In this paper, we study the convergence analysis of fractionally spaced adaptive blind equalizers. We show that based on the trivial and nontrivial nullspaces of a channel convolution matrix, all equilibria can be cla...
详细信息
In this paper, we study the convergence analysis of fractionally spaced adaptive blind equalizers. We show that based on the trivial and nontrivial nullspaces of a channel convolution matrix, all equilibria can be classified as channel dependent equilibria (CDE) or algorithm dependent equilibria (ADE). Because oversampling provides channel diversity, the nullspace of the channel convolution matrix is affected. We show that fractionally spaced equalizers (FSE's) do not possess any CDE if a length-and-zero condition is satisfied. The convergence behavior of these FSE are clearly determined by the specific choice of cost function alone. We characterize the global convergence ability of several popular algorithms simply based on their ADE. We also present an FSE implementation of the super-exponential algorithm. We show that the FSE implementation does not introduce any nonideal approximation. Simulation results are also presented to illustrate the robustness and the improved performance of FSE under the super-exponential algorithm.
A period-independent bound, for zero and constant-input limit cycles in fixed-point digital filters, is developed. The bound is applicable to systems of arbitrary order, provided that all nonideal operations can be co...
详细信息
A period-independent bound, for zero and constant-input limit cycles in fixed-point digital filters, is developed. The bound is applicable to systems of arbitrary order, provided that all nonideal operations can be consolidated as single nonlinear operations applied at the input to each delay element. Three common types of nonlinearity (i.e. signal quantization) are considered, and a geometric interpretation is used to substantially tighten the bound for sign-magnitude signal quantization. Analytic expressions for the reduced bound are obtained for second-order sections, and an algorithm for computing the bound is presented for higher-order sections. Several numerical examples are presented for second-order sections and compared with previously published results. Two fifth-order low-pass filters (with elliptic and Chebyshev magnitude response characteristics, respectively) and one sixth-order elliptic-bandpass-filter are considered and shown to be free of zero-input limit cycles of amplitude greater than 33.< >
暂无评论