<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <?Pub Dtl=""?>In a multiple-antenna system with two transmitters and receivers, scenario of data communication, known as the X channel, is studied in which each receiver receives from both transmitters. In this scenario, it assumed that transmitter unaware other transmitter's (noncooperative scenario). This can be considered combination broadcast channels (from transmitters' points view)...

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> The capacity region of the two-user Gaussian interference channel (IC) is studied. Three classes channels are considered: weak, one-sided, and mixed ICs. For weak IC, a new outer bound on obtained that outperforms previously known bounds. sum for certain range parameters derived. this range, it proved using codebooks treating as noise optimal. It shown when used, full Han–Kobayashi achievable...

In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme proposed which several data streams having fractional multiplexing gains are sent by transmitters and interfering aligned at receivers. Viewed as a field over rational numbers, received signal has infinite DOFs, allowing simultaneous interference alignment of any finite number signals The backed up recent result Diophantine approximation, states that convergence part...

In this paper, we consider multiple cache-enabled clients connected to servers through an intermediate network. We design several topology-aware coding strategies for such networks. Based on the topology richness of network, and types operations at internal nodes, define three classes networks, namely, dedicated, flexible, linear For each class, propose achievable scheme, analyze its delay, also compare it with information theoretic lower bound. flexible show that our scheme is order-optimal...

A new structure for multi-base systems is studied in which each user receives data from two nearby base stations, rather than only the strongest one. This system can be considered as a combination of broadcast and multi-access channels. By taking advantages both perspectives, an achievable rate region discrete memoryless channel modeled by Pr(y <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> ,y...

We consider the K user Multiple Input Output (MIMO) Gaussian interference channel with M antennas at each transmitter and N receiver. It is assumed that coefficients are fixed available all transmitters receivers. The main objective of this paper to characterize total Degrees Of Freedom (DOF) for channel. Using a new alignment technique which has been recently introduced in, we show MN/M+N degrees freedom can be achieved almost realizations. Also, upper-bound on DOF derived. This coincides...

DNA sequencing is the basic workhorse of modern day biology and medicine. Shotgun dominant technique used: many randomly located short fragments called reads are extracted from sequence, these assembled to reconstruct original sequence. A question is: given a technology statistics what minimum number required for reliable reconstruction? This provides fundamental limit performance any assembly algorithm. For simple statistical model sequence read process, we show that answer admits critical...

A novel coding scheme applicable in networks with single antenna nodes is proposed. This converts a system to an equivalent Multiple Input Output (MIMO) fractional dimensions. Interference can be aligned along these dimensions and higher Multiplexing gains achieved. Tools from the field of Diophantine approximation number theory are used show that proposed fact mimics traditional schemes MIMO systems where each data stream sent direction alignment happens when several streams arrive at same...

We consider the X channel and 3-user network with independent identically distributed fading across antennas uses delayed state information at transmitters (CSIT). provide new results for degrees of freedom these channels. Specifically, we show that single antenna CSIT can achieve 6/5 while 5/4 freedom.

We consider the MIMO (multiple-input multiple-output) Gaussian interference channel with i.i.d. fading across antennas and uses delayed local state information at transmitters (CSIT). For two-user case, achievability results for degrees of freedom (DoF) region this are provided. also prove tightness our achievable DoF some antenna configurations. Interestingly, there cases in which CSIT is identical to perfect that strictly larger than no CSIT. then $K$-user MISO single-output) IC show could...

In this paper, we consider a scenario where source node wishes to broadcast two confidential messages for respective receivers via Gaussian multiple-input multiple-output (MIMO) channel. An eavesdropper also receives the transmitted signal another MIMO We first discrete memoryless channel and obtain capacity region of degraded The secret dirty paper coding (SDPC) as an achievable rate general is introduced. Relying on results channel, fully characterize secrecy It shown that SDPC scheme...

The capacity region of the two-user Gaussian interference channel (IC) is studied. Two classes channels are considered: weak and mixed IC. For IC, a new outer bound on obtained that outperforms previously known bounds. sum for certain range parameters derived. this range, it proved using codebooks treating as noise optimal. It shown when used, full Han-Kobayashi (HK) achievable rate can be by naive HK scheme over three frequency bands. case, entire equivalent to one-sided IC particular parameters.

In this paper, a dual-hop communication system composed of source S and destination D connected through two non-interfering half-duplex relays, R <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , is considered. the literature Information Theory, configuration known as diamond channel. setup, four transmission modes are present, namely: 1) transmits, listen (broadcast mode), 2) listens,...

In this paper, a single-hop single-relay system with direct link between the source and destination is considered when relay operates in half-duplex mode. Motivated by concept of signal space diversity, paper introduces cooperation, which cooperation achieved using novel constellation design. approach, original expanded so that consists all possible combinations different components points constellation. The enables to extract required information order effectively cooperate phase, it helps...

In this paper, we first investigate the Degrees Of Freedom (DOF) for M-user Interference Channel (IC) in static environments with help of a MIMO relay. The relay stores received signal during time-slot and sends linearly-transformed version over next time-slot. Using scheme, it is shown that Alignment can be done much less complexity. Having very loose constraints on channel structure, proposed method calculates proper choice gains such IC able to achieve DOF M/2. It also proved if relay's...

In this paper, we first introduce a simple procedure for aligning interference directions in an M×N user MIMO X channel. The scheme is then modified M×2 channel which each equipped with M + 1 antennas. Next investigate the degrees of freedom (DOF) single antenna slow fading environments help relay. relay stores all received signals and sends their linear combination subsequent transmissions. Using scheme, it shown that adding can system to achieve available DOF. It also proved if relay's...

In this paper, we consider a scenario where source node wishes to broadcast two confidential messages for respective receivers, while wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, individual secure are over open media and can be received any illegitimate receiver. The secrecy level measured equivocation rate at eavesdropper. We first study general (non-degraded) channel with messages. present an inner bound on capacity region model....

We establish the fundamental limits of DNA shotgun sequencing under noisy reads. show a surprising result: for i.i.d. model, reads are as good noiseless reads, provided that noise level is below certain threshold which can be surprisingly high. As an example, uniformly distributed sequence and symmetric substitution read channel, high 19%.

In this paper, we consider a scenario where source node wishes to broadcast two confidential messages for respective receivers, while wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, individual secure are over open media and can be received any illegitimate receiver. The secrecy level measured equivocation rate at eavesdropper. We first study general (non-degraded) channel with messages. present an inner bound on capacity region model....

In this paper, we first consider a scenario where source node wishes to broadcast two confidential messages for respective receivers, while wire-taper also receives the transmitted signal. We assume that signals are over additive white Gaussian noise channels. characterize secrecy capacity region of channel. Our achievable coding scheme is based on superposition and random binning. refer as secret coding. The converse proof combines conventional channel perfect constraint. This matches...

In this paper, the impact of noncoordinated interfering signals on a point to communication is addressed. While transmitter has no information about other users' messages, receiver full knowledge codebooks users and can potentially decode some part interference. A simple coding strategy proposed for channel. Assuming its own data decoded successfully, partitions set into two disjoint subsets, namely decodable nondecodable users. Then transmitter's rate chosen such that intended signal be...

Understanding cell identity is an important task in many biomedical areas. Expression patterns of specific marker genes have been used to characterize some limited types, but exclusive markers are not available for types. A second approach use machine learning discriminate types based on the whole gene expression profiles (GEPs). The accuracies simple classification algorithms such as linear discriminators or support vector machines due complexity biological systems. We deep neural networks...