Channel training signal design for reciprocal multiple antenna systems with beamforming

Fast and efficient channel estimation is key to achieving high data rate performance in mobile and vehicular communication systems, where the channel is fast time-varying. To this end, this work proposes and optimizes channel-dependent training schemes for reciprocal Multiple-Input Multiple-Output (MIMO) channels with beamforming (BF) at the transmitter and receiver. First, assuming that Channel State Information (CSI) is available at the receiver, a channel-dependent Reverse Channel Training (RCT) signal is proposed that enables efficient estimation of the BF vector at the transmitter with a minimum training duration of only one symbol. In contrast, conventional orthogonal training requires a minimum training duration equal to the number of receive antennas. A tight approximation to the capacity lower bound on the system is derived, which is used as a performance metric to optimize the parameters of the RCT. Next, assuming that CSI is available at the transmitter, a channel-dependent forward-link training signal is proposed and its power and duration are optimized with respect to an approximate capacity lower bound. Monte Carlo simulations illustrate the significant performance improvement offered by the proposed channel-dependent training schemes over the existing channel-agnostic orthogonal training schemes.

Stiff string approximations in Rayleigh-Ritz method for rotating beams

The governing differential equation of the rotating beam reduces to that of a stiff string when the centrifugal force is assumed as constant. The solution of the static homogeneous part of this equation is enhanced with a polynomial term and used in the Rayleighs method. Numerical experiments show better agreement with converged finite element solutions compared to polynomials. Using this as an estimate for the first mode shape, higher mode shape approximations are obtained using Gram-Schmidt orthogonalization. Estimates for the first five natural frequencies of uniform and tapered beams are obtained accurately using a very low order Rayleigh-Ritz approximation.

Joint evaluation of channel feedback schemes, rate adaptation, and scheduling in OFDMA downlinks with feedback delays

Orthogonal frequency-division multiple access (OFDMA) systems divide the available bandwidth into orthogonal subchannels and exploit multiuser diversity and frequency selectivity to achieve high spectral efficiencies. However, they require a significant amount of channel state feedback for scheduling and rate adaptation and are sensitive to feedback delays. We develop a comprehensive analysis for OFDMA system throughput in the presence of feedback delays as a function of the feedback scheme, frequency-domain scheduler, and rate adaptation rule. Also derived are expressions for the outage probability, which captures the inability of a subchannel to successfully carry data due to the feedback scheme or feedback delays. Our model encompasses the popular best-n and threshold-based feedback schemes and the greedy, proportional fair, and round-robin schedulers that cover a wide range of throughput versus fairness tradeoff. It helps quantify the different robustness of the schedulers to feedback overhead and delays. Even at low vehicular speeds, it shows that small feedback delays markedly degrade the throughput and increase the outage probability. Further, given the feedback delay, the throughput degradation depends primarily on the feedback overhead and not on the feedback scheme itself. We also show how to optimize the rate adaptation thresholds as a function of feedback delay.

Analysis of designed beta-hairpin peptides: molecular conformation and packing in crystals

The crystal structures of several designed peptide hairpins have been determined in order to establish features of molecular conformations and modes of aggregation in the crystals. Hairpin formation has been induced using a centrally positioned (D)Pro-Xxx segment (Xxx = (L)Pro, Aib, Ac(6)c, Ala; Aib = alpha-aminoisobutyric acid; Ac(6)c = 1-aminocyclohexane-1-carboxylic acid). Structures of the peptides Boc-Leu-Phe-Val-(D)Pro-(L)Pro-Leu-Phe-Val-OMe (1), Boc-Leu-Tyr-Val-(D)Pro-(L)Pro-Leu-Phe-Val-OMe (2, polymorphic forms labeled as 2a and 2b), Boc-Leu-Val-Val-(D)Pro-(L)Pro-Leu-Val-Val-OMe (3), Boc-Leu-Phe-Val-(D)Pro-Aib-Leu-Phe-Val-OMe (4, polymorphic forms labeled as 4a and 4b), Boc-Leu-Phe-Val-(D)Pro-Ac(6)c-Leu-Phe-Val-OMe (5) and Boc-Leu-Phe-Val-(D)Pro-Ala-Leu-Phe-Val-OMe (6) are described. All the octapeptides adopt type II' beta-turn nucleated hairpins, stabilized by three or four cross-strand intramolecular hydrogen bonds. The angle of twist between the two antiparallel strands lies in the range of -9.8 degrees to -26.7 degrees. A detailed analysis of packing motifs in peptide hairpin crystals is presented, revealing three broad modes of association: parallel packing, antiparallel packing and orthogonal packing. An attempt to correlate aggregation modes in solution with observed packing motifs in crystals has been made by indexing of crystal faces in the case of three of the peptide hairpins. The observed modes of hairpin aggregation may be of relevance in modeling multiple modes of association, which may provide insights into the structure of insoluble polypeptide aggregates.

Transport across a junction of topological insulators and a superconductor

We study transport across a line junction lying between two orthogonal topological insulator surfaces and a superconductor which can have either s-wave (spin-singlet) or p-wave (spin-triplet) pairing symmetry. The junction can have three time-reversal invariant barriers on three sides. We compute the charge and the spin conductance across such a junction and study their behaviors as a function of the bias voltage applied across the junction and the three parameters used to characterize the barrier. We find that the presence of topological insulators and a superconductor leads to both Dirac- and Schrodinger-like features in charge and spin conductances. We discuss the effect of bound states on the superconducting side of the barrier on the conductance; in particular, we show that for triplet p-wave superconductors, such a junction may be used to determine the spin state of its Cooper pairs. Our study reveals that there is a nonzero spin conductance for some particular spin states of the triplet Cooper pairs; this is an effect of the topological insulators which break the spin rotation symmetry. Finally, we find an unusual satellite peak (in addition to the usual zero bias peak) in the spin conductance for p-wave symmetry of the superconductor order parameter.

Experimental Studies on the Kinematics of Cutting in Granular Materials

Slow flow in granular materials is characterized by high solid fraction and sustained inter-particle interaction. The kinematics of trawling or cutting is encountered in processes such as locomotion of organisms in sand; trawl gear movement on a soil deposit; plow movement; movement of rovers, earth moving equipment etc. Additionally, this configuration is very akin to shallow drilling configuration encountered in the mining and petroleum industries. An experimental study has been made in order to understand velocity and deformation fields in cutting of a model rounded sand. Under nominal plane strain conditions, sand is subjected to orthogonal cutting at different tool-rake angles. High-resolution optical images of the region of cutting were obtained during the flow of the granular ensemble around the tool. Interesting kinematics underlying the formation of a chip and the evolution of the deformation field is seen in these experiments. These images are also analyzed using a PIV algorithm and detailed information of the deformation parameters such as velocity, strain rate and volume change is obtained.

SC-FDMA for multiuser communication on the downlink

Single-carrier frequency division multiple access (SC-FDMA) has become a popular alternative to orthogonal frequency division multiple access (OFDMA) in multiuser communication on the uplink. This is mainly due to the low peak-to-average power ratio (PAPR) of SC-FDMA compared to that of OFDMA. Long-term evolution (LTE) uses SC-FDMA on the uplink to exploit this PAPR advantage to reduce transmit power amplifier backoff in user terminals. In this paper, we show that SC-FDMA can be beneficially used for multiuser communication on the downlink as well. We present SC-FDMA transmit and receive signaling architectures for multiuser communication on the downlink. The benefits of using SC-FDMA on the downlink are that SC-FDMA can achieve i) significantly better bit error rate (BER) performance at the user terminal compared to OFDMA, and ii) improved PAPR compared to OFDMA which reduces base station (BS) power amplifier backoff (making BSs more green). SC-FDMA receiver needs to do joint equalization, which can be carried out using low complexity equalization techniques. For this, we present a local neighborhood search based equalization algorithm for SC-FDMA. This algorithm is very attractive both in complexity as well as performance. We present simulation results that establish the PAPR and BER performance advantage of SC-FDMA over OFDMA in multiuser SISO/MIMO downlink as well as in large-scale multiuser MISO downlink with tens to hundreds of antennas at the BS.

Low order anti-aliasing filters for sparse signals in embedded applications

Major emphasis, in compressed sensing (CS) research, has been on the acquisition of sub-Nyquist number of samples of a signal that has a sparse representation on some tight frame or an orthogonal basis, and subsequent reconstruction of the original signal using a plethora of recovery algorithms. In this paper, we present compressed sensing data acquisition from a different perspective, wherein a set of signals are reconstructed at a sampling rate which is a multiple of the sampling rate of the ADCs that are used to measure the signals. We illustrate how this can facilitate usage of anti-aliasing filters with relaxed frequency specifications and, consequently, of lower order.

Joint Antenna Selection and Frequency-Domain Scheduling in OFDMA Systems with Imperfect Estimates from Dual Pilot Training Scheme

Transmit antenna selection (AS) has been adopted in contemporary wideband wireless standards such as Long Term Evolution (LTE). We analyze a comprehensive new model for AS that captures several key features about its operation in wideband orthogonal frequency division multiple access (OFDMA) systems. These include the use of channel-aware frequency-domain scheduling (FDS) in conjunction with AS, the hardware constraint that a user must transmit using the same antenna over all its assigned subcarriers, and the scheduling constraint that the subcarriers assigned to a user must be contiguous. The model also captures the novel dual pilot training scheme that is used in LTE, in which a coarse system bandwidth-wide sounding reference signal is used to acquire relatively noisy channel state information (CSI) for AS and FDS, and a dense narrow-band demodulation reference signal is used to acquire accurate CSI for data demodulation. We analyze the symbol error probability when AS is done in conjunction with the channel-unaware, but fair, round-robin scheduling and with channel-aware greedy FDS. Our results quantify how effective joint AS-FDS is in dispersive environments, the interactions between the above features, and the ability of the user to lower SRS power with minimal performance degradation.

En Masse relay selection algorithms for multi-source, multi-relay, decode-and-forward cooperative systems

Opportunistic relay selection in a multiple source-destination (MSD) cooperative system requires quickly allocating to each source-destination (SD) pair a suitable relay based on channel gains. Since the channel knowledge is available only locally at a relay and not globally, efficient relay selection algorithms are needed. For an MSD system, in which the SD pairs communicate in a time-orthogonal manner with the help of decode-and-forward relays, we propose three novel relay selection algorithms, namely, contention-free en masse assignment (CFEA), contention-based en masse assignment (CBEA), and a hybrid algorithm that combines the best features of CFEA and CBEA. En masse assignment exploits the fact that a relay can often aid not one but multiple SD pairs, and, therefore, can be assigned to multiple SD pairs. This drastically reduces the average time required to allocate an SD pair when compared to allocating the SD pairs one by one. We show that the algorithms are much faster than other selection schemes proposed in the literature and yield significantly higher net system throughputs. Interestingly, CFEA is as effective as CBEA over a wider range of system parameters than in single SD pair systems.

Dynamics and fracture of ligaments from a droplet on a vibrating surface

A droplet residing on a vibrating surface and in the pressure antinode of an asymmetric standing wave can spread radially outward and atomize. In this work, proper orthogonal decomposition through high speed imaging is shown to predict the likelihood of atomization for various viscous fluids based on prior information in the droplet spreading phase. Capillary instabilities are seen to affect ligament rupture. Viscous dissipation plays an important role in determining the wavelength of the most unstable mode during the inception phase of the ligaments. However, the highest ligament capillary number achieved was less than 1, and the influence of viscosity in the ligament growth and breakup phases is quite minimal. It is inferred from the data that the growth of a typical ligament is governed by a balance between the inertial force obtained from the inception phase and capillary forces. By including the effect of acoustic pressure field around the droplet, the dynamics of the ligament growth phase is revealed and the ligament growth profiles for different fluids are shown to collapse on a straight line using a new characteristic time scale.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

On Uniform Approximate Solutions in Bending of Symmetric Laminated Plates

A layer-wise theory with the analysis of face ply independent of lamination is used in the bending of symmetric laminates with anisotropic plies. More realistic and practical edge conditions as in Kirchhoff's theory are considered. An iterative procedure based on point-wise equilibrium equations is adapted. The necessity of a solution of an auxiliary problem in the interior plies is explained and used in the generation of proper sequence of two dimensional problems. Displacements are expanded in terms of polynomials in thickness coordinate such that continuity of transverse stresses across interfaces is assured. Solution of a fourth order system of a supplementary problem in the face ply is necessary to ensure the continuity of in-plane displacements across interfaces and to rectify inadequacies of these polynomial expansions in the interior distribution of approximate solutions. Vertical deflection does not play any role in obtaining all six stress components and two in-plane displacements. In overcoming lacuna in Kirchhoff's theory, widely used first order shear deformation theory and other sixth and higher order theories based on energy principles at laminate level in smeared laminate theories and at ply level in layer-wise theories are not useful in the generation of a proper sequence of 2-D problems converging to 3-D problems. Relevance of present analysis is demonstrated through solutions in a simple text book problem of simply supported square plate under doubly sinusoidal load.

MRT Letter: Light Sheet Based Imaging Flow Cytometry on a Microfluidic Platform

We propose a light sheet based imaging flow cytometry technique for simultaneous counting and imaging of cells on a microfluidic platform. Light sheet covers the entire microfluidic channel and thus omits the necessity of flow focusing and point scanning based technology. Another advantage lies in the orthogonal detection geometry that totally cuts-off the incident light, thereby substantially reducing the background in the detection. Compared to the existing state-of-art techniques the proposed technique shows marked improvement. Using fluorescently-coated Saccharomyces cerevisiae cells we have recorded cell counting with throughput as high as 2,090 cells/min in the low flow rate regime and were able to image the individual cells on-the-go. Overall, the proposed system is cost-effective and simple in channel geometry with the advantage of efficient counting in operational regime of low laminar flow. This technique may advance the emerging field of microfluidic based cytometry for applications in nanomedicine and point of care diagnostics. Microsc. Res. Tech. 76:1101-1107, 2013. (c) 2013 Wiley Periodicals, Inc.

The Lovasz θ function, SVMs and finding large dense subgraphs

The Lovasz θ function of a graph, is a fundamental tool in combinatorial optimization and approximation algorithms. Computing θ involves solving a SDP and is extremely expensive even for moderately sized graphs. In this paper we establish that the Lovasz θ function is equivalent to a kernel learning problem related to one class SVM. This interesting connection opens up many opportunities bridging graph theoretic algorithms and machine learning. We show that there exist graphs, which we call SVM−θ graphs, on which the Lovasz θ function can be approximated well by a one-class SVM. This leads to a novel use of SVM techniques to solve algorithmic problems in large graphs e.g. identifying a planted clique of size Θ(n√) in a random graph G(n,12). A classic approach for this problem involves computing the θ function, however it is not scalable due to SDP computation. We show that the random graph with a planted clique is an example of SVM−θ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art. Further, we introduce the notion of a ''common orthogonal labeling'' which extends the notion of a ''orthogonal labelling of a single graph (used in defining the θ function) to multiple graphs. The problem of finding the optimal common orthogonal labelling is cast as a Multiple Kernel Learning problem and is used to identify a large common dense region in multiple graphs. The proposed algorithm achieves an order of magnitude scalability compared to the state of the art.