Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Asymptotically optimal cooperative wireless networks without constellation expansion

In this work, we construct a unified family of cooperative diversity coding schemes for implementing the orthogonal amplify-and-forward and the orthogonal selection-decode-and-forward strategies in cooperative wireless networks. We show that, as the number of users increases, these schemes meet the corresponding optimal high-SNR outage region, and do so with minimal order of signaling complexity. This is an improvement over all outage-optimal schemes which impose exponential increases in signaling complexity for every new network user. Our schemes, which are based on commutative algebras of normal matrices, satisfy the outage-related information theoretic criteria, the duplex-related coding criteria, and maintain reduced signaling, encoding and decoding complexities

Synthesis and Characterization of Carbon Nanotube-Polymer Multilayer Structures

We develop lightweight, multilayer materials composed of alternating layers of poly dimethyl siloxane (PDMS) polymer and vertically aligned carbon nanotube (CNT) arrays, and characterize their mechanical response in compression. The CNT arrays used In the assembly are synthesized with graded mechanical properties along their thickness, and their use enables the creation of multilayer structures with low density (0.12-0.28 g/cm(3)). We test the mechanical response of structures composed of different numbers of CNT layers partially embedded in PDMS polymer, under quasi-static and dynamic loading. The resulting materials exhibit a hierarchical, fibrous structure with unique mechanical properties: They can sustain large compressive deformations (up to similar to 0.8 strain) with a nearly complete recovery and present strain localization in selected sections of the materials. Energy absorption, as determined by the hysteresis observed In stress-strain curves, is found to be at least 3 orders of magnitude larger than that of natural and synthetic cellular materials of comparable density. Conductive bucky paper Is Included within the polymer interlayers. This allows the measurement of resistance variation as a function of applied stress, showing strong correlation with the observed strain localization In compression.

Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

It is well known that the space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas n is a power of 2. The rate of the square CODs for n = 2(a) has been shown to be a+1/2(a) complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the minimum-decoding-complexity STBCs from quasi-orthogonal designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be a/2(a)-1 complex symbols per channel use for 2(a) antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.

Algebraic Approaches to Space-Time Code Construction for Multiple-Antenna Communication

A major challenge in wireless communications is overcoming the deleterious effects of fading, a phenomenon largely responsible for the seemingly inevitable dropped call. Multiple-antennas communication systems, commonly referred to as MIMO systems, employ multiple antennas at both transmitter and receiver, thereby creating a multitude of signalling pathways between transmitter and receiver. These multiple pathways give the signal a diversity advantage with which to combat fading. Apart from helping overcome the effects of fading, MIMO systems can also be shown to provide a manyfold increase in the amount of information that can be transmitted from transmitter to receiver. Not surprisingly,MIMO has played, and continues to play, a key role in the advancement of wireless communication.Space-time codes are a reference to a signalling format in which information about the message is dispersed across both the spatial (or antenna) and time dimension. Algebraic techniques drawing from algebraic structures such as rings, fields and algebras, have been extensively employed in the construction of optimal space-time codes that enable the potential of MIMO communication to be realized, some of which have found their way into the IEEE wireless communication standards. In this tutorial article, reflecting the authors’interests in this area, we survey some of these techniques.

Contractive Hilbert modules and their dilations

In this note, we show that a quasi-free Hilbert module R defined over the polydisk algebra with kernel function k(z,w) admits a unique minimal dilation (actually an isometric co-extension) to the Hardy module over the polydisk if and only if S (-1)(z, w)k(z, w) is a positive kernel function, where S(z,w) is the Szego kernel for the polydisk. Moreover, we establish the equivalence of such a factorization of the kernel function and a positivity condition, defined using the hereditary functional calculus, which was introduced earlier by Athavale [8] and Ambrozie, Englis and Muller [2]. An explicit realization of the dilation space is given along with the isometric embedding of the module R in it. The proof works for a wider class of Hilbert modules in which the Hardy module is replaced by more general quasi-free Hilbert modules such as the classical spaces on the polydisk or the unit ball in a'', (m) . Some consequences of this more general result are then explored in the case of several natural function algebras.

Nonlinear viscoelasticity of freestanding and polymer-anchored vertically aligned carbon nanotube foams

Vertical arrays of carbon nanotubes (VACNTs) show unique mechanical behavior in compression, with a highly nonlinear response similar to that of open cell foams and the ability to recover large deformations. Here, we study the viscoelastic response of both freestanding VACNT arrays and sandwich structures composed of a VACNT array partially embedded between two layers of poly(dimethylsiloxane) (PDMS) and bucky paper. The VACNTs tested are similar to 2 mm thick foams grown via an injection chemical vapor deposition method. Both freestanding and sandwich structures exhibit a time-dependent behavior under compression. A power-law function of time is used to describe the main features observed in creep and stress-relaxation tests. The power-law exponents show nonlinear viscoelastic behavior in which the rate of creep is dependent upon the stress level and the rate of stress relaxation is dependent upon the strain level. The results show a marginal effect of the thin PDMS/bucky paper layers on the viscoelastic responses. At high strain levels (epsilon - 0.8), the peak stress for the anchored CNTs reaches similar to 45 MPa, whereas it is only similar to 15MPa for freestanding CNTs, suggesting a large effect of PDMS on the structural response of the sandwich structures. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.3699184]

Hilbert W*-modules and coherent states

Hilbert C*-module valued coherent states was introduced earlier by Ali, Bhattacharyya and Shyam Roy. We consider the case when the underlying C*-algebra is a W*-algebra. The construction is similar with a substantial gain. The associated reproducing kernel is now algebra valued, rather than taking values in the space of bounded linear operators between two C*-algebras.

Parabolized stability equation models for predicting large-scale mixing noise of turbulent round jets

Parabolized stability equation (PSE) models are being deve loped to predict the evolu-tion of low-frequency, large-scale wavepacket structures and their radiated sound in high-speed turbulent round jets. Linear PSE wavepacket models were previously shown to be in reasonably good agreement with the amplitude envelope and phase measured using a microphone array placed just outside the jet shear layer. 1,2 Here we show they also in very good agreement with hot-wire measurements at the jet center line in the potential core,for a different set of experiments. 3 When used as a model source for acoustic analogy, the predicted far field noise radiation is in reasonably good agreement with microphone measurements for aft angles where contributions from large -scale structures dominate the acoustic field. Nonlinear PSE is then employed in order to determine the relative impor-tance of the mode interactions on the wavepackets. A series of nonlinear computations with randomized initial conditions are use in order to obtain bounds for the evolution of the modes in the natural turbulent jet flow. It was found that n onlinearity has a very limited impact on the evolution of the wavepackets for St≥0. 3. Finally, the nonlinear mechanism for the generation of a low-frequency mode as the difference-frequency mode 4,5 of two forced frequencies is investigated in the scope of the high Reynolds number jets considered in this paper.

Poincare invariant quantum field theories with twisted internal symmetries

Following up the work of 1] on deformed algebras, we present a class of Poincare invariant quantum field theories with particles having deformed internal symmetries. The twisted quantum fields discussed in this work satisfy commutation relations different from the usual bosonic/fermionic commutation relations. Such twisted fields by construction are nonlocal in nature. Despite this nonlocality we show that it is possible to construct interaction Hamiltonians which satisfy cluster decomposition principle and are Lorentz invariant. We further illustrate these ideas by considering global SU(N) symmetries. Specifically we show that twisted internal symmetries can provide a natural-framework for the discussion of the marginal deformations (beta-deformations) of the N = 4 SUSY theories.

Structured Dispersion Matrices From Division Algebra Codes for Space-Time Shift Keying

We propose a novel method of constructing Dispersion Matrices (DM) for Coherent Space-Time Shift Keying (CSTSK) relying on arbitrary PSK signal sets by exploiting codes from division algebras. We show that classic codes from Cyclic Division Algebras (CDA) may be interpreted as DMs conceived for PSK signal sets. Hence various benefits of CDA codes such as their ability to achieve full diversity are inherited by CSTSK. We demonstrate that the proposed CDA based DMs are capable of achieving a lower symbol error ratio than the existing DMs generated using the capacity as their optimization objective function for both perfect and imperfect channel estimation.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Antibody-mediated catalysis: Induction and therapeutic relevance

Abzymes are immunoglobulins endowed with enzymatic activities. The catalytic activity of an abzyme resides in the variable domain of the antibody, which is constituted by the close spatial arrangement of amino acid residues involved in catalysis. The origin of abzymes is conferred by the innate diversity of the immunoglobulin gene repertoire. Under deregulated immune conditions, as in autoimmune diseases, the generation of abzymes to self-antigens could be deleterious. Technical advancement in the ability to generate monoclonal antibodies has been exploited in the generation of abzymes with defined specificities and activities. Therapeutic applications of abzymes are being investigated with the generation of monoclonal abzymes against several pathogenesis-associated antigens. Here, we review the different contexts in which abzymes are generated, and we discuss the relevance of monoclonal abzymes for the treatment of human diseases.

Monopoles on S-F(2) from the fuzzy conifold

The intersection of the conifold z(1)(2) + z(2)(2) + z(3)(2) = 0 and S-5 is a compact 3-dimensional manifold X-3. We review the description of X-3 as a principal U(1) bundle over S-2 and construct the associated monopole line bundles. These monopoles can have only even integers as their charge. We also show the Kaluza-Klein reduction of X-3 to S-2 provides an easy construction of these monopoles. Using the analogue of the Jordan-Schwinger map, our techniques are readily adapted to give the fuzzy version of the fibration X-3 -> S-2 and the associated line bundles. This is an alternative new realization of the fuzzy sphere S-F(2) and monopoles OH it.

Black holes in higher spin supergravity

We study black hole solutions in Chern-Simons higher spin supergravity based on the superalgebra sl(3 vertical bar 2). These black hole solutions have a U(1) gauge field and a spin 2 hair in addition to the spin 3 hair. These additional fields correspond to the R-symmetry charges of the supergroup sl(3 vertical bar 2). Using the relation between the bulk field equations and the Ward identities of a CFT with N = 2 super-W-3 symmetry, we identify the bulk charges and chemical potentials with those of the boundary CFT. From these identifications we see that a suitable set of variables to study this black hole is in terms of the charges present in three decoupled bosonic sub-algebras of the N = 2 super-W-3 algebra. The entropy and the partition function of these R-charged black holes are then evaluated in terms of the charges of the bulk theory as well as in terms of its chemical potentials. We then compute the partition function in the dual CFT and find exact agreement with the bulk partition function.