Combinatorial Representations of Block Codes

We look at graphical descriptions of block codes known as trellises, which illustrate connections between algebra and graph theory, and can be used to develop powerful decoding algorithms. Trellis sizes for linear block codes are known to grow exponentially with the code parameters. Of considerable interest to coding theorists therefore, are more compact descriptions called tail-biting trellises which in some cases can be much smaller than any conventional trellis for the same code . We derive some interesting properties of tail-biting trellises and present a new decoding algorithm.

Flux Partitioning of Species Approach in Binary Interdiffusion Process

Validation of the flux partitioning of species model has been illustrated. Various combinations of inequality expression for the fluxes of species A and B in two successively grown hypothetical intermetallic phases in the interdiffusion zone have been considered within the constraints of this concept. Furthermore, ratio of intrinsic diffusivities of the species A and B in those two phases has been correlated in four different cases. Moreover, complete and or partial validation or invalidation of this model with respect to both the species, has been proven theoretically and also discussed with the Co-Si system as an example.

Re-entrant behavior in dynamics of binary mixtures of soft hybrid nanocolloids and homopolymers

We present results of measurements of temperature and wavevector dependent dynamics in binary mixtures of soft polymer grafted nanoparticles and linear homopolymers. We find evidence of melting of the dynamically arrested state of the soft nanocolloids with addition of linear polymers followed by a re-entrant slowing down of the dynamics with further increase in polymer density, depending on the size ratio, delta, of the polymers and the nanocolloids. For higher delta the re-entrant behavior is not observed, even for the highest added polymer density, explored here. Possible explanation of the observed dynamics in terms of the presence of a double - glass phase is provided. (C) 2011 American Institute of Physics. [doi:10.1063/1.3644930]

Generalized Silver Codes

For an n(t) transmit, n(r) receive antenna system (n(t) x n(r) system), a full-rate space time block code (STBC) transmits at least n(min) = min(n(t), n(r))complex symbols per channel use. The well-known Golden code is an example of a full-rate, full-diversity STBC for two transmit antennas. Its ML-decoding complexity is of the order of M(2.5) for square M-QAM. The Silver code for two transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of M(2). Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for n(r) >= n(t)) but have a high ML-decoding complexity of the order of M(ntnmin) (for n(r) < n(t), the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for 2(a) transmit antennas and any n(r) with reduced ML-decoding complexity of the order of M(nt)(n(min)-3/4)-0.5 is presented. The codes constructed are also information lossless for >= n(t), like the Perfect codes, and allow higher mutual information than the comparable punctured Perfect codes for n(r) < n(t). These codes are referred to as the generalized Silver codes, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver code and the Golden code for two transmit antennas. Simulation results of the symbol error rates for four and eight transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Distributed space-time block codes (DSTBCs) from complex orthogonal designs (CODs) (both square and nonsquare), coordinate interleaved orthogonal designs (CIODs), and Clifford unitary weight designs (CUWDs) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using amplify and forward protocol. For such networks, in this paper, three new classes of high rate, training-symbol embedded (TSE) SSD DSTBCs are constructed: TSE-CODs, TSE-CIODs, and TSE-CUWDs. The proposed codes include the training symbols inside the structure of the code which is shown to be the key point to obtain the SSD property along with the channel estimation capability. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations and the constellations for which TSE-CIODs and TSE-CUWDs offer full-diversity are characterized. It is shown that DSTBCs from nonsquare TSE-CODs provide better rates (in symbols per channel use) when compared to the known SSD DSTBCs for relay networks. Important from the practical point of view, the proposed DSTBCs do not contain any zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on/off transitions within every codeword, and, thus, avoid the antenna switching problem.

Fluctuation quench and hydrophobic collapse of polymers and biopolymers in water-DMSO binary mixture at low DMSO concentration

Binary mixtures have strong influence on activities of polymers and biopolymers even at low cosolvent concentration. Among the several aqueous binary mixtures studied, water-DMSO especially stands out for its unusual behavior at certain specific concentrations of DMSO. In the present work, we study the effect of water-DMSO binary mixture on polymers and biopolymers by taking a simple linear hydrocarbon chain of intermediate length (n = 30) and the protein lysozyme, respectively. We find that at a mole fraction of 0.05 of DMSO (x(DMSO) = 0.05) in aqueous solution, the hydrocarbon chain adopts the collapsed conformation as the most stable and rigid state. In this case of 0.05 mole fraction of DMSO in bulk, the DMSO concentration in the first hydration layer around the polymer is found to be as large as 17%. Formation of such hydrophobic environment around the polymer is the reason for the collapsed state gaining so much stability. Interestingly, similar quench of conformational fluctuation is also observed for the protein investigated. It is observed that in the case of alkane polymer chains, long wavelength fluctuation gets easily quenched, the polymer being purely hydrophobic. However, in case of the protein, quench of fluctuation is prominent only at the hydrophobic surface, and quench of long wavelength fluctuation becomes insignificant for the full protein. As protein contains both hydrophobic and hydrophilic moieties, the extent of quench of conformational fluctuation with respect to that in pure water is almost half for the biopolymer complex (16.83%) than the same for pure hydrophobic polymer chain (32.43%).

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Thermal Weight Functions and Stress Intensity Factors for Bonded Dissimilar Media Using Body Analogy

In this study, an analytical method is presented for the computation of thermal weight functions in two dimensional bi-material elastic bodies containing a crack at the interface and subjected to thermal loads using body analogy method. The thermal weight functions are derived for two problems of infinite bonded dissimilar media, one with a semi-infinite crack and the other with a finite crack along the interface. The derived thermal weight functions are shown to reduce to the already known expressions of thermal weight functions available in the literature for the respective homogeneous elastic body. Using these thermal weight functions, the stress intensity factors are computed for the above interface crack problems when subjected to an instantaneous heat source.