SC-FDMA versus OFDMA: Sensitivity to Large Carrier Frequency and Timing Offsets on the Uplink

In this paper, we present a comparison between the sensitivity of SC-FDMA and OFDMA schemes to large carrier frequency offsets (CFO) and timing offsets (TO) of different users on the uplink. Our study shows the following observations: 1) In the ideal case of zero CFOs and TOs (i.e., perfect synchronization), the uncoded BER performance of SC-FDMA with frequency domain MMSE equalizer is better than that of OFDMA due to the inherent frequency diversity that is possible in SCFDMA. Also, because of inter-symbol interference in SC-FDMA, the performance of SC-FDMA with MMSE equalizer can be further improved by using low-complexity interference cancellation (IC) techniques. 2) In the presence of large CFOs and TOs, significant multiuser interference (MUI) gets introduced, and hence the performance of SC-FDMA with MMSE equalizer can get worse than that of OFDMA. However, the performance advantage of SC-FDMA with MMSE equalizer over OFDMA (due to the potential for frequency diversity benefit in SC-FDMA) can be restored by adopting multistage IC techniques, using the knowledge of CFOs and TOs of different users at the receiver

An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

Predicting the Timing of Spikes Evoked by Tactile Stimulation of the Hand

Kim SS, Sripati AP, Bensmaia SJ. Predicting the timing of spikes evoked by tactile stimulation of the hand. J Neurophysiol 104: 1484-1496, 2010. First published July 7, 2010; doi: 10.1152/jn.00187.2010. What does the hand tell the brain? Tactile stimulation of the hand evokes remarkably precise patterns of neural activity, suggesting that the timing of individual spikes may convey information. However, many aspects of the transformation of mechanical deformations of the skin into spike trains remain unknown. Here we describe an integrate-and-fire model that accurately predicts the timing of individual spikes evoked by arbitrary mechanical vibrations in three types of mechanoreceptive afferent fibers that innervate the hand. The model accounts for most known properties of the three fiber types, including rectification, frequency-sensitivity, and patterns of spike entrainment as a function of stimulus frequency. These results not only shed light on the mechanisms of mechanotransduction but can be used to provide realistic tactile feedback in upper-limb neuroprostheses.

Investigating online reading with eye tracking and EEG : The influence of text format, reading task and parafoveal stimuli on reading processes

Research on reading has been successful in revealing how attention guides eye movements when people read single sentences or text paragraphs in simplified and strictly controlled experimental conditions. However, less is known about reading processes in more naturalistic and applied settings, such as reading Web pages. This thesis investigates online reading processes by recording participants eye movements. The thesis consists of four experimental studies that examine how location of stimuli presented outside the currently fixated region (Study I and III), text format (Study II), animation and abrupt onset of online advertisements (Study III), and phase of an online information search task (Study IV) affect written language processing. Furthermore, the studies investigate how the goal of the reading task affects attention allocation during reading by comparing reading for comprehension with free browsing, and by varying the difficulty of an information search task. The results show that text format affects the reading process, that is, vertical text (word/line) is read at a slower rate than a standard horizontal text, and the mean fixation durations are longer for vertical text than for horizontal text. Furthermore, animated online ads and abrupt ad onsets capture online readers attention and direct their gaze toward the ads, and distract the reading process. Compared to a reading-for-comprehension task, online ads are attended to more in a free browsing task. Moreover, in both tasks abrupt ad onsets result in rather immediate fixations toward the ads. This effect is enhanced when the ad is presented in the proximity of the text being read. In addition, the reading processes vary when Web users proceed in online information search tasks, for example when they are searching for a specific keyword, looking for an answer to a question, or trying to find a subjectively most interesting topic. A scanning type of behavior is typical at the beginning of the tasks, after which participants tend to switch to a more careful reading state before finishing the tasks in the states referred to as decision states. Furthermore, the results also provided evidence that left-to-right readers extract more parafoveal information to the right of the fixated word than to the left, suggesting that learning biases attentional orienting towards the reading direction.

Impaired conflict monitoring in Parkinson's disease patients during an oculomotor redirect task

Fallibility is inherent in human cognition and so a system that will monitor performance is indispensable. While behavioral evidence for such a system derives from the finding that subjects slow down after trials that are likely to produce errors, the neural and behavioral characterization that enables such control is incomplete. Here, we report a specific role for dopamine/basal ganglia in response conflict by accessing deficits in performance monitoring in patients with Parkinson's disease. To characterize such a deficit, we used a modification of the oculomotor countermanding task to show that slowing down of responses that generate robust response conflict, and not post-error per se, is deficient in Parkinson's disease patients. Poor performance adjustment could be either due to impaired ability to slow RT subsequent to conflicts or due to impaired response conflict recognition. If the latter hypothesis was true, then PD subjects should show evidence of impaired error detection/correction, which was found to be the case. These results make a strong case for impaired performance monitoring in Parkinson's patients.

Paleoseismological evidence of surface faulting along the northeastern Himalayan front, India: Timing, size, and spatial extent of great earthquakes

The similar to 2500 km long Himalayan arc has experienced three large to great earthquakes of M-w 7.8 to 8.4 during the past century, but none produced surface rupture. Paleoseismic studies have been conducted during the last decade to begin understanding the timing, size, rupture extent, return period, and mechanics of the faulting associated with the occurrence of large surface rupturing earthquakes along the similar to 2500 km long Himalayan Frontal Thrust (HFT) system of India and Nepal. The previous studies have been limited to about nine sites along the western two-thirds of the HFT extending through northwest India and along the southern border of Nepal. We present here the results of paleoseismic investigations at three additional sites further to the northeast along the HFT within the Indian states of West Bengal and Assam. The three sites reside between the meizoseismal areas of the 1934 Bihar-Nepal and 1950 Assam earthquakes. The two westernmost of the sites, near the village of Chalsa and near the Nameri Tiger Preserve, show that offsets during the last surface rupture event were at minimum of about 14 m and 12 m, respectively. Limits on the ages of surface rupture at Chalsa (site A) and Nameri (site B), though broad, allow the possibility that the two sites record the same great historical rupture reported in Nepal around A.D. 1100. The correlation between the two sites is supported by the observation that the large displacements as recorded at Chalsa and Nameri would most likely be associated with rupture lengths of hundreds of kilometers or more and are on the same order as reported for a surface rupture earthquake reported in Nepal around A.D. 1100. Assuming the offsets observed at Chalsa and Nameri occurred synchronously with reported offsets in Nepal, the rupture length of the event would approach 700 to 800 km. The easternmost site is located within Harmutty Tea Estate (site C) at the edges of the 1950 Assam earthquake meizoseismal area. Here the most recent event offset is relatively much smaller (<2.5 m), and radiocarbon dating shows it to have occurred after A.D. 1100 (after about A.D. 1270). The location of the site near the edge of the meizoseismal region of the 1950 Assam earthquake and the relatively lesser offset allows speculation that the displacement records the 1950 M-w 8.4 Assam earthquake. Scatter in radiocarbon ages on detrital charcoal has not resulted in a firm bracket on the timing of events observed in the trenches. Nonetheless, the observations collected here, when taken together, suggest that the largest of thrust earthquakes along the Himalayan arc have rupture lengths and displacements of similar scale to the largest that have occurred historically along the world's subduction zones.

Cooperative OFDM with Amplify-and-Forward Relaying with Timing Offset

In this paper, we investigate cooperative OFDM communications using amplify-and-forward (AF) protocol at the relays, in the presence of imperfect timing synchronization. In most studies on cooperative communications, perfect time synchronization among cooperating nodes is assumed. In practice, however, due to imperfect time synchronization, orthogonality among the subcarriers of the different nodes' signals at the destination receiver can be lost, causing inter-symbol interference (ISI). In this paper, we derive analytical expressions for the average SINR at the DFT output at the destination as a function of timing offset in cooperative OFDM with AF protocol, and illustrate the SINR degradation as a function of the timing offset. We also present an interference canceling (IC) receiver to mitigate the effects of ISI when there is timing offset. We show that the proposed IC receiver achieves improved BER performance even when timing offsets are large.

BER Analysis of Uplink OFDMA in the Presence of Carrier Frequency and Timing Offsets on Rician Fading Channels

In uplink orthogonal frequency division multiple access (OFDMA), carrier frequency offsets (CFO) and/or timing offsets (TO) of other users with respect to a desired user can cause significant multiuser interference (MUI). In this paper, we derive an analytical bit error rate (BER) expression that quantify the degradation in BER due to the combined effect of both CFOs and TOs in uplink OFDMA on Rician fading channels. Such an analytical BER derivation for uplink OFDMA with CFOs and TOs on Rician fading channels has not been reported so far. For the case of non-zero CFOs/TOs, we obtain an approximate BER expression involving a single integral. Analytical and simulation BER results are shown to match very well.

Task Dependent Boundary Mannequins in Statistical DHM

The primary objective of the paper is to make use of statistical digital human model to better understand the nature of reach probability of points in the taskspace. The concept of task-dependent boundary manikin is introduced to geometrically characterize the extreme individuals in the given population who would accomplish the task. For a given point of interest and task, the map of the acceptable variation in anthropometric parameters is superimposed with the distribution of the same parameters in the given population to identify the extreme individuals. To illustrate the concept, the task space mapping is done for the reach probability of human arms. Unlike the boundary manikins, who are completely defined by the population, the dimensions of these manikins will vary with task, say, a point to be reached, as in the present case. Hence they are referred to here as the task-dependent boundary manikins. Simulations with these manikins would help designers to visualize how differently the extreme individuals would perform the task. Reach probability at the points in a 3D grid in the operational space is computed; for objects overlaid in this grid, approximate probabilities are derived from the grid for rendering them with colors indicating the reach probability. The method may also help in providing a rational basis for selection of personnel for a given task.

Multi-UAV Task Allocation using Team Theory

A multiple UAV search and attack mission in a battlefield involves allocating UAVs to different target tasks efficiently. This task allocation becomes difficult when there is no communication among the UAVs and the UAVs sensors have limited range to detect the targets and neighbouring UAVs, and assess target status. In this paper, we propose a team theoretic approach to efficiently allocate UAVs to the targets with the constraint that UAVs do not communicate among themselves and have limited sensor range. We study the performance of team theoretic approach for task allocation on a battle field scenario. The performance obtained through team theory is compared with two other methods, namely, limited sensor range but with communication among all the UAVs, and greedy strategy with limited sensor range and no communication. It is found that the team theoretic strategy performs the best even though it assumes limited sensor range and no communication.

BER Analysis of Uplink OFDMA in the Presence of Carrier Frequency and Timing Offsets on Rician Fading Channels

In orthogonal frequency-division multiple access (OFDMA) on the uplink, the carrier frequency offsets (CFOs) and/or timing offsets (TOs) of other users with respect to a desired user can cause multiuser interference (MUI). Analytically evaluating the effect of these CFO/TO-induced MUI on the bit error rate (BER) performance is of interest. In this paper, we analyze the BER performance of uplink OFDMA in the presence of CFOs and TOs on Rician fading channels. A multicluster multipath channel model that is typical in indoor/ultrawideband and underwater acoustic channels is considered. Analytical BER expressions that quantify the degradation in BER due to the combined effect of both CFOs and TOs in uplink OFDMA with M-state quadrature amplitude modulation (QAM) are derived. Analytical and simulation BER results are shown to match very well. The derived BER expressions are shown to accurately quantify the performance degradation due to nonzero CFOs and TOs, which can serve as a useful tool in OFDMA system design.

Timing and broad-band spectroscopy of 1A 1118-61 with Suzaku

We present a timing and broad-band pulse-phase-resolved spectral analysis of the transient Be X-ray binary pulsar 1A 1118-61 observed during its outburst in 2009 January using Suzaku observations. The Suzaku observations were made twice, once at the peak of the outburst, and the other 13 d later at its declining phase. Pulse profiles from both observations exhibit strong energy dependence with several peaks at low energies and a single peak above similar to 10 keV. A weak, narrow peak is detected at the main dip of the pulse profiles from both observations in the energy bands below 3 keV, indicating the presence of a phase-dependent soft excess in the source continuum. The broad-band energy spectrum of the pulsar could be fitted well with a partial covering cut-off power-law model and a narrow iron fluorescence line. We also detect a broad cyclotron feature at similar to 50 keV from both observations which is a feature common for accretion-powered pulsars with high magnetic field strength. The pulse-phase-resolved spectral analysis shows an increase in the absorption column density of the partial covering component, as well as variation in the covering fraction at the dips of the pulse profiles, which naturally explains energy dependence of the same. The cyclotron line parameters also show significant variation with pulse phase with an similar to 10 keV variation in the cyclotron line energy and a variation in depth by a factor of 3. This can be explained either as the effect of different viewing angles of the dipole field at different pulse phases, or due to a more complex underlying magnetic field geometry.

Implications of program phase behavior on timing analysis

Knowledge about program worst case execution time (WCET) is essential in validating real-time systems and helps in effective scheduling. One popular approach used in industry is to measure execution time of program components on the target architecture and combine them using static analysis of the program. Measurements need to be taken in the least intrusive way in order to avoid affecting accuracy of estimated WCET. Several programs exhibit phase behavior, wherein program dynamic execution is observed to be composed of phases. Each phase being distinct from the other, exhibits homogeneous behavior with respect to cycles per instruction (CPI), data cache misses etc. In this paper, we show that phase behavior has important implications on timing analysis. We make use of the homogeneity of a phase to reduce instrumentation overhead at the same time ensuring that accuracy of WCET is not largely affected. We propose a model for estimating WCET using static worst case instruction counts of individual phases and a function of measured average CPI. We describe a WCET analyzer built on this model which targets two different architectures. The WCET analyzer is observed to give safe estimates for most benchmarks considered in this paper. The tightness of the WCET estimates are observed to be improved for most benchmarks compared to Chronos, a well known static WCET analyzer.

Mechanism design for time critical and cost critical task execution via crowdsourcing

An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an atomic task as well as in recruiting other agents to execute the task. We study this mechanism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner's goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We identify a set of desirable properties that should ideally be satisfied by a crowdsourcing mechanism. In particular, sybil-proofness and collapse-proofness are two complementary properties in our desiderata. We prove that no mechanism can satisfy all the desirable properties simultaneously. This leads us naturally to explore approximate versions of the critical properties. We focus our attention on approximate sybil-proofness and our exploration leads to a parametrized family of payment mechanisms which satisfy collapse-proofness. We characterize the approximate versions of the desirable properties in cost critical and time critical domain.

Optimal incentive timing strategies for product marketing on social networks

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.