Preparation of proton exchange membrane by radiation-induced grafting method : Grafting of styrene onto poly(ethylene tetrafluoroethylene) copolymer films

Radiation induced grafting of styrene onto poly(ethylene-tetrafluoroethylene) (ETFE) copolymer film was carried out to prepare graft copolymer (ETFE-g-polystyrene) that can host sulfonic acid groups and form proton exchange membrane for polymer electrolyte fuel cell (PEFC). The effect of monomer concentration and type of solvent on the degree of grafting was investigated. The formation of graft copolymer film was confirmed by FTIR spectrum analysis

Opportunistic Spectrum Sharing using Dumb Basis Patterns: The Line-of-Sight Interference Scenario

We investigate a spectrum-sharing system with non-severely faded mutual interference links, where both the secondary-to-primary and primary-to-secondary channels have a Line-of-Sight (LoS) component. Based on a Rician model for the LoS channels, we show, analytically and numerically, that LoS interference hinders the achievable secondary user capacity. This is caused by the poor dynamic range of the interference channels fluctuations when a dominant LoS component exists. In order to improve the capacity of such system, we propose the usage of an Electronically Steerable Parasitic Array Radiator (ESPAR) antenna at the secondary terminals. An ESPAR antenna requires a single RF chain and has a reconfigurable radiation pattern that is controlled by assigning arbitrary weights to M orthonormal basis radiation patterns. By viewing these orthonormal patterns as multiple virtual dumb antennas, we randomly vary their weights over time creating artificial channel fluctuations that can perfectly eliminate the undesired impact of LoS interference. Because the proposed scheme uses a single RF chain, it is well suited for compact and low cost mobile terminals

Doppler cooling with coherent trains of laser pulses and tunable "velocity comb"

We explore the possibility of decelerating and Doppler cooling of an ensemble of two-level atoms by a coherent train of short, non-overlapping laser pulses. We develop a simple analytical model for dynamics of a two-level system driven by the resulting frequency comb field. We find that the effective scattering force mimics the underlying frequency comb structure. The force pattern depends strongly on the ratio of the atomic lifetime to the repetition time and pulse area. For example, in the limit of short lifetimes, the frequency peaks of the optical force wash out. We show that laser cooling with pulse trains results in a "velocity comb", a series of narrow peaks in the velocity space

Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The design process starts from a protograph which embodies a desirable degree distribution. This protograph is then lifted cyclically to a certain block length of interest. The lift is designed carefully to satisfy a certain approximate cycle extrinsic message degree (ACE) spectrum. The target ACE spectrum is one with extremal properties, implying a good error floor performance for the designed code. The proposed construction results in quasi-cyclic codes which are attractive in practice due to simple encoder and decoder implementation. Simulation results are provided to demonstrate the effectiveness of the proposed construction in comparison with similar existing constructions.Comment: Submitted to IEEE Trans. Communication

Lowering the Error Floor of LDPC Codes Using Cyclic Liftings

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We derive a necessary and sufficient condition for the cyclic permutations assigned to the edges of a cycle $c$ of length $\ell(c)$ in the base graph such that the inverse image of $c$ in the lifted graph consists of only cycles of length strictly larger than $\ell(c)$. The proposed method is universal in the sense that it can be applied to any LDPC code over any channel and for any iterative decoding algorithm. It also preserves important properties of the base code such as degree distributions, encoder and decoder structure, and in some cases, the code rate. The proposed method is applied to both structured and random codes over the binary symmetric channel (BSC). The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of the same degree. Similar improvements are also observed when the codes designed for the BSC are applied to the additive white Gaussian noise (AWGN) channel