Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

Low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, were given by Guo and Xia along with sufficient conditions for a Space-Time Block Code (STBC) to achieve full diversity with PIC/PIC-SIC decoding for point-to-point MIMO channels. In Part-I of this two part series of papers, we give new conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. We then show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks and give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders. In Part-II, we construct new low complexity full-diversity PIC/PIC-SIC decodable STBCs and DSTBCs that achieve higher rates than the known full-diversity low complexity ML decodable STBCs and DSTBCs.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

La-Doped Ba2In2O5 Electrolyte: Pechini Synthesis, Microstructure, Electrical Conductivity, and Application for CO Gas Sensing

Dense (Ba1―xLax)2In2O5+x (BLIO) electrolytes with different compositions (x = 0.4, 0.5, 0.6) were fabricated using powders obtained by the Pechini method. The formation of BLIO powders was investigated by using X-ray diffraction and scanning electron microscopy coupled with energy-dispersive X-ray spectroscopy. The calcination temperature and time were optimized. The sintered (Ba1―xLax)2In2O5+x electrolytes showed a relative density greater than ∼97%, and the major phase of three electrolyte compositions was indexed as a cubic perovskite. The electrical conductivity of BLIO ceramics at elevated temperatures in air was measured by ac-impedance spectroscopy. The activation energies for conduction in BLIO were 102 kJ mol―1 between 473 and 666 K and 118 kJ mol―1 between 769 and 873 K, which are comparable to that for 8 mol % yttria-stabilized cubic zirconia. Mixed-potential gas sensors utilizing BLIO-based electrolytes exhibited good sensitivity to different CO concentrations from ∼100 to ∼500 ppm and excellent selectivity to methane at around 873 K.

Self-Assembly of Metallamacrocycles Using a Dinuclear Organometallic Acceptor: Synthesis, Characterization, and Sensing Study

A dinuclear organometallic acceptor 4,4'-bis[trans-Pt(PEt(3))(2)(O(3)SCF(3))(ethynyl)]biphenyl (1) containing Pt-ethynyl functionality is synthesized. Multinuclear NMR ((1)H, (31)P, and (13)C), infrared (IR), and electrospray ionization mass spectrometry (ESI-MS) including single-crystal X-ray diffraction analysis established the formation of 1. Equimolar treatment of acceptor 1 separately with three different ``clip'' type ditopic donors (L(a)-L(c)) yielded [2 + 2] self-assembled three metallamacrocycles 2a-2c, respectively. These macrocycles were characterized by various spectroscopic techniques, and their sizes/shapes were obtained through geometry optimization using molecular mechanics universal force field (MMUFF) simulations. Attachment of unsaturated ethynyl functionality to biphenyl building unit helped to make the macrocycles (2a-2c) pi-electron rich and thereby fluorescent in nature. Furthermore, 2c in solution has been examined to be suitable for sensing electron-deficient nitroaromatic like picric acid, which is often considered as a secondary chemical explosive. The fluorescence study of 2c showed a marked quenching of initial emission intensity upon titrating with picric acid (PA), and it exhibited the largest fluorescence quenching response with high selectivity among various other electron deficient aromatic compounds tested.

Coordination-driven self-assembly of 2D-metallamacrocycles using a shape-selective Pt(2)(II)-organometallic 90 degrees acceptor: design, synthesis and sensing study

Synthesis of a series of two-dimensional metallamacrocycles via coordination-driven self-assembly of a shape-selective Pt(2)(II)-molecular building unit incorporating carbazole-ethynyl functionality is described. An equimolar (1 : 1) combination of a Pt(2)(II)-organometallic 90 degrees acceptor, 1, with rigid linear ditopic donors (L(a) and L(b)) afforded [4 + 4] self-assembled octanuclear molecular squares, 2 and 3, in quantitative yields, respectively [L(a) = 4,4'-bipyridine; L(b) = trans-1,2-bis(4-pyridyl)ethylene]. Conversely, a similar treatment of 1 with an amide-based unsymmetrical flexible ditopic donor, L(c), resulted in the formation of a [2 + 2] self-sorted molecular rhomboid (4a) as a single product [L(c) = N-(4-pyridyl)isonicotinamide]. Despite the possibility of several linkage isomeric macrocycles (rhomboid, triangle and square) due to the different connectivity of L(c), the formation of a single and symmetrical molecular rhomboid (4a) as the only product is an interesting observation. All the self-assembled macrocycles (2, 3 and 4a) were fully characterized by multinuclear NMR ((1)H and (31)P) and ESI-MS analysis. Further structural insights about the size and shape of the macrocycles were obtained through energy minimization using density functional theory (DFT) calculations. Decoration of the starting carbazole building unit with Pt-ethynyl functionality enriches the assemblies to be more p-electron rich and luminescent in nature. Macrocycles 2 and 3 could sense the presence of electron deficient nitroaromatics in solution by quenching of the initial intensity upon gradual addition of picric acid (PA). They exhibited the largest quenching response with high selectivity for nitroaromatics compared to several other electron deficient aromatics tested.

Distributed Simulation Of Flexible Manufacturing Systems

Flexible Manufacturing Systems (FMS), widely considered as the manufacturing technology of the future, are gaining increasing importance due to the immense advantages they provide in terms of cost, quality and productivity over the conventional manufacturing. An FMS is a complex interconnection of capital intensive resources and high levels of system performance is very crucial for survival in a competing environment.Discrete event simulation is one of the most popular methods for performance evaluation of FMS during planning, design and operation phases. Indeed fast simulators are suggested for selection of optimal strategies for flow control (which part type to enter and at what instant), AGV scheduling (which vehicle to carry which part), routing (which machine to process the part) and part selection (which part for processing next). In this paper we develop a C-net based model for an FMS and use the same for distributed discrete event simulation. We illustrate using examples the efficacy of destributed discrete event simulation for the performance evaluation of FMSs.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

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.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Optimal placement of Distributed Generation for a projected load increase using Relative Electrical Distance approach

There is a lot of pressure on all the developed and second world countries to produce low emission power and distributed generation (DG) is found to be one of the most viable ways to achieve this. DG generally makes use of renewable energy sources like wind, micro turbines, photovoltaic, etc., which produce power with minimum green house gas emissions. While installing a DG it is important to define its size and optimal location enabling minimum network expansion and line losses. In this paper, a methodology to locate the optimal site for a DG installation, with the objective to minimize the net transmission losses, is presented. The methodology is based on the concept of relative electrical distance (RED) between the DG and the load points. This approach will help to identify the new DG location(s), without the necessity to conduct repeated power flows. To validate this methodology case studies are carried out on a 20 node, 66kV system, a part of Karnataka Transco and results are presented.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

A novel ``pro-sensitizer'' based sensing of enzymes using Tb(III) luminescence in a hydrogel matrix

Chemically synthesized ``pro-sensitizers'' release the sensitizer in the presence of lipase or beta-glucosidase, triggering a significant luminescence response from a lanthanide based hydrogel.

Carbon Nanotube based Composite Fibers for Strain Sensing, Signal Processing and Computing

Carbon nanotubes dispersed in polymer matrix have been aligned in the form of fibers and interconnects and cured electrically and by UV light. Conductivity and effective semiconductor tunneling against reverse to forward bias field have been designed to have differentiable current-voltage response of each of the fiber/channel. The current-voltage response is a function of the strain applied to the fibers along axial direction. Biaxial and shear strains are correlated by differentiating signals from the aligned fibers/channels. Using a small doping of magnetic nanoparticles in these composite fibers, magneto-resistance properties are realized which are strong enough to use the resulting magnetostriction as a state variable for signal processing and computing. Various basic analog signal processing tasks such as addition, convolution and filtering etc. can be performed. These preliminary study shows promising application of the concept in combined analog-digital computation in carbon nanotube based fibers. Various dynamic effects such as relaxation, electric field dependent nonlinearities and hysteresis on the output signals are studied using experimental data and analytical model.