Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

For point to point multiple input multiple output systems, Dayal-Brehler-Varanasi have proved that training codes achieve the same diversity order as that of the underlying coherent space time block code (STBC) if a simple minimum mean squared error estimate of the channel formed using the training part is employed for coherent detection of the underlying STBC. In this letter, a similar strategy involving a combination of training, channel estimation and detection in conjunction with existing coherent distributed STBCs is proposed for noncoherent communication in Amplify-and-Forward (AF) relay networks. Simulation results show that the proposed simple strategy outperforms distributed differential space-time coding for AF relay networks. Finally, the proposed strategy is extended to asynchronous relay networks using orthogonal frequency division multiplexing.

Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N >= 2.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Asynchronous behaviour in some three-atom linear concerted radical-exchange reactions

A few simple three-atom thermoneutral radical exchange reactions (i.e. A + BC --> AB + C) are examined by ab initio SCF methods. Emphasis is laid on the detailed analysis of density matrices rather than on energetics. Results reveal that the sum of the bond orders of the breaking and forming bonds is not conserved to unity, due to development of free valence on the migrating atom 'B' in the transition state. Bond orders, free valence and spin densities on the atoms are calculated. The present analysis shows that the bond-cleavage process is always more advanced than the bond-formation process in the transition state. Further analysis shows a development of the negative spin density on the migrating atom 'B' in the transition state. The depletion of the alpha-spin density on the radical site "A" in the reactant during the reaction lags behind the growth of the alpha-spin density on the terminal atom "C" of the reactant bond, 'B-C' in the transition state. But all these processes are completed simultaneously at the end of the reaction. Hence, the reactions are asynchronous but kinetically concerted in most cases.

On the fundamentally asynchronous nature of interference in cooperative base station systems

Cooperative transmission by base stations can significantly improve the spectral efficiency of multiuser, multi-cell multiple input multiple output systems. We show that in such systems the multiuser interference is asynchronous by nature, even when perfect timing-advance mechanisms ensure that the desired signal components arrive synchronously. We establish an accurate mathematical model for the asynchronism, and use it to show that the asynchronism leads to a significant performance degradation of existing linear preceding designs that assumed synchronous interference. We consider three different previously proposed precoding designs, and show how to modify them to effectively mitigate asynchronous interference.

Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA

In phase encoding optical CDMA (OCDMA) the spreading is achieved by encoding the phase of signal spectrum. In this paper we first derive a mathematical model for the output of phase encoding OCDMA systems. Based on this model we introduce a metric to design spreading sequences for asynchronous transmission. Then we connect the phase encoding sequence design problem to OFDM PMEPR (peak to mean envelope power ratio) problem. Using this connection we conclude that designing sequences with good properties for samples of timing delay guarantees that the same sequence to be good for all timing delays. Finally using generalized bent function we manage to construct a family of sequences which are good for asynchronous phase encoding OCDMA systems and using these sequences we introduce an M-ary modulation scheme for phase encoding OCDMA

Design and Analysis of an Acknowledgment-Aware Asynchronous MPR MAC Protocol for Distributed WLANs

Multi-packet reception (MPR) promises significant throughput gains in wireless local area networks (WLANs) by allowing nodes to transmit even in the presence of ongoing transmissions in the medium. However, the medium access control (MAC) layer must now be redesigned to facilitate rather than discourage - these overlapping transmissions. We investigate asynchronous MPR MAC protocols, which successfully accomplish this by controlling the node behavior based on the number of ongoing transmissions in the channel. The protocols use the backoff timer mechanism of the distributed coordination function, which makes them practically appealing. We first highlight a unique problem of acknowledgment delays, which arises in asynchronous MPR, and investigate a solution that modifies the medium access rules to reduce these delays and increase system throughput in the single receiver scenario. We develop a general renewal-theoretic fixed-point analysis that leads to expressions for the saturation throughput, packet dropping probability, and average head-of-line packet delay. We also model and analyze the practical scenario in which nodes may incorrectly estimate the number of ongoing transmissions.

Asynchronous Measurement of Transient Phase-Shift Resulting From RF Receiver State-Change

In a wireless receiver, a down-converted RF signal undergoes a transient phase shift, when the gain state is changed to adjust for varying conditions in transmission and propagation. A method is developed, in which such phase shifts are detected asynchronously, and their undesirable effects on the bit error rate are corrected. The method was developed for and used in, the system-level characterization and calibration of a 65-nm CMOS UHF receiver. The phase-shifts associated with specific gain-state transitions were measured within a test framework, and used in the baseband signal processing blocks to compensate for errors, whenever the receiver anticipated a gain-state transition.

Asynchronous Gossip for Averaging and Spectral Ranking

We consider two variants of the classical gossip algorithm. The first variant is a version of asynchronous stochastic approximation. We highlight a fundamental difficulty associated with the classical asynchronous gossip scheme, viz., that it may not converge to a desired average, and suggest an alternative scheme based on reinforcement learning that has guaranteed convergence to the desired average. We then discuss a potential application to a wireless network setting with simultaneous link activation constraints. The second variant is a gossip algorithm for distributed computation of the Perron-Frobenius eigenvector of a nonnegative matrix. While the first variant draws upon a reinforcement learning algorithm for an average cost controlled Markov decision problem, the second variant draws upon a reinforcement learning algorithm for risk-sensitive control. We then discuss potential applications of the second variant to ranking schemes, reputation networks, and principal component analysis.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.

Intercellular Communication in the Multicellular Stage of Dictyostelium-Discoideum

The aim of the present study was to draw inferences regarding the properties of single cells responsible for co-operative behaviour in the slug of the soil amoeba Dictyostelium discoideum. The slug is an integrated multicellular mass formed by the aggregation of starved cells. The amoebae comprising the slug differentiate according to their spatial locations relative to one another, implying that, as in the case of other regulative embryos, they must be in mutual communication. We have previously shown that one manifestation of this communication is the time taken for the anteriormost fragment of the slug, the tip, to regenerate from slugs which have been rendered tipless by amputation. We present results of tip-regeneration experiments performed on genetically mosaic slugs. By comparing the mosaics with their component pure genotypes, we were able to discriminate between a set of otherwise equally plausible modes of intercellular signalling. Neither a'pacemaker' model, in which the overall rate of tip regeneration is determined by the cell with the highest frequency of autonomous oscillation, nor an 'independent-particle' model, in which the rate of regeneration is the arithmetical average of independent cell-dependent rates, is in quantitative accord with our findings. Our results are best explained by a form of signalling which operates by means of cell-to-cell relay. Therefore intercellular communication Seems to be essential for tip regeneration.