A Distributed Approach to Interference Cancellation

In this paper, we propose and analyze a novel idea of performing interference cancellation (IC) in a distributed/cooperative manner, with a motivation to provide multiuser detection (MUD) benefit to nodes that have only a single user detection capability. In the proposed distributed interference cancellation (DIC) scheme, during phase-1 of transmission, an MUD capable cooperating relay node estimates all the sender nodes' bits through multistage interference cancellation. These estimated bits are then sent by the relay node on orthogonal tones in phase-2 of transmission. The destination nodes receive these bit estimates and use them for interference estimation/cancellation, thus achieving IC benefit in a distributed manner. For this DIC scheme, we analytically derive an exact expression for the bit error rate (BER) in a basic five-node network (two source-destination node pairs and a cooperating relay node) on AWGN channels. Analytical BER results are shown to match with simulation results. For more general system scenarios, including more than two source-destination pairs and fading channels without and with space-time coding, we present simulation results to establish the potential for improved performance in the proposed distributed approach to interference cancellation. We also present a linear version of the proposed DIC.

Spectral Efficiency of Channel-Aware Schedulers in Non-identical Composite Links with Interference

Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly numerical simulations or make simplifying assumptions that limit the applicability of the results. In this paper, we derive analytical expressions for the spectral efficiency of cellular systems that use either the channel-unaware but fair round robin scheduler or the greedy, channel-aware but unfair maximum signal to interference ratio scheduler. As is the case in real deployments, non-identical co-channel interference at each user, both Rayleigh fading and lognormal shadowing, and limited modulation constellation sizes are accounted for in the analysis. We show that using a simple moment generating function-based lognormal approximation technique and an accurate Gaussian-Q function approximation leads to results that match simulations well. These results are more accurate than erstwhile results that instead used the moment-matching Fenton-Wilkinson approximation method and bounds on the Q function. The spectral efficiency of cellular systems is strongly influenced by the channel scheduler and the small constellation size that is typically used in third generation cellular systems.

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.

Simulation of RNA silencing pathway for time-dependent transgene transcription rate

The synthesis of dsRNA is analyzed using a pathway model with amplifications caused by the aberrant RNAs. The transgene influx rate is assumed time-decaying considering the fact that the number of transgenes can not be infinite. The dynamics of the transgene induced RNA silencing is investigated using a system of coupled nonautonomous ordinary nonlinear differential equations which describe the model phenomenologically. The silencing phenomena are detected after a period of transcription. Important contributions of certain parameters are discussed with several numerical examples.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

Cryptic AUG is important for 48S ribosomal assembly during internal initiation of translation of coxsackievirus B3 RNA

We have investigated the possible role of a conserved cis-acting element, the cryptic AUG, present in the 5' UTR of coxsackievirus B3 (CVB3) RNA. CVB3 5' UTR contains multiple AUG codons upstream of the initiator AUG, which are not used for the initiation of translation. The 48S ribosomal assembly takes place upstream of the cryptic AUG. We show here that mutation in the cryptic AUG results in reduced efficiency of translation mediated by the CVB3 IRES; mutation also reduces the interaction of mutant IRES with a well characterized IRES trans-acting factor, the human La protein. Furthermore, partial silencing of the La gene showed a decrease in IRES activity in the case of both the wild-type and mutant. We have demonstrated here that the interaction of the 48S ribosomal complex with mutant RNA was weaker compared with wild-type RNA by ribosome assembly analysis. We have also investigated by chemical and enzymic modifications the possible alteration in secondary structure in the mutant RNA. Results suggest that the secondary structure of mutant RNA was only marginally altered. Additionally, we have demonstrated by generating compensatory and non-specific mutations the specific function of the cryptic AUG in internal initiation. Results suggest that the effect of the cryptic AUG is specific and translation could not be rescued. However, a possibility of tertiary interaction of the cryptic AUG with other cis-acting elements cannot be ruled out. Taken together, it appears that the integrity of the cryptic AUG is important for efficient translation initiation by the CVB3 IRES RNA.

Interference Alignment Algorithms for the K User Constant MIMO Interference Channel

This paper considers the degrees of freedom (DOF) for a K user multiple-input multiple-output (MIMO) M x N interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

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, were given by Guo and Xia along with sufficient conditions for a Space-Time Block Code (STBC) to achieve full diversity with PIC/PIC-SIC decoding for point-to-point MIMO channels. In Part-I of this two part series of papers, we give new conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. We then show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks and give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders. In Part-II, we construct new low complexity full-diversity PIC/PIC-SIC decodable STBCs and DSTBCs that achieve higher rates than the known full-diversity low complexity ML decodable STBCs and DSTBCs.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

Interference in Multiprocessor Systems with Localized Memory Access Probabilities

Past studies of memory interference in multiprocessor systems have generally assumed that the references of each processor are uniformly distributed among the memory modules. In this paper we develop a model with local referencing, which reflects more closely the behavior of real-life programs. This model is analyzed using Markov chain techniques and expressions are derived for the multiprocessor performance. New expressions are also obtained for the performance in the traditional uniform reference model and are compared with other expressions-available in the literature. Results of a simulation study are given to show the accuracy of the expressions for both models.

Investigations on the RNA binding and phosphorylation of groundnut bud necrosis virus nucleocapsid protein

Groundnut bud necrosis virus belongs to the genus Tospovirus, infects a wide range of crop plants and causes severe losses. To understand the role of the nucleocapsid protein in the viral life cycle, the protein was overexpressed in E. coli and purified by Ni-NTA chromatography. The purified N protein was well folded and was predominantly alpha-helical. Deletion analysis revealed that the C-terminal unfolded region of the N protein was involved in RNA binding. Furthermore, the N protein could be phosphorylated in vitro by Nicotiana benthamiana plant sap and by purified recombinant kinases such as protein kinase CK2 and calcium-dependent protein kinase. This is the first report of phoshphorylation of a nucleocapsid protein in the family Bunyaviridae. The possible implications of the present findings for the viral life cycle are discussed.