Full interference cancellation for two-path cooperative communications

This paper proposes a full interference cancellation (FIC) approach for two-path cooperative communications. Unlike the single relay schemes, the two-path cooperative scheme involves two relay nodes, so that the source can continuously transmit data to the two relays alternatively and the full bandwidth efficiency with respect to the direct transmission can be retained. The two-path relay scheme may however suffer from inter-relay interference which is caused by the simultaneous transmission of the source and one of the relays at any time. In this paper, first the inter-relay interference is expressed as a single recursive term in the received signal, and then the FIC approach is proposed to fully remove the inter-relay interference. The FIC has not only better performance but also less complexity than existing approaches. Numerical examples are also given to verify the proposed approach.

Full interference cancellation for two-path relay cooperative networks

This paper proposes the full interference cancellation (FIC) algorithm to cancel the inter-relay interference (IRI) in the two-path cooperative system. Arising from simultaneous data transmission from the source and relay nodes, IRI may significantly decrease the performance if it is not carefully handled. Compared to the existing partial interference cancellation (PIC) scheme, the FIC approach is more robust yet with less complexity. Numerical results are also given to verify the proposed scheme.

Interference cancellation in two-path successive relay system with network coding

This paper proposes a novel interference cancellation algorithm for the two-path successive relay system using network coding. The two-path successive relay scheme was proposed recently to achieve full date rate transmission with half-duplex relays. Due to the simultaneous data transmission at the relay and source nodes, the two-path relay suffers from the so-called inter-relay interference (IRI) which may significantly degrade the system performance. In this paper, we propose to use the network coding to remove the IRI such that the interference is first encoded with the network coding at the relay nodes and later removed at the destination. The network coding has low complexity and can well suppress the IRI. Numerical simulations show that the proposed algorithm has better performance than existing approaches.

PIC based detection for distributed space-time block coding under imperfect synchronisation

A parallel interference cancellation (PIC) detection scheme is proposed to suppress the impact of imperfect synchronisation. By treating as interference the extra components in the received signal caused by timing misalignment, the PIC detector not only offers much improved performance but also retains a low structural and computational complexity.

Distributed space-time block coding for 3 and 4 relay nodes: Imperfect synchronisation and a solution

Most research on distributed space time block coding (STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. By applying STBC to 3-or 4-relay node systems, this paper shows that imperfect synchronisation causes significant performance degradation to the conventional detector. To this end, we propose a new STBC detection solution based on the principle of parallel interference cancellation (PIC). The PIC detector is moderate in computational complexity but is very effective in suppressing the impact of imperfect synchronisation.

PIC detector for distributed space-time block coding under imperfect synchronisation

A parallel interference cancellation (PIC) detection scheme is proposed to suppress the impact of imperfect synchronisation. By treating as interference the extra components in the received signal caused by timing misalignment, the PIC detector not only offers much improved performance but also retains a low structural and computational complexity.

Signal detection for distributed space-time block coding: 4 relay nodes under quasi-synchronisation

Most research on Distributed Space-Time Block Coding (D-STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. This paper applies STBC to 4-relaynode systems under quasi-synchronisation and derives a new detector based on parallel interference cancellation, which proves to be very effective in suppressing the impact of imperfect synchronisation.

Signal detection for orthogonal space-time block coding over time-selective fading channels: the H(i) systems

One major assumption in all orthogonal space-time block coding (O-STBC) schemes is that the channel remains static over the length of the code word. However, time-selective fading channels do exist, and in such case conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. As a sequel to the authors' previous papers on this subject, this paper aims to eliminate the error floor of the H(i)-coded O-STBC system (i = 3 and 4) by employing the techniques of: 1) zero forcing (ZF) and 2) parallel interference cancellation (PIC). It is. shown that for an H(i)-coded system the PIC is a much better choice than the ZF in terms of both performance and computational complexity. Compared with the, conventional H(i) detector, the PIC detector incurs a moderately higher computational complexity, but this can well be justified by the enormous improvement.

Signal detection for orthogonal space-time block coding over time-selective fading channels: a PIC approach for the Gi Systems

One major assumption in all orthogonal space-time block coding (O-STBC) schemes is that the channel remains static over the entire length of the codeword. However, time selective fading channels do exist, and in such case the conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. This paper addresses such an issue by introducing a parallel interference cancellation (PIC) based detector for the Gi coded systems (i=3 and 4).

Orthogonal space-time block coding over time-selective fading channels: a PIC detector for the Gi systems

All the orthogonal space-time block coding (O-STBC) schemes are based on the following assumption: the channel remains static over the entire length of the codeword. However, time selective fading channels do exist, and in many cases the conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. This paper addresses such an issue by introducing a parallel interference cancellation (PIC) based detector for the Gi coded systems (i=3 and 4).

Performance comparison of the optimal and the zero-forcing beamforming algorithms under practical conditions

The optimal and the zero-forcing beamformers are two commonly used algorithms in the subspace-based blind beamforming technology. The optimal beamformer is regarded as the algorithm with the best output SINR. The zero-forcing algorithm emphasizes the co-channel interference cancellation. This paper compares the performance of these two algorithms under some practical conditions: the effect of the finite data length and the existence of the angle estimation error. The investigation reveals that the zero-forcing algorithm can be more robust in the practical environment than the optimal algorithm.

Energy-dependent cancellation of diffraction spots due to surface roughening

The low-energy electron diffraction (LEED) pattern of the step-kinked Pt{531} surface at 200 K shows energy-dependent cancellation of diffraction spots over unusually large energy ranges, up to 100 eV. This cannot be reproduced theoretically when a flat surface geometry is assumed. A relatively simple model of roughening, however, involving 0.25 ML of vacancies and adatoms leads to very good agreement with the experiment. The cancellation of intensities within a very narrow range of adatom or vacancy coverages is caused by the interference of electrons emerging from different heights but similar local environments. This is a rare example where the energy dependence of integrated LEED spot intensities is dramatically affected by the long-range arrangement of atoms.

Interference and communications among active network applications

This paper focuses on active networks applications and in particular on the possible interactions among these applications. Active networking is a very promising research field which has been developed recently, and which poses several interesting challenges to network designers. A number of proposals for e±cient active network architectures are already to be found in the literature. However, how two or more active network applications may interact has not being investigated so far. In this work, we consider a number of applications that have been designed to exploit the main features of active networks and we discuss what are the main benefits that these applications may derive from them. Then, we introduce some forms of interaction including interference and communications among applications, and identify the components of an active network architecture that are needed to support these forms of interaction. We conclude by presenting a brief example of an active network application exploiting the concept of interaction.

How soccer players head the ball: a test of optic acceleration cancellation theory with virtual reality

We measured the movements of soccer players heading a football in a fully immersive virtual reality environment. In mid-flight the ball’s trajectory was altered from its normal quasi-parabolic path to a linear one, producing a jump in the rate of change of the angle of elevation of gaze (α) from player to ball. One reaction time later the players adjusted their speed so that the rate of change of α increased when it had been reduced and reduced it when it had been increased. Since the result of the player’s movement was to regain a value of the rate of change close to that before the disturbance, the data suggest that the players have an expectation of, and memory for, the pattern that the rate of change of α will follow during the flight. The results support the general claim that players intercepting balls use servo control strategies and are consistent with the particular claim of Optic Acceleration Cancellation theory that the servo strategy is to allow α to increase at a steadily decreasing rate.

Interference competition and high temperature reduce the ‘virulence’ of fig wasps and contribute to stability of a fig-wasp mutualism

Fig trees are pollinated by fig wasps, which also oviposit in female flowers. The wasp larvae gall and eat developing seeds. Although fig trees benefit from allowing wasps to oviposit, because the wasp offspring disperse pollen, figs must prevent wasps from ovipositing in all flowers, or seed production would cease, and the mutualism would go extinct. In Ficus racemosa, we find that syconia (‘figs’) that have few foundresses (ovipositing wasps) are underexploited in the summer (few seeds, few galls, many empty ovules) and are overexploited in the winter (few seeds, many galls, few empty ovules). Conversely, syconia with many foundresses produce intermediate numbers of galls and seeds, regardless of season. We use experiments to explain these patterns, and thus, to explain how this mutualism is maintained. In the hot summer, wasps suffer short lifespans and therefore fail to oviposit in many flowers. In contrast, cooler temperatures in the winter permit longer wasp lifespans, which in turn allows most flowers to be exploited by the wasps. However, even in winter, only in syconia that happen to have few foundresses are most flowers turned into galls. In syconia with higher numbers of foundresses, interference competition reduces foundress lifespans, which reduces the proportion of flowers that are galled. We further show that syconia encourage the entry of multiple foundresses by delaying ostiole closure. Taken together, these factors allow fig trees to reduce galling in the wasp-benign winter and boost galling (and pollination) in the wasp-stressing summer. Interference competition has been shown to reduce virulence in pathogenic bacteria. Our results show that interference also maintains cooperation in a classic, cooperative symbiosis, thus linking theories of virulence and mutualism. More generally, our results reveal how frequency-dependent population regulation can occur in the fig-wasp mutualism, and how a host species can ‘set the rules of the game’ to ensure mutualistic behavior in its symbionts.