188 resultados para Fast Rayleigh Fading


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper describes a Simultaneous Implicit (SI) approach for transient stability simulations based on an iterative technique using traingularised admittance matrix [1]. The reduced saliency of generator in the subtransient state is taken advantage of to speed up the algorithm. Accordingly, generator differential equations, except rotor swing, contain voltage proportional to fluxes in the main field, dampers and a hypothetical winding representing deep flowing eddy currents, as state variables. The simulation results are validated by comparison with two independent methods viz. Runge-Kutta simulation for a simplified system and a method based on modelling damper windings using conventional induction motor theory.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Existence of a periodic progressive wave solution to the nonlinear boundary value problem for Rayleigh surface waves of finite amplitude is demonstrated using an extension of the method of strained coordinates. The solution, obtained as a second-order perturbation of the linearized monochromatic Rayleigh wave solution, contains harmonics of all orders of the fundamental frequency. It is shown that the higher harmonic content of the wave increases with amplitude, but the slope of the waveform remains finite so long as the amplitude is less than a critical value.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we address the problem of transmission of correlated sources over a fading multiple access channel (MAC). We provide sufficient conditions for transmission with given distortions. Next these conditions are specialized to a Gaussian MAC (GMAC). Transmission schemes for discrete and Gaussian sources over a fading GMAC are considered. Various power allocation strategies are also compared.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Comparative studies on protein structures form an integral part of protein crystallography. Here, a fast method of comparing protein structures is presented. Protein structures are represented as a set of secondary structural elements. The method also provides information regarding preferred packing arrangements and evolutionary dynamics of secondary structural elements. This information is not easily obtained from previous methods. In contrast to those methods, the present one can be used only for proteins with some secondary structure. The method is illustrated with globin folds, cytochromes and dehydrogenases as examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Estimates of flexural frequencies of clamped square plates are initially obtained by the modified Bolotin's method. The mode shapes in “each direction” are then determined and the product functions of these mode shapes are used as admissible functions in the Rayleigh-Ritz method. The data for the first twenty eigenvalues in each of the three (four) symmetric groups obtained by the (i) Bolotin, (ii) Rayleigh and (iii) Rayleigh-Ritz methods are reported here. The Rayleigh estimates are found to be much closer to the true eigenvalues than the Bolotin estimates. The present product functions are found to be much superior to the conventional beam eigenmodes as admissible functions in the Rayleigh-Ritz method of analysis.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract is not available.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Multicode operation in space-time block coded (STBC) multiple input multiple output (MIMO) systems can provide additional degrees of freedom in code domain to achieve high data rates. In such multicode STBC systems, the receiver experiences code domain interference (CDI) in frequency selective fading. In this paper, we propose a linear parallel interference cancellation (LPIC) approach to cancel the CDI in multicode STBC in frequency selective fading. The proposed detector first performs LPIC followed by STBC decoding. We evaluate the bit error performance of the detector and show that it effectively cancels the CDI and achieves improved error performance. Our results further illustrate how the combined effect of interference cancellation, transmit diversity, and RAKE diversity affect the bit error performance of the system.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Elastic properties of Li2O-PbO-B2O3 glasses have been investigated using sound velocity measurements at 10 MHz. Four series of glasses have been investigated with different concentrations of Li2O, PbO and B2O3. The variations of molar volume have been examined for the influences of Li2O and PbO. The elastic moduli reveal trends in their compositional dependence. The bulk and shear modulus increases monotonically with increase in the concentration of tetrahedral boron which increases network dimensionality. The variation of bulk moduli has also been correlated to the variation in energy densities. The Poisson's ratio found to be insensitive to the concentration of tetrahedral boron in the structure. The experimental Debye temperatures are in good agreement with the expected theoretical values. Experimental observations have been examined in view, the presence of borate network and the possibility of non-negligible participation of lead in network formation. (c) 2005 Elsevier B.V. All rights reserved.