Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Network-error correcting codes using small fields

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.

Accelerating Reduction for Enabling Fast Multiplication over Large Binary Fields

In this paper we present a hardware-software hybrid technique for modular multiplication over large binary fields. The technique involves application of Karatsuba-Ofman algorithm for polynomial multiplication and a novel technique for reduction. The proposed reduction technique is based on the popular repeated multiplication technique and Barrett reduction. We propose a new design of a parallel polynomial multiplier that serves as a hardware accelerator for large field multiplications. We show that the proposed reduction technique, accelerated using the modified polynomial multiplier, achieves significantly higher performance compared to a purely software technique and other hybrid techniques. We also show that the hybrid accelerated approach to modular field multiplication is significantly faster than the Montgomery algorithm based integrated multiplication approach.

Structured Dispersion Matrices From Division Algebra Codes for Space-Time Shift Keying

We propose a novel method of constructing Dispersion Matrices (DM) for Coherent Space-Time Shift Keying (CSTSK) relying on arbitrary PSK signal sets by exploiting codes from division algebras. We show that classic codes from Cyclic Division Algebras (CDA) may be interpreted as DMs conceived for PSK signal sets. Hence various benefits of CDA codes such as their ability to achieve full diversity are inherited by CSTSK. We demonstrate that the proposed CDA based DMs are capable of achieving a lower symbol error ratio than the existing DMs generated using the capacity as their optimization objective function for both perfect and imperfect channel estimation.

The effect of minor addition of Ni on the microstructural evolution and mechanical properties of suction cast Al-0.14 at. pct Sc binary alloy

Aluminum scandium binary alloys represent a promising precipitation-hardening alloy system. However, the hardness of the binary alloys decreases with the rapid coarsening of Al3Sc precipitate during high-temperature aging. In the current study, we report a new approach to compensate for the loss of mechanical properties by combining rapid solidification with very small ternary addition of transition metal Ni. This addition yields dispersion, and at a critical concentration improves the mechanical properties. We explore additions of a maximum of 0.06 at. pct of Nickel to a binary Al-0.14 at. pct Sc alloy, which yield nickel-rich dispersions. We report two kinds of biphasic dispersions containing AlNi2Sc/Al9Ni2 and alpha-Al/Al9Ni2 phase combinations. The maximum improvement in mechanical properties occurs with the addition of 0.045 at. pct Ni with a yield strength of 239 +/- A 7 MPa for an aging treatment at 583 K (310 A degrees C) for 15 hours. DOI: 10.1007/s11661-013-1624-z (C) The Minerals, Metals & Materials Society and ASM International 2013

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

Free energy barriers for homogeneous crystal nucleation in a eutectic system of binary hard spheres

In this study, the free energy barriers for homogeneous crystal nucleation in a system that exhibits a eutectic point are computed using Monte Carlo simulations. The system studied is a binary hard sphere mixture with a diameter ratio of 0.85 between the smaller and larger hard spheres. The simulations of crystal nucleation are performed for the entire range of fluid compositions. The free energy barrier is found to be the highest near the eutectic point and is nearly five times that for the pure fluid, which slows down the nucleation rate by a factor of 10(-31). These free energy barriers are some of highest ever computed using simulations. For most of the conditions studied, the composition of the critical nucleus corresponds to either one of the two thermodynamically stable solid phases. However, near the eutectic point, the nucleation barrier is lowest for the formation of the metastable random hexagonal closed packed (rhcp) solid phase with composition lying in the two-phase region of the phase diagram. The fluid to solid phase transition is hypothesized to proceed via formation of a metastable rhcp phase followed by a phase separation into respective stable fcc solid phases.

Determination of favorable inter-particle interactions for formation of substitutionally ordered solid phases from a binary mixture of oppositely charged colloidal suspensions

The solid phase formed by a binary mixture of oppositely charged colloidal particles can be either substitutionally ordered or substitutionally disordered depending on the nature and strength of interactions among the particles. In this work, we use Monte Carlo molecular simulations along with the Gibbs-Duhem integration technique to map out the favorable inter-particle interactions for the formation of substitutionally ordered crystalline phases from a fluid phase. The inter-particle interactions are modeled using the hard core Yukawa potential but the method can be easily extended to other systems of interest. The study obtains a map of interactions depicting regions indicating the type of the crystalline aggregate that forms upon phase transition.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Solvation dynamics of tryptophan in water-dimethyl sulfoxide binary mixture: In search of molecular origin of composition dependent multiple anomalies

Experimental and simulation studies have uncovered at least two anomalous concentration regimes in water-dimethyl sulfoxide (DMSO) binary mixture whose precise origin has remained a subject of debate. In order to facilitate time domain experimental investigation of the dynamics of such binary mixtures, we explore strength or extent of influence of these anomalies in dipolar solvation dynamics by carrying out long molecular dynamics simulations over a wide range of DMSO concentration. The solvation time correlation function so calculated indeed displays strong composition dependent anomalies, reflected in pronounced non-exponential kinetics and non-monotonous composition dependence of the average solvation time constant. In particular, we find remarkable slow-down in the solvation dynamics around 10%-20% and 35%-50% mole percentage. We investigate microscopic origin of these two anomalies. The population distribution analyses of different structural morphology elucidate that these two slowing down are reflections of intriguing structural transformations in water-DMSO mixture. The structural transformations themselves can be explained in terms of a change in the relative coordination number of DMSO and water molecules, from 1DMSO:2H(2)O to 1H(2)O:1DMSO and 1H(2)O:2DMSO complex formation. Thus, while the emergence of first slow down (at 15% DMSO mole percentage) is due to the percolation among DMSO molecules supported by the water molecules (whose percolating network remains largely unaffected), the 2nd anomaly (centered on 40%-50%) is due to the formation of the network structure where the unit of 1DMSO:1H(2)O and 2DMSO:1H(2)O dominates to give rise to rich dynamical features. Through an analysis of partial solvation dynamics an interesting negative cross-correlation between water and DMSO is observed that makes an important contribution to relaxation at intermediate to longer times.

Study on important diffusion parameters of binary Ni3Sn4 phase

Important diffusion parameters, such as-parabolic growth constant, integrated diffusivity, ratio of intrinsic diffusivities of species Ni and Sn, Kirkendall marker velocity and the activation energy for diffusion kinetics of binary Ni3Sn4 phase have been investigated with the help of incremental diffusion couple technique (Sn/Ni0.57Sn0.43) in the temperature range 200-150 degrees C. Low activation energy extracted from Arrhenius plot indicates grain boundary controlled diffusion process. The species Sn is three times faster than Ni at 200 degrees C. Further, the activation energy of Sn tracer diffusivity is greater than that of Ni.

Microstructural and mechanical behavior study of suction cast Nb-Si binary alloys

The solidification pathways of Nb rich Nb-Si alloys when processed under non-equilibrium conditions require understanding. Continuing with our earlier work on alloying additions in single eutectic composition 1,2], we report a detailed characterization of the microstructures of Nb-Si binary alloys with wide composition range (10-25 at% Si). The alloys are processed using chilled copper mould suction casting. This has allowed us to correlate the evolution of microstructure and phases with different possible solidification pathways. Finally these are correlated with mechanical properties through studies on deformation using mechanical testing under indentation and compressive loads. It is shown that microstructure modification can significantly influence the plasticity of these alloys.