Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Flexibility in flapping foil suppresses meandering of induced jet in absence of free stream

Thrust-generating flapping foils are known to produce jets inclined to the free stream at high Strouhal numbers St = fA/U-infinity, where f is the frequency and A is the amplitude of flapping and U-infinity is the free-stream velocity. Our experiments, in the limiting case of St —> infinity (zero free-stream speed), show that a purely oscillatory pitching motion of a chordwise flexible foil produces a coherent jet composed of a reverse Benard-Karman vortex street along the centreline, albeit over a specific range of effective flap stiffnesses. We obtain flexibility by attaching a thin flap to the trailing edge of a rigid NACA0015 foil; length of flap is 0.79 c where c is rigid foil chord length. It is the time-varying deflections of the flexible flap that suppress the meandering found in the jets produced by a pitching rigid foil for zero free-stream condition. Recent experiments (Marais et al., J. Fluid Mech., vol. 710, 2012, p. 659) have also shown that the flexibility increases the St at which non-deflected jets are obtained. Analysing the near-wake vortex dynamics from flow visualization and particle image velocimetry (PIV) measurements, we identify the mechanisms by which flexibility suppresses jet deflection and meandering. A convenient characterization of flap deformation, caused by fluid-flap interaction, is through a non-dimensional effective stiffness', EI* = 8 EI/(rho V-TEmax(2) s(f) c(f)(3)/2), representing the inverse of the flap deflection due to the fluid-dynamic loading; here, EI is the bending stiffness of flap, rho is fluid density, V-TEmax is the maximum velocity of rigid foil trailing edge, s(f) is span and c(f) is chord length of the flexible flap. By varying the amplitude and frequency of pitching, we obtain a variation in EI* over nearly two orders of magnitude and show that only moderate EI*. (0.1 less than or similar to EI * less than or similar to 1 generates a sustained, coherent, orderly jet. Relatively `stiff' flaps (EI* greater than or similar to 1), including the extreme case of no flap, produce meandering jets, whereas highly `flexible' flaps (EI* less than or similar to 0.1) produce spread-out jets. Obtained from the measured mean velocity fields, we present values of thrust coefficients for the cases for which orderly jets are observed.

Event-triggered sampling using signal extrema for instantaneous amplitude and instantaneous frequency estimation

Event-triggered sampling (ETS) is a new approach towards efficient signal analysis. The goal of ETS need not be only signal reconstruction, but also direct estimation of desired information in the signal by skillful design of event. We show a promise of ETS approach towards better analysis of oscillatory non-stationary signals modeled by a time-varying sinusoid, when compared to existing uniform Nyquist-rate sampling based signal processing. We examine samples drawn using ETS, with events as zero-crossing (ZC), level-crossing (LC), and extrema, for additive in-band noise and jitter in detection instant. We find that extrema samples are robust, and also facilitate instantaneous amplitude (IA), and instantaneous frequency (IF) estimation in a time-varying sinusoid. The estimation is proposed solely using extrema samples, and a local polynomial regression based least-squares fitting approach. The proposed approach shows improvement, for noisy signals, over widely used analytic signal, energy separation, and ZC based approaches (which are based on uniform Nyquist-rate sampling based data-acquisition and processing). Further, extrema based ETS in general gives a sub-sampled representation (relative to Nyquistrate) of a time-varying sinusoid. For the same data-set size captured with extrema based ETS, and uniform sampling, the former gives much better IA and IF estimation. (C) 2015 Elsevier B.V. All rights reserved.

Wireless scheduling with partial channel state information: large deviations and optimality

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

A novel interferometric technique to estimate thermal diffusivity of `optically transparent solid' using `Isothermal surface velocimetry'

One-dimensional transient heat flow is interpreted as a procession of `macro-scale translatory motion of indexed isothermal surfaces'. A new analytical model is proposed by introducing velocity of isothermal surface in Fourier heat diffusion equation. The velocity dependent function is extracted by revisiting `the concept of thermal layer of heat conduction in solid' and `exact solution' to estimate thermal diffusivity. The experimental approach involves establishment of 1 D unsteady heat flow inside the sample through Step-temperature excitation. A novel self-reference interferometer is utilized to separate a `unique isothermal surface' in time-varying temperature field. The translatory motion of the said isothermal surface is recorded using digital camera to estimate its velocity. From the knowledge of thermo-optic coefficient, temperature of the said isothermal surface is predicted. The performance of proposed method is evaluated for Quartz sample and compared with literature.

Joint Channel Estimation and Data Detection in MIMO-OFDM Systems: A Sparse Bayesian Learning Approach

The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.

Fuel-optimal G-MPSP Guidance for Powered Descent Phase of Soft Lunar Landing

A fuel optimal nonlinear sub-optimal guidance scheme is presented in this paper for soft landing of a lunar craft during the powered descent phase. The recently developed Generalized Model Predictive Static Programming (G-MPSP) is used to compute the required magnitude and angle of the thrust vector. Both terminal position and velocity vector are imposed as hard constraints, which ensures high position accuracy and facilitates initiation of vertical descent at the end of the powered descent phase. A key feature of the G-MPSP algorithm is that it converts the nonlinear dynamic programming problem into a low-dimensional static optimization problem (of the same dimension as the output vector). The control history update is done in closed form after computing a time-varying weighting matrix through a backward integration process. This feature makes the algorithm computationally efficient, which makes it suitable for on-board applications. The effectiveness of the proposed guidance algorithm is demonstrated through promising simulation results.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].

Time delay to firing of a triggered vacuum gap with barium titanate in trigger gap

The time delay to the firing of a triggered vacuum gap (t.v.g.) containing barium titanate in the trigger gap is investigated as a function of the main gap voltage, main gap length, trigger pulse duration, trigger current and trigger voltage. The time delay decreases steadily with increasing trigger current and trigger voltage until it reaches saturation. The effect of varying the main gap length and voltage on the time delay is not strong. Before `conditioning�¿ the t.v.g. two groups of time delays, long (>100�¿s) and short (<10�¿s), are simultaneously observed when a large number of trials are conducted. After conditioning, only the group of short time delays are present. This is attributed to the marked reduction of the resistance of the trigger gap across the surface of the solid dielectric resulting directly from the conditioning effect.

Time-Temperature Scaling of Conductivity Spectra of Organic Plastic Crystalline Conductors

Organic plastic crystalline soft matter ion conductors are interesting alternatives to liquid electrolytes in electrochemical storage devices such as Lithium-ion batteries. The solvent dynamics plays a major role in determining the ion transport in plastic crystalline ion conductors. We present here an analysis of the frequency-dependent ionic conductivity of succinonitrile-based plastic crystalline ion conductors at varying salt composition (0.005 to 1 M) and temperature (-20 to 60 degrees C) using time-temperature superposition principle (TTSP). The main motivation of the work has been to establish comprehensive insight into the ion transport mechanism from a single method viz, impedance spectroscopy rather than employing cluster of different characterization methods probing various length and time scales. The TTSP remarkably aids in explicit identification of the extent of the roles of solvent dynamics and ion-ion interactions on the effective conductivity of the orientationally disordered plastic crystalline ion conductors.

Fragment-based real-time object tracking: a sparse representation approach

Real-time object tracking is a critical task in many computer vision applications. Achieving rapid and robust tracking while handling changes in object pose and size, varying illumination and partial occlusion, is a challenging task given the limited amount of computational resources. In this paper we propose a real-time object tracker in l(1) framework addressing these issues. In the proposed approach, dictionaries containing templates of overlapping object fragments are created. The candidate fragments are sparsely represented in the dictionary fragment space by solving the l(1) regularized least squares problem. The non zero coefficients indicate the relative motion between the target and candidate fragments along with a fidelity measure. The final object motion is obtained by fusing the reliable motion information. The dictionary is updated based on the object likelihood map. The proposed tracking algorithm is tested on various challenging videos and found to outperform earlier approach.

Healing time for the growth of thin films on patterned substrates

The healing times for the growth of thin films on patterned substrates are studied using simulations of two discrete models of surface growth: the Family model and the Das Sarma-Tamborenea (DT) model. The healing time, defined as the time at which the characteristics of the growing interface are ``healed'' to those obtained in growth on a flat substrate, is determined via the study of the nearest-neighbor height difference correlation function. Two different initial patterns are considered in this work: a relatively smooth tent-shaped triangular substrate and an atomically rough substrate with singlesite pillars or grooves. We find that the healing time of the Family and DT models on aL x L triangular substrate is proportional to L-z, where z is the dynamical exponent of the models. For the Family model, we also analyze theoretically, using a continuum description based on the linear Edwards-Wilkinson equation, the time evolution of the nearest-neighbor height difference correlation function in this system. The correlation functions obtained from continuum theory and simulation are found to be consistent with each other for the relatively smooth triangular substrate. For substrates with periodic and random distributions of pillars or grooves of varying size, the healing time is found to increase linearly with the height (depth) of pillars (grooves). We show explicitly that the simulation data for the Family model grown on a substrate with pillars or grooves do not agree with results of a calculation based on the continuum Edwards-Wilkinson equation. This result implies that a continuum description does not work when the initial pattern is atomically rough. The observed dependence of the healing time on the substrate size and the initial height (depth) of pillars (grooves) can be understood from the details of the diffusion rule of the atomistic model. The healing time of both models for pillars is larger than that for grooves with depth equal to the height of the pillars. The calculated healing time for both Family and DT models is found to depend on how the pillars and grooves are distributed over the substrate. (C) 2014 Elsevier B.V. All rights reserved.