Phase Separation in Binary Nearly-Hard-Sphere Colloids: Evidence for the Depletion Force

A binary aqueous suspension of large (L) and small (S) nearly-hard-sphere colloidal polystyrene spheres is shown to segregate spontaneously into L-rich and S-rich regions for suitable choices of volume fraction and size ratio. This is the first observation of such purely entropic phase separation of chemically identical species in which at least one component remains fluid. Simple theoretical arguments are presented to make this effect plausible.

Solid state amorphization in binary Ti---Ni, Ti---Cu and ternary Ti---Ni---Cu system by mechanical alloying

An amorphous phase has been synthesized by mechanical alloying in a planetary mill over a nickel content range of 10�70 at.% in the Ti---Ni system and a copper content range of 10�50 at.% in the Ti---Cu system. In the case of ternary Ti---Ni---Cu alloys the glass-forming composition range has been found to be given by x = 10�20 for Ti60Ni40 ? xCux, x = 10 � 30 for Ti50Ni50 ? xCux and x = 10 � 40 for Ti40Ni60 ? xCux alloys. The difficulty in the amorphization of copper-rich compositions is explained in the light of enthalpy composition diagrams calculated for the ternary solid solution and the amorphous phase.

Wet chemical formation of nanoparticles of binary perovskites through isothermal gel to crystallite conversion

Coarse BO2·xH2O (2 < x < 80) gels, free of anion contaminants react with A(OH)2 under refluxing conditions at 70�100°C giving rise to crystallites of single phased, nanometer size powders of ABO3 perovskites (A = Ba, Sr, Ca, Mg, Pb; B = Zr, Ti, Sn). Solid solutions of perovskites could be prepared from compositionally modified gels or mixtures of A(OH)2. Donor doped perovskites could also be prepared from the same method so that the products after processing are often semiconducting. Faster interfacial diffusion of A2+ ions into the gel generates the crystalline regions whose composition is controllable by the A/B ratio as well as the A(OH)2 concentration.

MIMO Precoding With X- and Y- Codes

We consider a slow fading multiple-input multiple-output (MIMO) system with channel state information at both the transmitter and receiver. A well-known precoding scheme is based upon the singular value decomposition (SVD) of the channel matrix, which transforms the MIMO channel into parallel subchannels. Despite having low maximum likelihood decoding (MLD) complexity, this SVD precoding scheme provides a diversity gain which is limited by the diversity gain of the weakest subchannel. We therefore propose X- and Y-Codes, which improve the diversity gain of the SVD precoding scheme but maintain the low MLD complexity, by jointly coding information across a pair of subchannels. In particular, subchannels with high diversity gain are paired with those having low diversity gain. A pair of subchannels is jointly encoded using a 2 2 real matrix, which is fixed a priori and does not change with each channel realization. For X-Codes, these rotation matrices are parameterized by a single angle, while for Y-Codes, these matrices are left triangular matrices. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but with encoding matrices adapted to each channel realization. We observed that X-Codes/Precoders are good for well-conditioned channels, while Y-Codes/Precoders are good for ill-conditioned channels.

Anomalous Behavior of Linear Hydrocarbon Chains in Water-DMSO Binary Mixture at Low DMSO Concentration

We find that at a mole fraction 0.05 of DMSO (x(DMSO) = 0.05) in aqueous solution, a linear hydrocarbon chain of intermediate length (n = 30-40) adopts the most stable collapsed conformation. In pure water, the same chain exhibits an intermittent oscillation between the collapsed and the extended coiled conformations. Even when the mole fraction of DMSO in the bulk is 0.05, the concentration of the same in the first hydration layer around the hydrocarbon of chain length 30 (n = 30) is as large as 17%. Formation of such hydrophobic environment around the hydrocarbon chain may be viewed as the reason for the collapsed conformation gaining additional stability. We find a second anomalous behavior to emerge near x(DMSO) = 0.15, due to a chain-like aggregation of the methyl groups of DMSO in water that lowers the relative concentration of the DMSO molecules in the hydration layer. We further find that as the concentration of DMSO is gradually increased, it progressively attains the extended coiled structure as the stable conformation. Although Flory-Huggins theory (for binary mixture solvent) fails to predict the anomaly at x(DMSO) = 0.05, it seems to capture the essence of the anomaly at 0.15.

Synthesis of single-walled carbon nanotubes using binary (Fe, Co, Ni) alloy nanoparticles prepared in situ by the reduction of oxide solid solutions

Passing a H-2-CH4 mixture over oxide spinels containing two transition elements as in Mg0.8MyMz'Al2O4 (M, M' = Fe, Co or Ni, y + z = 0.2) at 1070 degrees C produces small alloy nanoparticles which enable the formation of carbon nanotubes. Surface area measurements are found to be useful for assessing the yield and quality of the nanotubes. Good-quality single-walled nanotubes (SWNTs) have been obtained in high yields with the FeCo alloy nanoparticles, as evidenced by transmission electron microscope images and surface area measurements. The diameter of the SWNTs is in the 0.8-5 nm range, and the multiwalled nanotubes, found occasionally, possess very few graphite layers. (C) 1999 Elsevier Science B.V. All rights reserved.

Wavelength/Time orthogonal codes with FEC offer dual advantage

To meet the growing demands of the high data rate applications, suitable asynchronous schemes such as Fiber-Optic Code Division Multiple Access (FO-CDMA) are required in the last mile. FO-CDMA scheme offers potential benefits and at the same time it faces many challenges. Wavelength/Time (W/T) 2-D codes for use in FO-CDMA, can be classified mainly into two types: 1) hybrid codes and 2) matrix codes, to reduce the 'time' like property, have been proposed. W/T single-pulse-per-row (SPR) are energy efficient codes as this family of codes have autocorrelation sidelobes of '0', which is unique to this family and the important feature of the W/T multiple-pulses-per-row (MPR) codes is that the aspect ratio can be varied by trade off between wavelength and temporal lengths. These W/T codes have improved cardinality and spectral efficiency over other W/T codes and at the same time have lowest crosscorrelation values. In this paper, we analyze the performances of the FO-CDMA networks using W/T SPR codes and W/T MPR codes, with and without forward error correction (FEC) coding and show that with FEC there is dual advantage of error correction and reduced spread sequence length.

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

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Precoding with X-codes to increase 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 X-Codes in 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 the 2 × 2 real rotation matrices for each pair (parameterized with a single angle). This precoding structure enables 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 equivalent to 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 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.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.