Robust Relay Precoder Design for MIMO-Relay Networks

In this paper, we consider a robust design of MIMO-relay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a single MIMO-relay node. The source and destination nodes are single antenna nodes, whereas the MIMO-relay node has multiple transmit and multiple receive antennas. The channel state information (CSI) available at the MIMO-relay node for precoding purpose is assumed to be imperfect. We assume that the norms of errors in CSI are upper-bounded, and the MIMO-relay node knows these bounds. We consider the robust design of the MIMO-relay precoder and receive filter based on the minimization of the total MIMO-relay transmit power with constraints on the mean square error (MSE) at the destination nodes. We show that this design problem can be solved by solving an alternating sequence of minimization and worst-case analysis problems. The minimization problem is formulated as a convex optimization problem that can be solved efficiently using interior-point methods. The worst-case analysis problem can be solved analytically using an approximation for the MSEs at the destination nodes. We demonstrate the robust performance of the proposed design through simulations.

Quantum theoretical study of molecular mechanisms of mutation and cancer - A review

Several endogenous and exogenous chemical species, particularly the so-called reactive oxygen species (ROS) and reactive nitrogen oxide species (RNOS), attack deoxyribonucleic acid (DNA) in biological systems producing DNA lesions which hamper normal cell functioning and cause various diseases including mutation and cancer. The guanine (G) base of DNA among all the bases is most susceptible and certain modified guanines get involved in mispairing with other bases during DNA replication. The biological system repairs the abnormal base pairs, but those that are still left cause mutation and cancer. Anti-oxidants present in biological systems can scavenge the ROS and RNOS. Thus three types of molecular events occur in biological media: (i) DNA damage, (ii) DNA repair, and (iii) prevention of DNA damage by scavenging ROS and RNOS. Quantum mechanical methods may be used to unravel molecular mechanisms of such phenomena. Some recent quantum theoretical results obtained on these problems are reviewed here.

Precoding by Pairing Subchannels to Increase MIMO Capacity With Discrete Input Alphabets

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in 1] to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using singular value decomposition (SVD) and X-Codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and a 2 x 2 real rotation matrix for each pair (parameterized with a single angle). This precoding structure enables us to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is solved by: i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and is significantly better than Mercury/waterfilling strategy by Lozano et al. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.

Video coding mode decision as a classification problem

In this paper, we show that it is possible to reduce the complexity of Intra MB coding in H.264/AVC based on a novel chance constrained classifier. Using the pairs of simple mean-variances values, our technique is able to reduce the complexity of Intra MB coding process with a negligible loss in PSNR. We present an alternate approach to address the classification problem which is equivalent to machine learning. Implementation results show that the proposed method reduces encoding time to about 20% of the reference implementation with average loss of 0.05 dB in PSNR.

Study of magnetoresistance and conductance of bicrystal grain boundary in La0.67Ba0.33MnO3 thin film

La0.67Ba0.33MnO3 (LBMO) thin film is deposited on a 36.7degrees SrTiO3 bicrystal substrate using laser ablation technique. A microbridge is created across bicrystal grain boundary and its characteristics are compared with a microbridge on the LBMO film having no grain boundary. Presence of grain boundary exhibits substantial magnetoresistance ratio (MRR) in the low field and low temperature region. Bicrystal grain boundary contribution in MRR disappears at temperature T > 175 K. At low temperature, I-V characteristic of the microbridge across bicrystal grain boundary is nonlinear. Analysis of temperature dependence of dynamic conductance-voltage characteristics of the bicrystal grain boundary indicates that at low temperatures (T < 175 K) carrier transport across the grain boundary in LBMO film is dominated by inelastic tunneling via pairs of manganese atoms and tunneling through disordered oxides. At higher temperatures (T > 175 K), magnetic scattering process is dominating. Decrease of bicrystal grain boundary contribution in magnetoresistance with the increase in temperature is due to enhanced spin-flip scattering process.

Effect of granularity on the insulator-superconductor transition in ultrathin Bi films

We have studied the insulator-superconductor transition (IST) by tuning the thickness in quench-condensed Bi films. The resistive transitions of the superconducting films are smooth and can be considered to represent ''homogeneous'' films. The observation of an IST very close to the quantum resistance for pairs R-square(N) similar to h/4e(2) on several substrates supports this idea. The relevant length scales here are the localization length, and the coherence length. However, at the transition, the localization length is much higher than the superconducting coherence length, contrary to expectation for a "homogeneous" transition. This suggests the invalidity of a purely fermionic model for the transition. Furthermore, the current-voltage characteristics of the superconducting films are hysteretic, and show the films to be granular. The relevant energy scales here are the Josephson coupling energy and the charging energy. However, Josephson coupling energies (E-J) and the charging energies (E-c) at the IST, they are found to obey the relation E-j < E-c. This is again contrary to expectation, for the IST in a granular or inhomogeneous system. Hence, a purely bosonic picture of the transition is also inconsistent with our observations. We conclude that the IST observed in our experiments may be either an intermediate case between the fermioinc and bosonic mechanisms, or in a regime of charge and vortex dynamics for which a quantitative analysis has not yet been done.

BCS-BEC crossover induced by a synthetic non-Abelian gauge field

We investigate the ground state of interacting spin-1/2 fermions in three dimensions at a finite density (rho similar to k(F)(3)) in the presence of a uniform non-Abelian gauge field. The gauge-field configuration (GFC) described by a vector lambda equivalent to (lambda(x),lambda(y),lambda(z)), whose magnitude lambda determines the gauge coupling strength, generates a generalized Rashba spin-orbit interaction. For a weak attractive interaction in the singlet channel described by a small negative scattering length (k(F)vertical bar a(s)vertical bar less than or similar to 1), the ground state in the absence of the gauge field (lambda = 0) is a BCS (Bardeen-Cooper-Schrieffer) superfluid with large overlapping pairs. With increasing gauge-coupling strength, a non-Abelian gauge field engenders a crossover of this BCS ground state to a BEC (Bose-Einstein condensate) of bosons even with a weak attractive interaction that fails to produce a two-body bound state in free vacuum (lambda = 0). For large gauge couplings (lambda/k(F) >> 1), the BEC attained is a condensate of bosons whose properties are solely determined by the Rashba gauge field (and not by the scattering length so long as it is nonzero)-we call these bosons ``rashbons.'' In the absence of interactions (a(s) = 0(-)), the shape of the Fermi surface of the system undergoes a topological transition at a critical gauge coupling lambda(T). For high-symmetry GFCs we show that the crossover from the BCS superfluid to the rashbon BEC occurs in the regime of lambda near lambda(T). In the context of cold atomic systems, these results make an interesting suggestion of obtaining BCS-BEC crossover through a route other than tuning the interaction between the fermions.

Lubricant Degradation and Related Wear of a Steel Pin in Lubricated Sliding Against a Steel Disc

In lubricated sliding contacts, components wear out and the lubricating oil ages with time. The present work explores the interactive influence between lubricant aging and component wear. The flat face of a steel pin is slid against a rotating steel disk under near isothermal conditions while the contact is immersed in a reservoir of lubricant (hexadecane). The chemical changes in the oil with time are measured by vibrational spectroscopy and gas chromatography. The corresponding chemistry of the pin surface is recorded using X-ray photoelectron spectroscopy while the morphology of the worn pins; surface and subsurface, are observed using a combination of focused ion beam milling and scanning electron 5 microscopy. When compared to thermal auto-oxidation of the lubricant alone, steel on steel friction and wear are found to accentuate the decomposition of oil and to reduce the beneficial impact of antioxidants. The catalytic action of nascent iron, an outcome of pin wear and disk wear, is shown to contribute to this detrimental effect. Over long periods of sliding, the decomposition products of lubricant aging on their own, as well as in conjunction with their products of reaction with iron, generate a thick tribofilm that is highly protective in terms of friction and wear.

Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Searth Auctions

In pay-per click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their ads. This auction is typically conducted for a number of rounds (say T). There are click probabilities mu_ij associated with agent-slot pairs. The search engine's goal is to maximize social welfare, for example, the sum of values of the advertisers. The search engine does not know the true value of an advertiser for a click to her ad and also does not know the click probabilities mu_ij s. A key problem for the search engine therefore is to learn these during the T rounds of the auction and also to ensure that the auction mechanism is truthful. Mechanisms for addressing such learning and incentives issues have recently been introduced and would be referred to as multi-armed-bandit (MAB) mechanisms. When m = 1,characterizations for truthful MAB mechanisms are available in the literature and it has been shown that the regret for such mechanisms will be O(T^{2/3}). In this paper, we seek to derive a characterization in the realistic but nontrivial general case when m > 1 and obtain several interesting results.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Conformational changes of the chaperone SecB upon binding to a model substrate - bovine pancreatic trypsin inhibitor (BPTI)

SecB is a homotetrameric cytosolic chaperone that forms part of the protein translocation machinery in E. coli. Due to SecB, nascent polypeptides are maintained in an unfolded translocation-competent state devoid of tertiary structure and thus are guided to the translocon. In vitro SecB rapidly binds to a variety of ligands in a non-native state. We have previously investigated the bound state conformation of the model substrate bovine pancreatic trypsin inhibitor (BPTI) as well as the conformation of SecB itself by using proximity relationships based on site-directed spin labeling and pyrene fluorescence methods. It was shown that SecB undergoes a conformational change during the process of substrate binding. Here, we generated SecB mutants containing but a single cysteine per subunit or an exposed highly reactive new cysteine after removal of the nearby intrinsic cysteines. Quantitative spin labeling was achieved with the methanethiosulfonate spin label (MTS) at positions C97 or E90C, respectively. Highfield (W-band) electron paramagnetic resonance (EPR) measurements revealed that with BPTI present the spin labels are exposed to a more polar/hydrophilic environment. Nanoscale distance measurements with double electron-electron resonance (DEER) were in excellent agreement with distances obtained by molecular modeling. Binding of BPTI also led to a slight change in distances between labels at C97 but not at E90C. While the shorter distance in the tetramer increased, the larger diagonal distance decreased. These findings can be explained by a widening of the tetrameric structure upon substrate binding much like the opening of two pairs of scissors.

A Distributed Approach to Interference Cancellation

In this paper, we propose and analyze a novel idea of performing interference cancellation (IC) in a distributed/cooperative manner, with a motivation to provide multiuser detection (MUD) benefit to nodes that have only a single user detection capability. In the proposed distributed interference cancellation (DIC) scheme, during phase-1 of transmission, an MUD capable cooperating relay node estimates all the sender nodes' bits through multistage interference cancellation. These estimated bits are then sent by the relay node on orthogonal tones in phase-2 of transmission. The destination nodes receive these bit estimates and use them for interference estimation/cancellation, thus achieving IC benefit in a distributed manner. For this DIC scheme, we analytically derive an exact expression for the bit error rate (BER) in a basic five-node network (two source-destination node pairs and a cooperating relay node) on AWGN channels. Analytical BER results are shown to match with simulation results. For more general system scenarios, including more than two source-destination pairs and fading channels without and with space-time coding, we present simulation results to establish the potential for improved performance in the proposed distributed approach to interference cancellation. We also present a linear version of the proposed DIC.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Two-timescale Q-learning Algorithms with an Application to Routing in Networks

We propose two variants of the Q-learning algorithm that (both) use two timescales. One of these updates Q-values of all feasible state-action pairs at each instant while the other updates Q-values of states with actions chosen according to the ‘current ’ randomized policy updates. A sketch of convergence of the algorithms is shown. Finally, numerical experiments using the proposed algorithms for routing on different network topologies are presented and performance comparisons with the regular Q-learning algorithm are shown.