SIR Analysis and Interference Cancellation in Uplink OFDMA with Large Carrier Frequency/Timing Offsets

In uplink orthogonal frequency division multiple access (OFDMA), large timing offsets (TO) and/or carrier frequency offsets (CFO) of other users with respect to a desired user can cause significant multiuser interference (MUI). In this letter, we analytically characterize the degradation in the average output signal-to-interference ratio (SIR) due to the combined effect of both TOs as well as CFOs in uplink OFDMA. Specifically, we derive closed-form expressions for the average SIR at the DFT output in the presence of large CFOs and TOs. The analyticalexpressions derived for the signal and various interference terms at the DFT output are used to devise an interference cancelling receiver to mitigate the effect of CFO/TO-induced interferences.

The Hamilton-Jacobi equation revisited

A new analysis of the nature of the solutions of the Hamilton-Jacobi equation of classical dynamics is presented based on Caratheodory’s theorem concerning canonical transformations. The special role of a principal set of solutions is stressed, and the existence of analogous results in quantum mechanics is outlined.

Hamilton's theory of turns revisited

We present a new approach to Hamilton's theory of turns for the groups SO(3) and SU(2) which renders their properties, in particular their composition law, nearly trivial and immediately evident upon inspection. We show that the entire construction can be based on binary rotations rather than mirror reflections.

SIR Analysis and Interference Cancellation in Uplink OFDMA with Large Carrier Frequency/Timing Offsets

In uplink OFDMA, carrier frequency offsets (CFO) and/or timing offsets (TO) of other users with respect to a desired user can cause multiuser interference (MUI). In practical uplink OFDMA systems (e.g., IEEE 802.16e standard), effect of this MUI is made acceptably small by requiring that frequency/timing alignment be achieved at the receiver with high precision (e.g., CFO must be within 1 % of the subcarrier spacing and TO must be within 1/8th of the cyclic prefix duration in IEEE 802.16e), which is realized using complex closed-loop frequency/timing correction between the transmitter and the receiver. An alternate open-loop approach to handle the MUI induced by large CFOs and TOs is to employ interference cancellation techniques at the receiver. In this paper, we first analytically characterize the degradation in the average output signal-to-interference ratio (SIR) due to the combined effect of large CFOs and TOs in uplink OFDMA. We then propose a parallel interference canceller (PIC) for the mitigation of interference due to CFOs and TOs in this system. We show that the proposed PIC effectively mitigates the performance loss due to CFO/TO induced interference in uplink OFDMA.

Phase space methods and the Hamilton-Jacobi form of dynamics

A general analysis of the Hamilton-Jacobi form of dynamics motivated by phase space methods and classical transformation theory is presented. The connection between constants of motion, symmetries, and the Hamilton-Jacobi equation is described.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Performance of cellular CDMA with voice/data traffic with an SIR based admission control

We analyze the performance of an SIR based admission control strategy in cellular CDMA systems with both voice and data traffic. Most studies In the current literature to estimate CDMA system capacity with both voice and data traf-Bc do not take signal-tlFlnterference ratio (SIR) based admission control into account In this paper, we present an analytical approach to evaluate the outage probability for voice trafllc, the average system throughput and the mean delay for data traffic for a volce/data CDMA system which employs an SIR based admission controL We show that for a dataaniy system, an improvement of about 25% In both the Erlang capacity as well as the mean delay performance is achieved with an SIR based admission control as compared to code availability based admission control. For a mixed voice/data srtem with 10 Erlangs of voice traffic, the Lmprovement in the mean delay performance for data Is about 40%.Ah, for a mean delay of 50 ms with 10 Erlangs voice traffic, the data Erlang capacity improves by about 9%.

How to run a campaign: Optimal control of SIS and SIR information epidemics

Information spreading in a population can be modeled as an epidemic. Campaigners (e.g., election campaign managers, companies marketing products or movies) are interested in spreading a message by a given deadline, using limited resources. In this paper, we formulate the above situation as an optimal control problem and the solution (using Pontryagin's Maximum Principle) prescribes an optimal resource allocation over the time of the campaign. We consider two different scenarios-in the first, the campaigner can adjust a direct control (over time) which allows her to recruit individuals from the population (at some cost) to act as spreaders for the Susceptible-Infected-Susceptible (SIS) epidemic model. In the second case, we allow the campaigner to adjust the effective spreading rate by incentivizing the infected in the Susceptible-Infected-Recovered (SIR) model, in addition to the direct recruitment. We consider time varying information spreading rate in our formulation to model the changing interest level of individuals in the campaign, as the deadline is reached. In both the cases, we show the existence of a solution and its uniqueness for sufficiently small campaign deadlines. For the fixed spreading rate, we show the effectiveness of the optimal control strategy against the constant control strategy, a heuristic control strategy and no control. We show the sensitivity of the optimal control to the spreading rate profile when it is time varying. (C) 2014 Elsevier Inc. All rights reserved.

Approaches toward (eta(2)-HX) (X = H, SiR (R = Me-3 or Me2Ph), CH3) sigma-complexes of ruthenium

Two new Ru(II)-complexes RuH(Tpms)(PPh3)(2)] 1 (Tpms - (C3H3N2)(3)CSO3, tris-(pyrazolyl) methane sulfonate) and Ru(OTf)(Tpms)(PPh3)(2)] 2 (OTf = CF3SO3) have been synthesized and characterized wherein Ru-H and Ru-OTf are the key reactive centers. Reaction of 1 with HOTf results in the Ru(eta(2)-H-2)(Tpms)(PPh3)(2)]OTf] complex 3, whereas reaction of 1 with Me3SiOTf affords the dihydrogen complex 3 and complex 1 through an unobserved sigma-silane intermediate. In addition, an attempt to characterize the sigma methane complex via reaction of complex 1 with CH3OTf yields complex 2 and free methane. On the other hand, reaction of Ru(OTf)(Tpms)(PPh3)(2)] 2 with H-2 and PhMe2SiH at low temperature resulted in sigma-H-2, 3 and a probable sigma-silane complexes, respectively. However, no sigma-methane complex was observed for the reaction of complex 2 with methane even at low temperature. (C) 2014 Elsevier B. V. All rights reserved.