180 resultados para space phasor
Resumo:
The authors study the trajectories of charged particles in Ernst's space-time representing a static black hole immersed in a magnetic field. They find bound orbits always exist for realistic magnetic field strengths. A similar investigation is carried out for the case of Melvin's magnetic universe and for a corresponding test field superposed on a flat space-time.
Resumo:
An algorithm to generate a minimal spanning tree is presented when the nodes with their coordinates in some m-dimensional Euclidean space and the corresponding metric are given. This algorithm is tested on manually generated data sets. The worst case time complexity of this algorithm is O(n log2n) for a collection of n data samples.
Resumo:
The outer atmosphere of the sun called the corona has been observed during total solar eclipse for short periods (typically <6 min), from as early as the eighteenth century. In the recent past, space-based instruments have permitted us to study the corona uninterruptedly. In spite of these developments, the dynamic corona and its high temperature (1-2 million K) are yet to be Ally understood. It is conjectured that their dynamic nature and associated energetic events are possible reasons behind the high temperature. In order to study these in detail, a visible emission line space solar coronagraph is being proposed as a payload under the small-satellite programme of the Indian Space Research Organisation. The satellite is named as Aditya-1 and the scientific objectives of this payload are to study: (i) the existence of intensity oscillations for the study of wave-driven coronal heating; (ii) the dynamics and formation of coronal loops and temperature structure of the coronal features; (iii) the origin, cause and acceleration of coronal mass ejections (CMEs) and other solar active features, and (iv) coronal magnetic field topology and three-dimensional structures of CMEs using polarization information. The uniqueness of this payload compared to previously flown space instruments is as follows: (a) observations in the visible wavelength closer to the disk (down to 1.05 solar radii); (b) high time cadence capability (better than two-images per second), and (c) simultaneous observations of at least two spectral windows all the time and three spectral windows for short durations.
Resumo:
In this paper, we show a method of obtaining general and orthogonal moments, specifically Legendre and Zernicke moments, from the Radon Transform data of a two-dimensional function. The regular or geometric moments are first evaluated directly from the projection data and the orthogonal moments are derived from these regular moments.
Resumo:
This paper addresses the problem of determining an optimal (shortest) path in three dimensional space for a constant speed and turn-rate constrained aerial vehicle, that would enable the vehicle to converge to a rectilinear path, starting from any arbitrary initial position and orientation. Based on 3D geometry, we propose an optimal and also a suboptimal path planning approach. Unlike the existing numerical methods which are computationally intensive, this optimal geometrical method generates an optimal solution in lesser time. The suboptimal solution approach is comparatively more efficient and gives a solution that is very close to the optimal one. Due to its simplicity and low computational requirements this approach can be implemented on an aerial vehicle with constrained turn radius to reach a straight line with a prescribed orientation as required in several applications. But, if the distance between the initial point and the straight line to be followed along the vertical axis is high, then the generated path may not be flyable for an aerial vehicle with limited range of flight path angle and we resort to a numerical method for obtaining the optimal solution. The numerical method used here for simulation is based on multiple shooting and is found to be comparatively more efficient than other methods for solving such two point boundary value problem.
Resumo:
Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.
Resumo:
It is shown that the asymmetric chiral gauging of the WZW models give rise to consistent string backgrounds. The target space structure of the chiral gauged SL(2,R) WZW model, with the gauging of subgroups SO(1, 1) in the left and U(1) in the right moving sector, is obtained. We then analyze the symmetries of the background and show the presence of a non-trivial isometry in the canonical parametrization of the WZW model. Using these results, the equivalence of the asymmetric models with the symmetric ones is demonstrated.
Resumo:
A geometric invariant is associated to the parabolic moduli space on a marked surface and is related to the symplectic structure of the moduli space.
Resumo:
Analytical solutions of the generalized Bloch equations for an arbitrary set of initial values of the x, y, and z magnetization components are given in the rotating frame. The solutions involve the decoupling of the three coupled differential equations such that a third-order differential equation in each magnetization variable is obtained. In contrast to the previously reported solutions given by Torrey, the present attempt paves the way for more direct physical insight into the behavior of each magnetization component. Special cases have been discussed that highlight the utility of the general solutions. Representative trajectories of magnetization components are given, illustrating their behavior with respect to the values of off-resonance and initial conditions. (C) 1995 Academic Press, Inc.
Resumo:
The technique of space vector pulsewidth modulation (SVM) is reviewed. The basic principle of SVM is derived and is compared with sine-triangle PWM. Operation in the overmodulation range is explained. Extension of SVM to other inverter-motor combinations such as three level inverters and split phase motors are discussed.
Resumo:
The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.
Resumo:
This paper proposes a simple current error space vector based hysteresis controller for two-level inverter fed Induction Motor (IM) drives. This proposed hysteresis controller retains all advantages of conventional current error space vector based hysteresis controllers like fast dynamic response, simple to implement, adjacent voltage vector switching etc. The additional advantage of this proposed hysteresis controller is that it gives a phase voltage frequency spectrum exactly similar to that of a constant switching frequency space vector pulse width modulated (SVPWM) inverter. In this proposed hysteresis controller the boundary is computed online using estimated stator voltages along alpha and beta axes thus completely eliminating look up tables used for obtaining parabolic hysteresis boundary proposed in. The estimation of stator voltage is carried out using current errors along alpha and beta axes and steady state model of induction motor. The proposed scheme is simple and capable of taking inverter upto six step mode operation, if demanded by drive system. The proposed hysteresis controller based inverter fed drive scheme is simulated extensively using SIMULINK toolbox of MATLAB for steady state and transient performance. The experimental verification for steady state performance of the proposed scheme is carried out on a 3.7kW IM.
Resumo:
This paper proposes the development of dodecagonal (12-sided) space vector diagrams from cascaded H-Bridge inverters. As already reported in literatures, dodecagonal space vector diagrams have many advantages over conventional hexagonal ones. Some of them include the absence of 6n±1, (n=odd) harmonics from the phase voltage, and the extension of the linear modulation range. In this paper, a new power circuit is proposed for generating multiple dodecagons in the space vector plane. It consists of two cascaded H-Bridge cells fed from asymmetric dc voltage sources. It is shown that, with proper PWM timing calculation and placement of active and zero vectors, a very high quality of sine-wave can be produced. At the same time, the switching frequency of individual cells can be reduced substantially. Detailed PWM analysis, one design example and an elaborate simulation study is presented to support the proposed idea.
Resumo:
A scheme to apply the rate-1 real orthogonal designs (RODs) in relay networks with single real-symbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single real-symbol decodability offer an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 2/2+k complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single real-symbol decodability offer an overall rate of 1/3 complex symbols per channel use. In this paper, making use of RODs, a scheme which achieves the same overall rate of 1/3 complex symbols per channel use but with a decoding delay that is 50 percent of that of the best known DSTBCs, is presented. Simulation results of the symbol error rate performance for 10 relays, which show the superiority of the proposed scheme over the best known DSTBC for 10 relays with single real-symbol decodability, are provided.