27 resultados para asynchronous
em Indian Institute of Science - Bangalore - Índia
Resumo:
The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N >= 2.
Resumo:
Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.
Resumo:
We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.
Resumo:
Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.
Resumo:
A few simple three-atom thermoneutral radical exchange reactions (i.e. A + BC --> AB + C) are examined by ab initio SCF methods. Emphasis is laid on the detailed analysis of density matrices rather than on energetics. Results reveal that the sum of the bond orders of the breaking and forming bonds is not conserved to unity, due to development of free valence on the migrating atom 'B' in the transition state. Bond orders, free valence and spin densities on the atoms are calculated. The present analysis shows that the bond-cleavage process is always more advanced than the bond-formation process in the transition state. Further analysis shows a development of the negative spin density on the migrating atom 'B' in the transition state. The depletion of the alpha-spin density on the radical site "A" in the reactant during the reaction lags behind the growth of the alpha-spin density on the terminal atom "C" of the reactant bond, 'B-C' in the transition state. But all these processes are completed simultaneously at the end of the reaction. Hence, the reactions are asynchronous but kinetically concerted in most cases.
Resumo:
This paper presents the analysis and study of voltage collapse at any converter bus in an AC system interconnected by multiterminal DC (MTDC) links. The analysis is based on the use of the voltage sensitivity factor (VSF) as a voltage collapse proximity indicator (VCPI). In this paper the VSF is defined as a matrix which is applicable to MTDC systems. The VSF matrix is derived from the basic steady state equations of the converter, control, DC and AC networks. The structure of the matrix enables the derivation of some of the basic properties which are generally applicable. A detailed case study of a four-terminal MTDC system is presented to illustrate the effects of control strategies at the voltage setting terminal (VST) and other terminals. The controls considered are either constant angle, DC voltage, AC voltage, reactive current and reactive power at the VST and constant power or current at the other terminals. The effect of the strength of the AC system (measured by short circuit ratio) on the VSF is investigated. Several interesting and new results are presented. An analytical expression for the self VSF at VST is also derived for some specific cases which help to explain the number of transitions in VSF around the critical values of SCR.
Resumo:
When synchronous motion does not exist, it is not possible to draw the classical mode shapes. In this paper, a representative shape of motion during free vibration of a non-classically damped system is sought. It is noted that this shape provides an optimal representation of free motion. Interpretations of the optimality thus introduced are presented. Their connection with non-proportionality of damping and of gyroscopy is brought out. In the spirit of the optimality presented in this paper, two indices of non-proportionality are defined. Properties of these indices are discussed. Comparison with other indices of non-proportionality available in the literature is presented. Illustrative examples are given. (C) 1999 Academic Press.
Resumo:
In this paper, we give a generalization of a result by Borkar and Meyn (2000) 1], on the stability and convergence of synchronous-update stochastic approximation algorithms, to the case of asynchronous stochastic approximations with delays. We then describe an interesting application of the result to asynchronous distributed temporal difference (TD) learning with function approximation and delays. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
Cooperative transmission by base stations can significantly improve the spectral efficiency of multiuser, multi-cell multiple input multiple output systems. We show that in such systems the multiuser interference is asynchronous by nature, even when perfect timing-advance mechanisms ensure that the desired signal components arrive synchronously. We establish an accurate mathematical model for the asynchronism, and use it to show that the asynchronism leads to a significant performance degradation of existing linear preceding designs that assumed synchronous interference. We consider three different previously proposed precoding designs, and show how to modify them to effectively mitigate asynchronous interference.
Resumo:
In phase encoding optical CDMA (OCDMA) the spreading is achieved by encoding the phase of signal spectrum. In this paper we first derive a mathematical model for the output of phase encoding OCDMA systems. Based on this model we introduce a metric to design spreading sequences for asynchronous transmission. Then we connect the phase encoding sequence design problem to OFDM PMEPR (peak to mean envelope power ratio) problem. Using this connection we conclude that designing sequences with good properties for samples of timing delay guarantees that the same sequence to be good for all timing delays. Finally using generalized bent function we manage to construct a family of sequences which are good for asynchronous phase encoding OCDMA systems and using these sequences we introduce an M-ary modulation scheme for phase encoding OCDMA
Resumo:
We address how the nature of linearly dispersing edge states of two-dimensional (2D) topological insulators evolves with increasing electron-electron correlation engendered by a Hubbard-like on-site repulsion U in finite ribbons of two models of topological band insulators. Using an inhomogeneous cluster slave-rotor mean-field method developed here, we show that electronic correlations drive the topologically nontrivial phase into a Mott insulating phase via two different routes. In a synchronous transition, the entire ribbon attains a Mott insulating state at one critical U that depends weakly on the width of the ribbon. In the second, asynchronous route, Mott localization first occurs on the edge layers at a smaller critical value of electronic interaction, which then propagates into the bulk as U is further increased until all layers of the ribbon become Mott localized. We show that the kind of Mott transition that takes place is determined by certain properties of the linearly dispersing edge states which characterize the topological resilience to Mott localization.
Resumo:
Adaptive Mesh Refinement is a method which dynamically varies the spatio-temporal resolution of localized mesh regions in numerical simulations, based on the strength of the solution features. In-situ visualization plays an important role for analyzing the time evolving characteristics of the domain structures. Continuous visualization of the output data for various timesteps results in a better study of the underlying domain and the model used for simulating the domain. In this paper, we develop strategies for continuous online visualization of time evolving data for AMR applications executed on GPUs. We reorder the meshes for computations on the GPU based on the users input related to the subdomain that he wants to visualize. This makes the data available for visualization at a faster rate. We then perform asynchronous executions of the visualization steps and fix-up operations on the CPUs while the GPU advances the solution. By performing experiments on Tesla S1070 and Fermi C2070 clusters, we found that our strategies result in 60% improvement in response time and 16% improvement in the rate of visualization of frames over the existing strategy of performing fix-ups and visualization at the end of the timesteps.
Resumo:
Multi-packet reception (MPR) promises significant throughput gains in wireless local area networks (WLANs) by allowing nodes to transmit even in the presence of ongoing transmissions in the medium. However, the medium access control (MAC) layer must now be redesigned to facilitate rather than discourage - these overlapping transmissions. We investigate asynchronous MPR MAC protocols, which successfully accomplish this by controlling the node behavior based on the number of ongoing transmissions in the channel. The protocols use the backoff timer mechanism of the distributed coordination function, which makes them practically appealing. We first highlight a unique problem of acknowledgment delays, which arises in asynchronous MPR, and investigate a solution that modifies the medium access rules to reduce these delays and increase system throughput in the single receiver scenario. We develop a general renewal-theoretic fixed-point analysis that leads to expressions for the saturation throughput, packet dropping probability, and average head-of-line packet delay. We also model and analyze the practical scenario in which nodes may incorrectly estimate the number of ongoing transmissions.
Resumo:
In a wireless receiver, a down-converted RF signal undergoes a transient phase shift, when the gain state is changed to adjust for varying conditions in transmission and propagation. A method is developed, in which such phase shifts are detected asynchronously, and their undesirable effects on the bit error rate are corrected. The method was developed for and used in, the system-level characterization and calibration of a 65-nm CMOS UHF receiver. The phase-shifts associated with specific gain-state transitions were measured within a test framework, and used in the baseband signal processing blocks to compensate for errors, whenever the receiver anticipated a gain-state transition.