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.

Control of Molecular Weight and Polydispersity of Hyperbranched Polymers Using a Reactive B(3) Core: A Single-Step Route to Orthogonally Functionalizable Hyperbranched Polymers

Molecular weight and polydispersity are two structural features of hyperbranched polymers that are difficult to control because of the statistical nature of the step-growth polycondensation of AB(2) type monomers; the statistical growth also causes the polydispersity index to increase with percent conversion (or molecular weight). We demonstrate that using controlled amounts of a specifically designed B(3) core, containing B-type functionality that are more reactive than those present in the AB(2) monomer, both the molecular weight and the polydispersity can be readily controlled; the PDI was shown to improve with increasing mole-fraction of the B(3) core while the polymer molecular weight showed an expected decrease. Incorporation of a ``clickable'' propargyl group in the B(3) core unit permitted the generation of a core-functionalizable hyperbranched polymer. Importantly, this clickable core, in combination with a recently developed AB(2) monomer, wherein the B-type groups are allyl ethers and A is an hydroxyl group, led to the generation of a hyperbranched polymer carrying orthogonally functionalizable core and peripheral groups, via a single-step melt polycondensation. Selective functionalization of the core and periphery using two different types of chromophores was achieved, and the occurrence of fluorescence resonance energy transfer (FRET) between the donor and acceptor chromophores was demonstrated.

Utilizing an ionic liquid for synthesizing a soft matter polymer ``gel'' electrolyte for high rate capability lithium-ion batteries

A cross-linked polymer ``gel'' electrolyte obtained from free radical polymerization of a vinyl monomer (acrylonitrile; AN) in a room temperature ionic liquid electrolyte (N,N-methyl butyl pyrrolidinium-bis (trifluoromethanesulphonyl)imide-lithium bis(trifluoromethanesulphonyl) imide;LiTFSI-[Py(1,4)-TFSI]) for application in high rate capability rechargeable lithium-ion batteries is discussed here. This is a novel alternative compared to the often employed approach of using a molecular liquid as the medium for performing the polymerization reaction. The polymer ``gel'' electrolytes (AN:Py(1,4)-TFSI = 0.16-0.18, w/w) showed remarkable compliable mechanical strength and higher thermal stability compared to LiTFSI-[Py(1,4)-TFSI]. Despite two orders increase in magnitude of viscosity of polymer ``gels'', the room temperature ionic conductivity of the ``gels'' (1.1 x 10(-3)-1.7 x 10(-3) Omega(-1) cm(-1)) were nearly identical to that of the ionic liquid (1.8 x 10(-3) Omega(-1) cm(-1)). The present ``gel'' electrolytes did not exhibit any ageing effects on ionic conductivity similar to the conventional polymer gel electrolytes (e.g. high molecular weight polymer + salt + high dielectric constant molecular solvent). The disorder (ionic liquid) to a relative order (cross-linked polymer electrolyte) transformation does not at all influence the concentration of conducting species. The polymer framework is still able to provide efficient pathways for fast ion transport. Unlike the ionic liquid which is impossible to assemble without a conventional separator in a cell, the polymer ``gel'' electrolyte could be conveniently assembled without a separator in a Li vertical bar lithium iron phosphate (LiFePO(4)) cell. Compared to the ionic liquid, the ``gel'' electrolyte showed exceptional cyclability and rate capability (current density: 35-760 mA g(-1) with LiFePO(4) electronically wired with carbon (amorphous or multiwalled nanotube [MWCNT]).

Control of Molecular Weight and Polydispersity of Hyperbranched Polymers Using a Reactive B(3) Core: A Single-Step Route to Orthogonally Functionalizable Hyperbranched Polymers

Molecular weight and polydispersity are two structural features of hyperbranched polymers that are difficult to control because of the statistical nature of the step-growth polycondensation of AB(2) type monomers; the statistical growth also causes the polydispersity index to increase with percent conversion (or molecular weight). We demonstrate that using controlled amounts of a specifically designed B(3) core, containing B-type functionality that are more reactive than those present in the AB(2) monomer, both the molecular weight and the polydispersity can be readily controlled; the PDI was shown to improve with increasing mole-fraction of the B(3) core while the polymer molecular weight showed an expected decrease. Incorporation of a ``clickable'' propargyl group in the B(3) core unit permitted the generation of a core-functionalizable hyperbranched polymer. Importantly, this clickable core, in combination with a recently developed AB(2) monomer, wherein the B-type groups are allyl ethers and A is an hydroxyl group, led to the generation of a hyperbranched polymer carrying orthogonally functionalizable core and peripheral groups, via a single-step melt polycondensation. Selective functionalization of the core and periphery using two different types of chromophores was achieved, and the occurrence of fluorescence resonance energy transfer (FRET) between the donor and acceptor chromophores was demonstrated.

Corrosion of 310 stainless steel in H2 H2O-H2S gas mixtures; studies at constant temperature and fixed oxygen potential

Corrosion of SAE 310 stainless steel in H2-H2O-H2S gas mixtures was studied at a constant temperature of 1150 K. Reactive gas mixtures were chosen to yield a constant oxygen potential of approximately 6 × 10-13 Nm-2 and sulfur potentials ranging from 0.19 × 10-2 Nm-2 to 33 × 10-2 Nm-2. The kinetics of corrosion were determined using a thermobalance, and the scales were analyzed using metallography, scanning electron microscopy, and energy dispersive X-ray analysis. Two corrosion regimes, which were dependent on sulfur potential, were identified. At high sulfur potentials (P S 2 ± 2.7 × 10-2 Nm-2) the corrosion rates were high, the kinetics obeyed a linear rate equation, and the scales consisted mainly of sulfide phases similar to those observed from pure sulfidation. At low sulfur potentials (P S 2 ± 0.19 × 10-2 Nm-2) the corrosion rates were low, the kinetics obeyed a parabolic rate equation, and scales consisted mainly of oxide phases. Thermochemical diagrams for the Fe-Cr-S-O, Fe-Ni-S-O, Cr-Ni-S-O, and Si-Cr-S-O systems were constructed, and the experimental results are discussed in relation to these diagrams. Based on this comparison, reasonable corrosion mechanisms were developed. At high sulfur potentials, oxide and sulfide phases initially nucleate as separate islands. Overgrowth of the oxide by the sulfide occurs and an exchange reaction governs the corrosion process. Preoxidation at low oxygen potentials and 1150 K is beneficial in suppressing sulfidation at high sulfur potentials.

Interference Alignment Algorithms for the K User Constant MIMO Interference Channel

This paper considers the degrees of freedom (DOF) for a K user multiple-input multiple-output (MIMO) M x N interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.

Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Evaluation of 2D image reconstruction using fan-beam FBP algorithm with no backprojection weight from WLP completed truncated projection data

This paper presents the image reconstruction using the fan-beam filtered backprojection (FBP) algorithm with no backprojection weight from windowed linear prediction (WLP) completed truncated projection data. The image reconstruction from truncated projections aims to reconstruct the object accurately from the available limited projection data. Due to the incomplete projection data, the reconstructed image contains truncation artifacts which extends into the region of interest (ROI) making the reconstructed image unsuitable for further use. Data completion techniques have been shown to be effective in such situations. We use windowed linear prediction technique for projection completion and then use the fan-beam FBP algorithm with no backprojection weight for the 2-D image reconstruction. We evaluate the quality of the reconstructed image using fan-beam FBP algorithm with no backprojection weight after WLP completion.

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that space-time trellis codes (STTC) can be used to achieve these objectives. In particular, we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of construction does not exist. Delay diversity code (rate-1) is known to achieve full-diversity, for any number of transmit antennas and any signal set, but does not give a good coding gain. A product distance code based delay diversity scheme (Tarokh, V. et al., IEEE Trans. Inform. Theory, vol.44, p.744-65, 1998) enables one to improve the coding gain and construct STTCs for any given number of states using coding in conjunction with delay diversity; it was stated as an open problem. We achieve such a construction. We assume a shift register based model to construct an STTC for any state complexity. We derive a sufficient condition for this STTC to achieve full-diversity, based on the delay diversity scheme. This condition provides a framework to do coding in conjunction with delay diversity for any signal constellation. Using this condition, we provide a formal rate-1 STTC construction scheme for PSK signal sets, for any number of transmit antennas and any given number of states, which achieves full-diversity and gives a good coding gain.

Analysis of LDPC Codes for Compression of Nonuniform Sources with Side Information Using Density Evolution

In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte Carlo simulation results show that highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.

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.

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.