Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

A Generalized Enthalpy Update Scheme for Solidification of a Binary Alloy with Solid Phase Movement

A generalized enthalpy update scheme is presented for evaluating solid and liquid fractions during the solidification of binary alloys, taking solid movement into consideration. A fixed-grid, enthalpy-based method is developed such that the scheme accounts for equilibrium as well as for nonequilibrium solidification phenomena, along with solid phase movement. The effect of solid movement on the solidification interface shape and macrosegregation is highlighted.

Performance Analysis of a Cooperative System with Rateless Codes and Buffered Relays

In a cooperative relay-assisted communication system that uses rateless codes, packets get transmitted from a source to a destination at a rate that depends on instantaneous channel states of the wireless links between nodes. When multiple relays are present, the relay with the highest channel gain to the source is the first to successfully decode a packet from the source and forward it to the destination. Thus, the unique properties of rateless codes ensure that both rate adaptation and relay selection occur without the transmitting source or relays acquiring instantaneous channel knowledge. In this paper, we show that in such cooperative systems, buffering packets at relays significantly increases throughput. We develop a novel analysis of these systems that combines the communication-theoretic aspects of cooperation over fading channels with the queuing-theoretic aspects associated with buffering. Closed-form expressions are derived for the throughput and end-to-end delay for the general case in which the channels between various nodes are not statistically identical. Corresponding results are also derived for benchmark systems that either do not exploit spatial diversity or do not buffer packets. Altogether, our results show that buffering - a capability that will be commonly available in practical deployments of relays - amplifies the benefits of cooperation.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

Dependence of diffusivity on density and solute diameter in liquid phase: A molecular dynamics study of Lennard-Jones system

Investigations into the variation of self-diffusivity with solute radius, density, and degree of disorder of the host medium is explored. The system consists of a binary mixture of a relatively smaller sized solute, whose size is varied and a larger sized solvent interacting via Lennard-Jones potential. Calculations have been performed at three different reduced densities of 0.7, 0.8, and 0.933. These simulations show that diffusivity exhibits a maximum for some intermediate size of the solute when the solute diameter is varied. The maximum is found at the same size of the solute at all densities which is at variance with the prediction of the levitation effect. In order to understand this anomaly, additional simulations were carried out in which the degree of disorder has been varied while keeping the density constant. The results show that the diffusivity maximum gradually disappears with increase in disorder. Disorder has been characterized by means of the minimal spanning tree. Simulations have also been carried out in which the degree of disorder is constant and only the density is altered. The results from these simulations show that the maximum in diffusivity now shifts to larger distances with decrease in density. This is in agreement with the changes in void and neck distribution with density of the host medium. These results are in excellent agreement with the predictions of the levitation effect. They suggest that the effect of disorder is to shift the maximum in diffusivity towards smaller solute radius while that of the decrease in density is to shift it towards larger solute radius. Thus, in real systems where the degree of disorder is lower at higher density and vice versa, the effect due to density and disorder have opposing influences. These are confirmed by the changes seen in the velocity autocorrelation function, self part of the intermediate scattering function and activation energy. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.3701619]

Online Computation of Hysteresis Boundary for Constant Switching Frequency Current-Error Space-Vector-Based Hysteresis Controller for VSI-Fed IM Drives

This paper proposes a current-error space-vector-based hysteresis controller with online computation of boundary for two-level inverter-fed induction motor (IM) drives. The proposed hysteresis controller has got all advantages of conventional current-error space-vector-based hysteresis controllers like quick transient response, simplicity, adjacent voltage vector switching, etc. Major advantage of the proposed controller-based voltage-source-inverters-fed drive is that phase voltage frequency spectrum produced is exactly similar to that of a constant switching frequency space-vector pulsewidth modulated (SVPWM) inverter. In this proposed hysteresis controller, stator voltages along alpha- and beta-axes are estimated during zero and active voltage vector periods using current errors along alpha- and beta-axes and steady-state model of IM. Online computation of hysteresis boundary is carried out using estimated stator voltages in the proposed hysteresis controller. The proposed scheme is simple and capable of taking inverter upto six-step-mode operation, if demanded by drive system. The proposed hysteresis-controller-based inverter-fed drive scheme is experimentally verified. The steady state and transient performance of the proposed scheme is extensively tested. The experimental results are giving constant frequency spectrum for phase voltage similar to that of constant frequency SVPWM inverter-fed drive.

The force distribution function of an oscillator model of polymer stretching at constant velocity

Recent simulations of the stretching of tethered biopolymers at a constant speed v (Ponmurugan and Vemparala, 2011 Phys. Rev. E 84 060101(R)) have suggested that for any time t, the distribution of the fluctuating forces f responsible for chain deformation is governed by a relation of the form P(+ f)/ P(- f) = expgamma f], gamma being a coefficient that is solely a function of v and the temperature T. This result, which is reminiscent of the fluctuation theorems applicable to stochastic trajectories involving thermodynamic variables, is derived in this paper from an analytical calculation based on a generalization of Mazonka and Jarzynski's classic model of dragged particle dynamics Mazonka and Jarzynski, 1999 arXiv:cond-\textbackslashmat/9912121v1]. However, the analytical calculations suggest that the result holds only if t >> 1 and the force fluctuations are driven by white rather than colored noise; they further suggest that the coefficient gamma in the purported theorem varies not as v(0.15)T-(0.7), as indicated by the simulations, but as vT(-1).

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parameterization of the maximum-likelihood decoding complexity for linear codes. In this paper, we show the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.

Synthesis and characterization of high molecular weight polyaniline for organic electronic applications

High molecular weight polyaniline (PANI) was synthesized by a combined procedure incorporating various synthesis methods. Temperature and open circuit potential of the reaction mixture were collected to monitor the reaction progress. The polymer is characterized by various techniques including gel permeation chromatography, dynamic light scattering, infrared spectroscopy, solid-state nuclear magnetic resonance, and differential scanning calorimetry for elucidating the molecular architecture obtained by this method. As-synthesized PANI was found to possess high molecular weight, reduced branching, reduced cross-linking, and to predominantly consist of linear polymer chains. This polymer was also found to be more stable in solution form. JV characteristics of as-synthesized PANI films indicate a high current density which is due to increased free pathways and less traps for the charge transport to occur in PANI films. POLYM. ENG. SCI., 2012. (C) 2012 Society of Plastics Engineers

Anomalous structural and dynamical phase transitions of soft colloidal binary mixtures

We report microscopic structural and dynamical measurements on binary mixtures of homopolymers and polymer grafted nanoparticles at high densities in good solvent. We find strong and unexpected anomalies in the structure and dynamics of these binary mixtures, including appearance of spontaneous orientational alignment, as a function of added homopolymers of different molecular weights. Our experiments point to the possibility of exploiting the phase space in density and homopolymer size, of such hybrid systems, to create new materials with novel structural and physical properties.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Thermodynamics of Congruent Oxidation

Congruent oxidation occurs when an alloy oxidizes at constant oxygen chemical potential and temperature to an oxide in which the ratio of metallic components is the same as in the alloy. In alloys that undergo congruent oxidation concentration gradients near the surface are minimized. In this work thermodynamic conditions for congruent oxidation of binary and ternary alloys are formulated using the regular solution model to describe thermodynamic mixing properties. The conditions under which congruent oxidation can occur are identified. Congruent oxidation of a binary alloy X-Y will occur only if difference in oxygen potential for the oxidation of the two pure metals is less than twice the difference in regular solution parameters for the oxide and alloy phases (Omega(O)-Omega(A)). In the case of ternary alloys, congruency requirements for both two-phase and three-phase equilibria are discussed. Since the conditions for congruent oxidation of ternary alloy X-Y-Z depends on many parameters, the effect of systematic variation of the binary sets of regular solution parameters on the congruent composition is explored by numerical solution of the governing equations.