Sharif Digital Repository

In this paper, we introduce a generalization of the Multiple-Access-Relay- Channel (MARC) called Multiple-Access-Relay-Network (MARN). In the proposed network, there are many transmitters, many relays and one receiver. The MARC model was first introduced by Kramer and consists of many transmitters, one receiver and only one relay.We also define semi-deterministic MARN, in which the output of the link between each transmitter and each relay is a deterministic function of the transmitter's input. We first obtain an achievable rate region for MARN by considering Partial Decode-and-Forward (PDF) strategy at the relays. Then we show that in semi-deterministic MARN, the proposed achievable rate... 

In this letter, we study the joint source-channel coding problem of communicating the linear functions of correlated Gaussian sources over a Gaussian multiple access channel. In this setup, each transmitter observes one of two correlated sources. The receiver aims to reconstruct a linear combination of both correlated Gaussian sources within an average distortion level. For this setup, we first obtain a new lower bound on the achievable distortion and then, we propose a novel lattice-based hybrid transmission scheme and its achievable distortion is derived. We show that our proposed scheme can achieve the optimal distortion under some conditions  

In this paper, we propose a new transmission scheme, called integer forcing-and-forward (IFF), for communications among multipair multiple-antenna users in which each pair exchanges their messages with the help of a single multiple-antenna relay in the multiple-access and broadcast phases. The proposed scheme utilizes integer forcing linear receiver (IFLR) at the relay, which uses equations, i.e., linear integer combinations of messages, to harness intrapair interference. Accordingly, we propose the design of a mean square error (MSE)-based transceiver, including precoder and projection matrices for the relay and users, assuming that perfect channel state information (CSI) is available. In... 

In this letter, the Gaussian two-way relay channel with direct links is investigated in which two users aim at exchanging their messages with the help of a relay node. We propose a new lattice-based compress-and-forward strategy and obtain its achievable rate-region. We show that the proposed scheme is superior to all previously known achievable schemes for channel gains larger than one. In particular, under the symmetric case, the proposed scheme is able to achieve a capacity region within 0.5 bit or (1/2)log 3 ≅ 0.79 bit, depending on the power of the relay  

We consider a group of m trusted and authenticated nodes that aim to create a shared secret key K over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free, noiseless and unlimited rate public channel which is also overheard by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for "linear deterministic" wireless broadcast channels. This model generalizes the packet erasure model studied in literature for... 

For a Rayleigh fading full-duplex decode-and-forward relay channel, we analytically derive optimum power allocation schemes subject to individual power constraints for the source and the relay. The optimization problem is taken over the source power and the relay power. It is proven that the optimization problem is concave for this scenario, and optimum power allocations are derived in a closed-form. Finally, the implications of the theoretical results are discussed through the graphs  

We introduce a model of a non-Gaussian quantum channel that stems from the composition of two physically relevant processes occurring in open quantum systems, namely, amplitude damping and dephasing. For it we find input states approaching zero output entropy while respecting the input energy constraint. These states fully exploit the infinite dimensionality of the Hilbert space. Upon truncation of the latter, the minimum output entropy remains finite, and optimal input states for such a case are conjectured thanks to numerical evidence  

In this paper, we study the problem of secret communication over a compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential, which is only decoded by its corresponding receiver and kept secret from the other receiver. We call this proposed setting the compound MAC with a confidential message. For this model, we derive general inner and outer bounds for both imperfect and perfect secrecy conditions for the second receiver. Also, as examples, we investigate less noisy and Gaussian versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the... 

In this letter, we consider two problems of sending a bivariate Gaussian source through a two-user Gaussian non-orthogonal multiple-access channel. We provide a new distortion outer bound for the considered joint source-channel coding problems, which significantly reduces the gap between inner and outer bounds of the distortion for correlation coefficients below a threshold. Furthermore, numerical results show, that under some conditions, our proposed outer bound matches with the inner bound obtained via the separate source-channel coding scheme, which proves the optimality of this scheme. © 1997-2012 IEEE  

In this paper, the impact of a small variations in the channel gains on the secrecy rate of the wiretap channel is studied, in which it is assumed that the imperfect channel knowledge is available at the transmitter. First, we consider general additive noise model for both legitimate and eavesdropper channels in the wiretap channel, and compute the variation of the secrecy rate resulting from the small variations in the channel gains. Then, we focus on the Gaussian wiretap channel, as a special case and calculate the sensitivity of the secrecy capacity to the channel gains with imperfect channel knowledge. Interestingly, it is shown that in some situations the effect of the channel variation... 

We study the problem of remote reconstruction of a continuous signal from its multiple corrupted versions. We are interested in the optimal number of samples and their locations for each corrupted signal to minimize the total reconstruction distortion of the remote signal. The correlation among the corrupted signals can be utilized to reduce the sampling rate. For a class of Gaussian signals, we show that in the low sampling rate region, it is optimal to use a certain nonuniform sampling scheme on all the signals. On the other hand, in the high sampling rate region, it is optimal to uniformly sample all the signals. We also show that both of these sampling strategies are optimal if we are... 

Two gains play key roles in recently developed multiple-input-multiple-output (MIMO) wireless communication systems: 'spatial diversity' gain and 'spatial multiplexing' gain. The diversity gain (DG) refers to the capability to decrease the error rate of the MIMO channel, whereas the multiplexing gain (MG) implicitly refers to the amount of increase in the capacity of the MIMO channel. It has been shown that there is a fundamental tradeoff between these two types of gains, meaning interplay between increasing reliability (via an increase in the DG) and increasing data rate (via an increase in the MG). On the other hand, recently, MIMO radars have attracted much attention for their superior... 

We consider a group of m trusted and authenticated nodes that aim to create a shared secret key K over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state-dependent wireless broadcast channel from one of the honest nodes to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free, noiseless and unlimited rate public channel which is also overheard by Eve. For this setup, we develop an information-theoretically secure secret key agreement protocol. We show the optimality of this protocol for 'linear deterministic' wireless broadcast channels. This model generalizes the packet erasure model studied in the literature... 

Multiple-input multiple-output (MIMO) radars have attracted much attention for their superior ability to enhance a system's performance. In this study, the authors' goal was the study of the spatial multiplexing gain of MIMO radars with widely separated antennas (WS-MIMO), which the authors showed that is equal to the number of unambiguously detectable targets. They obtained this number from two different aspects: first, by defining the ambiguity function of a WS-MIMO radar in the case of multiple targets, suitable for such purpose; Second, by modelling the MIMO radar system with a MIMO wireless channel. They showed that a MIMO radar is indeed a MIMO wireless system communicating the... 

In this paper, we investigate an energy harvesting cooperative network in which the cooperation is done in a random access environment. Although the cooperation provides an extra harvested energy supply for transmissions of the source, it causes probable collisions for the transmitted source packets. Thus, this kind of cooperation can improve or degrade the QoS of the source packets. We find the optimal policy in such a scenario to maximize the source throughput and derive the necessary and sufficient condition for no-cooperation policy to be throughput-optimal. Then, we prove that the maximum throughput is obtained by considering no-cooperation or full-cooperation policy depending on the... 

This paper introduces a new method for the least significant bit (LSB) steganography in spatial domain. The new method, called one-third LSB embedding, reduces the probability of change per pixel to one-third without sacrificing the embedding capacity, as compared to previous LSB steganography techniques. This improvement results in a better imperceptibility and higher robustness against well known LSB detectors. Each bit of the message is carried through a function of three adjacent cover pixels and it is shown that no significant improvement is achieved by increasing the length of the pixel sequence employed. ©2009 IEEE  

Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of computing VP for any query point efficiently, with some additional preprocessing phase. The scene consists of a set of obstacles, of total complexity O(n). We show for a query point q, VP(q) can be computed in logarithmic time using O(n 4) space and O(n 4 logn) preprocessing time. Furthermore to decrease space usage and preprocessing time, we make a tradeoff between space usage and query time; so by spending O(m) space, we can achieve O(n 2 log √ m/n)/√ m)query time, where n 2≤m≤n 4. These results are also applied to... 

Few works has been focused on the problem of joint distributed data compression and network coding. In this paper we give some examples showing the advantage of broadcast nature of wireless environment as a basis for joint codes design. Also we show that joint coding is possible in the case of multiple unicasts. The idea of this paper can be exploited in an opportunistic manner. Actually, the foundation of our idea is nothing but combining opportunistic network coding (COPE) and distributed source coding using syndromes (DISCUS) for wireless applications. © 2009 IEEE  

The authors indicate the dependence between the inputs of the relay channel with one auxiliary random variable as Cover, El-Gamal and Salehi have done for the multiple access channel with arbitrarily correlated sources. Then, by considering broadcast and multiple access sub-channels in the relay channel, the authors describe the essential role of the relay with special Markovity conditions on the auxiliary random variable and channel input-outputs, and unify most of known capacity theorems into one capacity theorem. The capacity theorem potentially may be applicable to a more general class of relay channels including at least the relay channels with known capacity. © The Institution of... 

In estimating an unknown parameter of a quantum state the quantum Fisher information (QFI) is a pivotal quantity, which depends on the state and its derivate with respect to the unknown parameter. We prove the continuity property for the QFI in the sense that two close states with close first derivatives have close QFIs. This property is completely general and irrespective of dynamics or how states acquire their parameter dependence and also the form of parameter dependence-indeed this continuity is basically a feature of the classical Fisher information that in the case of the QFI naturally carries over from the manifold of probability distributions onto the manifold of density matrices. We...