Power Controlled Reverse Channel Training Achieves an Infinite Diversity Order in a TDD-SIMO System with Perfect CSIR

In this letter, we analyze the Diversity Multiplexinggain Tradeoff (DMT) performance of a training-based reciprocal Single Input Multiple Output (SIMO) system. Assuming Channel State Information (CSI) is available at the Receiver (CSIR), we propose a channel-dependent power-controlled Reverse Channel Training (RCT) scheme that enables the transmitter to directly estimate the power control parameter to be used for the forwardlink data transmission. We show that, with an RCT power of (P) over bar (gamma), gamma > 0 and a forward data transmission power of (P) over bar, our proposed scheme achieves an infinite diversity order for 0 <= g(m) < L-c-L-B,L-tau/L-c min(gamma, 1) and r > 2, where g(m) is the multiplexing gain, L-c is the channel coherence time, L-B,L-tau is the RCT duration and r is the number of receive antennas. We also derive an upper bound on the outage probability and show that it goes to zero asymptotically as exp(-(P) over bar (E)), where E (sic) (gamma - g(m)L(c)/L-c-L-B,L-tau), at high (P) over bar. Thus, the proposed scheme achieves a significantly better DMT performance compared to the finite diversity order achieved by channel-agnostic, fixed-power RCT schemes.

Diversity-Rate Trade-off for Fading Channels with Power Control

We consider a complex, additive, white Gaussian noise channel with flat fading. We study its diversity order vs transmission rate for some known power allocation schemes. The capacity region is divided into three regions. For one power allocation scheme, the diversity order is exponential throughout the capacity region. For selective channel inversion (SCI) scheme, the diversity order is exponential in low and high rate region but polynomial in mid rate region. For fast fading case we also provide a new upper bound on block error probability and a power allocation scheme that minimizes it. The diversity order behaviour of this scheme is same as for SCI but provides lower BER than the other policies.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Diversity in ranking via resistive graph centers

Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to "hedge their bets" and present diverse results within the precious 10 response slots. Diversity in ranking is of much recent interest. Most existing solutions estimate the marginal utility of an item given a set of items already in the response, and then use variants of greedy set cover. Others design graphs with the items as nodes and choose diverse items based on visit rates (PageRank). Here we introduce a radically new and natural formulation of diversity as finding centers in resistive graphs. Unlike in PageRank, we do not specify the edge resistances (equivalently, conductances) and ask for node visit rates. Instead, we look for a sparse set of center nodes so that the effective conductance from the center to the rest of the graph has maximum entropy. We give a cogent semantic justification for turning PageRank thus on its head. In marked deviation from prior work, our edge resistances are learnt from training data. Inference and learning are NP-hard, but we give practical solutions. In extensive experiments with subtopic retrieval, social network search, and document summarization, our approach convincingly surpasses recently-published diversity algorithms like subtopic cover, max-marginal relevance (MMR), Grasshopper, DivRank, and SVMdiv.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced 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, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

Full-rate full-diversity achieving MIMO precoding with partial CSIT

In this paper, we consider a slow-fading nt ×nr multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of interest in such channels. We propose a new precoding scheme which achieves both full diversity (nt ×nrth order diversity) as well as full rate (nt symbols per channel use) using partial channel state information at the transmitter (CSIT). The proposed scheme achieves full diversity and improved coding gain through an optimization over the choice of constellation sets. The optimization maximizes dmin2 for our precoding scheme subject to an energy constraint. The scheme requires feedback of nt - 1 angle parameter values, compared to 2ntnr real coefficients in case of full CSIT. Further, for the case of nt × 1 system, we prove that the capacity achieved by the proposed scheme is same as that achieved with full CSIT. Error rate performance results for nt = 3,4,8 show that the proposed scheme performs better than other precoding schemes in the literature; the better performance is due to the choice of the signal sets and the feedback angles in the proposed scheme.

Revision of the scolopendrid centipede digitipes Attems, 1930, from India (Chilopoda: Scolopendromorpha): reconciling molecular and morphological estimates of species diversity

Recent work on molecular phylogenetics of Scolopendridae from the Western Ghats, Peninsular India, has suggested the presence of six cryptic species of the otostigmine Digitipes Attems, 1930, together with three species described in previous taxonomic work by Jangi and Dass (1984). Digitipes is the correct generic attribution for a monophyletic group of Indian species, these being united with three species from tropical Africa (including the type) that share a distomedial process on the ultimate leg femur of males that is otherwise unknown in Otostigminae. Second maxillary characters previously used in the diagnosis of Digitipes are dismissed because Indian species do not possess the putatively diagnostic character states. Two new species from the Western Ghats that correspond to groupings identified based on monophyly, sequence divergence and coalescent analysis using molecular data are diagnosed based on distinct morphological characters. They are D. jangii and D. periyarensis n. spp. Three species named by Jangi and Dass (Digitipes barnabasi, D. coonoorensis and D. indicus) are revised based on new collections; D. indicus is a junior subjective synonym of Arthrorhabdus jonesii Verhoeff, 1938, the combination becoming Digitipes jonesii (Verhoeff, 1938) n. comb. The presence of Arthrorhabdus in India is accordingly refuted. Three putative species delimited by molecular and ecological data remain cryptic from the perspective of diagnostic morphological characters and are presently retained in D. barnabasi, D. jangii and D. jonesii. A molecularly-delimited species that resolved as sister group to a well-supported clade of Indian Digitipes is identified as Otostigmus ruficeps Pocock, 1890, originally described from a single specimen and revised herein. One Indian species originally assigned to Digitipes, D. gravelyi, deviates from confidently-assigned Digitipes with respect to several characters and is reassigned to Otostigmus, as O. gravelyi (Jangi and Dass, 1984) n. comb.

Modulation Diversity for Spatial Modulation Using Complex Interleaved Orthogonal Design

In this paper, we propose modulation diversity techniques for Spatial Modulation (SM) system using Complex Interleaved Orthogonal Design (CIOD). Specifically, we show that the standard SM scheme can achieve a transmit diversity order of two by using the CIOD meant for two transmit antenna system without incurring any additional system complexity or bandwidth requirement. Furthermore, we propose a low-complexity maximum likelihood detector for our CIOD based SM schemes by exploiting the structure of the CIOD. We show with our simulation results that the proposed schemes offer transmit diversity order of two and give a better symbol error rate performance than the conventional SM scheme.

Splicing Functions and Global Dependency on Fission Yeast Slu7 Reveal Diversity in Spliceosome Assembly

The multiple short introns in Schizosaccharomyces pombe genes with degenerate cis sequences and atypically positioned polypyrimidine tracts make an interesting model to investigate canonical and alternative roles for conserved splicing factors. Here we report functions and interactions of the S. pombe slu7(+) (spslu7(+)) gene product, known from Saccharomyces cerevisiae and human in vitro reactions to assemble into spliceosomes after the first catalytic reaction and to dictate 3' splice site choice during the second reaction. By using a missense mutant of this essential S. pombe factor, we detected a range of global splicing derangements that were validated in assays for the splicing status of diverse candidate introns. We ascribe widespread, intron-specific SpSlu7 functions and have deduced several features, including the branch nucleotide-to-3' splice site distance, intron length, and the impact of its A/U content at the 5' end on the intron's dependence on SpSlu7. The data imply dynamic substrate-splicing factor relationships in multiintron transcripts. Interestingly, the unexpected early splicing arrest in spslu7-2 revealed a role before catalysis. We detected a salt-stable association with U5 snRNP and observed genetic interactions with spprp1(+), a homolog of human U5-102k factor. These observations together point to an altered recruitment and dependence on SpSlu7, suggesting its role in facilitating transitions that promote catalysis, and highlight the diversity in spliceosome assembly.

Identification and characterization of starvation induced msdgc-1 promoter involved in the c-di-GMP turnover

C-di-GMP Bis-(3'-5')-cyclic-dimeric-guanosine monophosphate], a second messenger is involved in intracellular communication in the bacterial species. As a result several multi-cellular behaviors in both Gram-positive and Gram-negative bacteria are directly linked to the intracellular level of c-di-GMP. The cellular concentration of c-di-GMP is maintained by two opposing activities, diguanylate cyclase (DGC) and phosphodiesterase (PDE-A). In Mycobacterium smegmatis, a single bifunctional protein MSDGC-1 is responsible for the cellular concentration of c-di-GMP. A better understanding of the regulation of c-di-GMP at the genetic level is necessary to control the function of above two activities. In this work, we have characterized the promoter element present in msdgc-1 along with the + 1 transcription start site and identified the sigma factors that regulate the transcription of msdgc-1. Interestingly, msdgc-1 utilizes SigA during the initial phase of growth, whereas near the stationary phase SigB containing RNA polymerase takes over the expression of msdgc-1. We report here that the promoter activity of msdgc-1 increases during starvation or depletion of carbon source like glucose or glycerol. When msdgc-1 is deleted, the numbers of viable cells are similar to 10 times higher in the stationary phase in comparison to that of the wild type. We propose here that msdgc-1 is involved in the regulation of cell population density. (C) 2013 Elsevier B.V. All rights reserved.

Conformational Diversity in Contryphans from Conus Venom: cis-trans Isomerisation and Aromatic/Proline Interactions in the 23-Membered Ring of a 7-Residue Peptide Disulfide Loop

Conformational diversity or shapeshifting in cyclic peptide natural products can, in principle, confer a single molecular entity with the property of binding to multiple receptors. Conformational equilibria have been probed in the contryphans, which are peptides derived from Conus venom possessing a 23-membered cyclic disulfide moiety. The natural sequences derived from Conus inscriptus, GCV(D)LYPWC* (In936) and Conus loroisii, GCP(D)WDPWC* (Lo959) differ in the number of proline residues within the macrocyclic ring. Structural characterisation of distinct conformational states arising from cis-trans equilibria about Xxx-Pro bonds is reported. Isomerisation about the C2-P3 bond is observed in the case of Lo959 and about the Y5-P6 bond in In936. Evidence is presented for as many as four distinct species in the case of the synthetic analogue V3P In936. The Tyr-Pro-Trp segment in In936 is characterised by distinct sidechain orientations as a consequence of aromatic/proline interactions as evidenced by specific sidechain-sidechain nuclear Overhauser effects and ring current shifted proton chemical shifts. Molecular dynamics simulations suggest that Tyr5 and Trp7 sidechain conformations are correlated and depend on the geometry of the Xxx-Pro bond. Thermodynamic parameters are derived for the cis trans equilibrium for In936. Studies on synthetic analogues provide insights into the role of sequence effects in modulating isomerisation about Xxx-Pro bonds.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.

Diversity order vs rate in an AWGN channel

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have exponential diversity in low and high rate region but only subexponential in the mid-rate region. For the best available lower bounds and for the practical codes one observes exponential diversity throughout the capacity region. However we also show that performance of practical codes is close to Gallager's upper bounds and the mid-rate subexponential diversity has a bearing on the performance of the practical codes. Finally we show that the upper bounds with Gaussian input provide good approximation throughout the capacity region even for finite constellation.