Sharif Digital Repository

A probabilistic method is developed here to model the beacon period length (BPL) defined in the ECMA-368 and ECMA-387 standards for the distributed reservation protocol. The model computes the probability mass function (PMF) of the BPL in a superframe which will be used in modeling of throughput, delay, fairness, power and other major distributed medium access control layer parameters of the emerging ultra wideband and 60- GHz millimeter wave wireless personal area networks. The model relates the PMF of the BPL to the network density, antenna beamwidth, and the transmission range of the devices assuming that the devices are distributed in an outdoor environment based on Two-dimensional... 

In this letter, a new molecular modulation scheme for nanonetworks is proposed. To evaluate the scheme, a system model based on the Poisson distribution is introduced. The error probability of the proposed scheme as well as that of two previously known schemes, the concentration and molecular shift keying modulations, are derived for the Poisson model by taking into account the error propagation effect of previously decoded symbols. The proposed scheme is shown to outperform the previously introduced schemes. This is due to the fact that the decoding of the current symbol in the proposed scheme does not encounter propagation of error, as the decoding of the current symbol does not depend on... 

Researchers have been studying security challenges of database outsourcing for almost a decade. Privacy of outsourced data is one of the main challenges when the "Database As a Service" model is adopted in the service oriented trend of the cloud computing paradigm. This is due to the insecurity of the network environment or even the untrustworthiness of the service providers. This paper proposes a method to preserve privacy of outsourced data based on Shamir's secret sharing scheme. We split attribute values into several parts and distribute them among untrusted servers. The problem of using secret sharing in data outsourcing scenario is how to search efficiently within the randomly... 

In this paper, we propose an information theoretic approach to fuse images compressed by compressed sensing (CS) techniques. The goal is to fuse multiple compressed images directly using measurements and reconstruct the final image only once. Since the reconstruction is the most expensive step, it would be a more economic method than separate reconstruction of each image. The proposed scheme is based on calculating the result using weighted average on the measurements of the inputs, where weights are calculated by information theoretic functions. The simulation results show that the final images produced by our method have higher quality than those produced by traditional methods, especially... 

Local noise can produce quantum correlations on an initially classically correlated state, provided that it is not represented by a unital or semiclassical channel. We find the power of any given local channel for producing quantum correlations on an initially classically correlated state. We introduce a computable measure for quantifying the quantum correlations in quantum-classical states, which is based on the noncommutativity of ensemble states in one party of the composite system. Using this measure we show that the amount of quantum correlations produced is proportional to the classical correlations in the initial state. The power of an arbitrary channel for producing quantum... 

In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion  

Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for different parts of the cake (i.e. one agent may like chocolate while the other may like cream). A fair division of the cake is one that takes into account the individual valuations of agents and partitions the cake based on some fairness criterion. Fair division may be accomplished in a distributed or centralized way. Due to its natural and practical appeal, it has been a subject of study in economics under the topic of 'Fair Division'. To best of our knowledge the role of partial information in fair division has not... 

This paper introduces a new applicable Gaussian wiretap channel with side information. In this channel, the state of the channel to the wiretapper is separated from the main channel's one. It means that the legitimate receiver and the wiretapper are listening to the transmitted signal through the different channels with different channel states which may have some correlation to each other. The state of the main channel, is assumed to be known at the transmitter, helps the sender to encrypt its messages. The achievable equivocation-rate region for this model is drived in the Gaussian case and the results are reduced to the previous works as special cases  

In this paper, lattice based coding is used over two-user Gaussian state-dependent multiple access channel with common message for two channel models. First, it is assumed that the additive channel interference is noncausally known at both encoders. Exploiting a lattice encoding and decoding scheme, the effect of the interference is completely removed and the capacity region is achieved. Then, the multiple access channel with two additive interferences is considered in the case, where each interference is known noncausally to the associated transmitter. A pure lattice based encoding and decoding structure is proposed and an inner bound on the capacity region is derived which is valid for the... 

Space-time block codes (STBCs) with orthogonal structures provide full-diversity reception and simple decoupled detection at the receiver. Rate-one orthogonal STBCs (OSTBC) for complex constellations have been found only for two transmit antennas. On the other hand, STBCs' designs are classically based on the assumption of independent and identically distributed (i.i.d.) fading channels. However, poor scattering conditions may have harmful effects on the performance of STBCs. In this paper, we first derive the average of received signal power at the receiver over Rician fading channel, when the signals are coded with linear dispersion code (LDC). Then by using a genetic algorithm (GA), we... 

This paper presents a scheme to enumerate the incident waves impinging on a high dimensional uniform linear array using relatively few samples. The approach is based on Minimum Description Length (MDL) criteria and statistical properties of eigenvalues of the Sample Covariance Matrix (SCM). We assume that several models, with each model representing a certain number of sources, will compete and MDL criterion will select the best model with the minimum model complexity and maximum model decision. Statistics of noise eigenvalue of SCM can be approximated by the distributional properties of the eigenvalues given by Marcenko-Pastur distribution in the signal-free SCM. In this paper we use random... 

We show that the two-dimensional (12D) Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all its spin-spin coupling equal to iπ4 and all parameters of the original model are contained in the local magnetic fields of the Ising model. This result has already been derived by using techniques from quantum information theory and by exploiting the universality of cluster states. Here we do not use the quantum formalism and hence make the completeness result accessible to a wide audience. Furthermore, our method has the advantage of being algorithmic... 

In this paper, we study the problem of coordinating two nodes which can only exchange information via a relay at limited rates. The nodes are allowed to do a two-round interactive two-way communication with the relay, after which they should be able to generate i.i.d. copies of two random variables with a given joint distribution within a vanishing total variation distance. We prove inner and outer bounds on the coordination capacity region for this problem. Our inner bound is proved using the technique of "output statistics of random binning" that has recently been developed by Yassaee, et al  

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and... 

We study the reliable transmission of correlated sources over the relay channel. One of the sources is available at the sender while the other one is known to the relay. The receiver wishes to reconstruct both sources. We find necessary and sufficient conditions for optimal separation of source and channel codes. The coding scheme is based on the combination of the Slepian-Wolf source coding and Partial Decode-and-Forward (PDF) strategy. In this scheme, the relay partially decodes the message transmitted by the sender. We also consider the semi-deterministic relay channel where the output at the relay is a deterministic function of inputs from the sender and the relay. For the transmission... 

We consider the problem of determining the tradeoff between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the block error probability, and show that there exists a universal parameter μ such that for any binary memoryless symmetric channel W with capacity I(W), reliable communication requires rates that satisfy R < I(W) - αN -1/μ, where α is a positive constant and N is the block-length. We provide lower bounds on μ, namely μ ≥ 3.553, and we conjecture that indeed μ = 3.627, the parameter for the binary erasure channel  

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel (BSC). The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the literature are not proved to be capacity achieving for channels other than Binary Erasure Channel. As opposed to the existing results in the literature, which are based on optimal maximum a posteriori decoders, the proposed approach is based on a different decoder... 

We investigate the secrecy capacity region of 2-receiver, 1-eavesdropper Broadcast Channel (BC) with two causal states and conferencing decoders. The encoder sends two messages, one of them for both legitimate receivers and the other one for the first legitimate receiver. It keeps these messages secret from the eavesdropper. Each state is causally available at the corresponding receiver, while both states are known causally at the encoder. Each receiver wishes to send the state which is not available at the other receiver, through a noiseless link with limited capacity. We find an inner bound on the secrecy capacity region of this channel. The achievability scheme employs block Markov coding... 

We study the problem of transmission of binary input non-linear functions over a network of mobiles based on CDMA. Motivation for this study comes from the application of using cheap measurement devices installed on personal cellphones to monitor environmental parameters such as air pollution, temperature and noise level. Our model resembles the MAC model of Nazer and Gastpar except that the encoders are restricted to be CDMA encoders. Unlike the work of Nazer and Gastpar whose main attention is transmission of linear functions, we deal with non-linear functions with binary inputs. A main contribution of this paper is a lower bound on the computational capacity for this problem. While in the... 

Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and auxiliary random variables. The optimizers turn out to be structured in many cases. Finding properties of optimizers not only results in efficient evaluation of the region, but it may also help one to prove factorization of Marton's inner bound (and thus its optimality). The first part of this paper formulates this factorization approach explicitly and states some conjectures and results along this line. The second part of this paper focuses primarily on the...