Chemical communication in Ropalidia marginata: Dufour's gland contains queen signal that is perceived across colonies and does not contain colony signal

Queens of the primitively eusocial wasp Ropalidia marginata appear to maintain reproductive monopoly through pheromone rather than through physical aggression. Upon queen removal, one of the workers (potential queen, PQ) becomes extremely aggressive but drops her aggression immediately upon returning the queen. If the queen is not returned, the PQ gradually drops her aggression and becomes the next queen of the colony. In a previous study, the Dufour's gland was found to be at least one source of the queen pheromone. Queen-worker classification could be done with 100% accuracy in a discriminant analysis, using the compositions of their respective Dufour's glands. In a bioassay, the PQ dropped her aggression in response to the queen's Dufour's gland macerate, suggesting that the queen's Dufour's gland contents mimicked the queen herself. In the present study, we found that the PQ also dropped her aggression in response to the macerate of a foreign queen's Dufour's gland. This suggests that the queen signal is perceived across colonies. This also suggests that the Dufour's gland in R. marginata does not contain information about nestmateship, because queens are attacked when introduced into foreign colonies, and hence PQ is not expected to reduce her aggression in response to a foreign queen's signal. The latter conclusion is especially significant because the Dufour's gland chemicals are adequate to classify individuals correctly not only on the basis of fertility status (queen versus worker) but also according to their colony membership, using discriminant analysis. This leads to the additional conclusion (and precaution) that the ability to statistically discriminate organisms using their chemical profiles does not necessarily imply that the organisms themselves can make such discrimination. (C) 2010 Elsevier Ltd. All rights reserved.

Quantum Threshold Voltage Modeling of Short Channel Quad Gate Silicon Nanowire Transistor

In this paper, a physically based analytical quantum linear threshold voltage model for short channel quad gate MOSFETs is developed. The proposed model, which is suitable for circuit simulation, is based on the analytical solution of 3-D Poisson and 2-D Schrodinger equation. Proposed model is fully validated against the professional numerical device simulator for a wide range of device geometries and also used to analyze the effect of geometry variation on the threshold voltage.

Cooperative Spectrum Sensing Algorithms For OFDM Systems with Frequency Selective Channels

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user employs Orthogonal Frequency Division Multiplexing (OFDM). We specifically consider the scenario when the channel between the primary and a secondary user is frequency selective. We develop cooperative sequential detection algorithms based on energy detectors. We modify the detectors to mitigate the effects of some common model uncertainties such as timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. The performance of the proposed algorithms are studied via simulations. We show that the performance of the energy detector is not affected by the frequency selective channel. We also provide a theoretical analysis for some of our algorithms.

Bayesian Decentralized Spectrum Sensing in Cognitive Radio Networks

This paper considers the problem of spectrum sensing, i.e., the detection of whether or not a primary user is transmitting data by a cognitive radio. The Bayesian framework is adopted, with the performance measure being the probability of detection error. A decentralized setup, where N sensors use M observations each to arrive at individual decisions that are combined at a fusion center to form the overall decision is considered. The unknown fading channel between the primary sensor and the cognitive radios makes the individual decision rule computationally complex, hence, a generalized likelihood ratio test (GLRT)-based approach is adopted. Analysis of the probabilities of false alarm and miss detection of the proposed method reveals that the error exponent with respect to M is zero. Also, the fusion of N individual decisions offers a diversity advantage, similar to diversity reception in communication systems, and a tight bound on the error exponent is presented. Through an analysis in the low power regime, the number of observations needed as a function of received power, to achieve a given probability of error is determined. Monte-Carlo simulations confirm the accuracy of the analysis.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using the amplify and forward protocol. For such a network, a new class of high rate, training-symbol embedded (TSE) SSD DSTBCs are proposed from TSE-CODs. The constructed codes include the training symbols within the structure of the code which is shown to be the key point to obtain high rate along with the SSD property. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations. Non-square TSE-CODs are shown to provide better rates (in symbols per channel use) compared to the known SSD DSTBCs for relay networks when the number of relays is less than 10. Importantly, the proposed DSTBCs do not contain zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on and off transitions within every codeword use. Hence, the proposed DSTBCs eliminate the antenna switching problem.

High level stable expression of rat brain type IIA sodium channel ?-subunit in CHO cells

The neuronal sodium channels are responsible for the rising phase of action potential and are composed of three subunits, of which the alpha-subunit has been shown to be adequate for most of its functional properties. We have stably expressed the rat brain type IIA sodium channel alpha-subunit in CHO cell tine using a CMV promoter-based vector. The expression was confirmed by detecting a 6.5 kb RNA corresponding to sodium channel alpha-subunit using Northern hybridization. The cells stably expressing the alpha-subunit, yield isolated sodium currents of amplitudes greater than 4nA when studied in whole-cell configuration of the patch-clamp technique. The sodium currents are characterized by activation and inactivation properties similar to neuronal sodium channels, and are blocked by the voltage gated sodium channel blocker tetrodotoxin (TTX).

Robust Transceiver Design for Multiuser MIMO Downlink

In this paper, we consider robust joint linear precoder/receive filter design for multiuser multi-input multi-output (MIMO) downlink that minimizes the sum mean square error (SMSE) in the presence of imperfect channel state information (CSI). The base station is equipped with multiple transmit antennas, and each user terminal is equipped with multiple receive antennas. The CSI is assumed to be perturbed by estimation error. The proposed transceiver design is based on jointly minimizing a modified function of the MSE, taking into account the statistics of the estimation error under a total transmit power constraint. An alternating optimization algorithm, wherein the optimization is performed with respect to the transmit precoder and the receive filter in an alternating fashion, is proposed. The robustness of the proposed algorithm to imperfections in CSI is illustrated through simulations.

Convergence of Power Control in a Random Channel Environment

In this paper, we study the Foschini Miljanic algorithm, which was originally proposed in a static channel environment. We investigate the algorithm in a random channel environment, study its convergence properties and apply the Gerschgorin theorem to derive sufficient conditions for the convergence of the algorithm. We apply the Foschini and Miljanic algorithm to cellular networks and derive sufficient conditions for the convergence of the algorithm in distribution and validate the results with simulations. In cellular networks, the conditions which ensure convergence in distribution can be easily verified.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras

For the number of transmit antennas N = 2(a) the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a/2(a)-1. In this paper, we report double-symbol-decodable Space-Time Block Codes with rate a-1/2(a)-2 for N = 2(a) transmit antennas. In particular, our code for 8 and 16 transmit antennas offer rates 1 and 3/4 respectively, the known QODs offer only 3/4 and 1/2 respectively. Our construction is based on the representations of Clifford algebras and applicable for any number of transmit antennas. We study the diversity sum and diversity product of our codes. We show that our diversity sum is larger than that of all known QODs and hence our codes perform better than the comparable QODs at low SNRs for identical spectral efficiency. We provide simulation results for various spectral efficiencies.