Sharif Digital Repository

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... 

In this paper, we develop and analyze a novel performance metric, called interference efficiency, which shows the number of transmitted bits per unit of interference energy imposed on the primary users (PUs) in an underlay cognitive radio network (CRN). Specifically, we develop a framework to maximize the interference efficiency of a CRN with multiple secondary users (SUs) while satisfying target constraints on the average interference power, total transmit power, and minimum ergodic rate for the SUs. In doing so, we formulate a multiobjective optimization problem (MOP) that aims to maximize ergodic sum rate of SUs and to minimize average interference power on the primary receiver. We solve... 

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... 

In this paper, we consider the problem of sending a bivariate correlated Gaussian source through a two-user Gaussian orthogonal multiple-access channel (MAC), where each encoder observes a noisy version of one of the source components, and the receiver aims at reconstructing each source component. The estimation quality is measured by mean-squared error (MSE) distortion criterion. Different components of the source have their own fidelity requirements instead of total or average distortion measure. It is easy to verify that for this problem, digital communication has an optimal performance. However, it is not explicit that when there is a constraint on the total power budget, what power... 

In this paper, a novel method is exposed to improve the performance of the Golden code. In fact, we recommend using the octagonal reconfigurable isolated orthogonal element (ORIOL) antennas instead of a conventional microstrip patch antenna. In order to obtain a dramatic improvement, the ORIOL antenna should be employed in both the transmitter and the receiver sides. Accordingly, in this paper, we recommend space-time-polarization diversity instead of space-time singly; therefore, it is obvious that by employing this technique, the system obtains more strength against destructive fading. The simulations for different rates have confirmed that utilizing the ORIOL antenna outperforms patch... 

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... 

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  

An efficient method for optimal allocation of wavelengths in a hybrid dense-wavelength-division-multiplexing system, carrying both quantum and classical data, is proposed. The transmission of quantum bits alongside intense classical signals on the same fiber faces major challenges arising from the background noise generated by classical channels. Raman scattering, in particular, is shown to have detrimental effects on the performance of quantum key distribution systems. Here, by using a nearly optimal wavelength allocation technique, we minimize the Raman induced background noise on quantum channels, hence maximize the achievable secret key generation rate for quantum channels. It turns out... 

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... 

The severity of timing delay in the communication channels of Network on Chip (NoC) depends on the transition patterns appearing on the wires. An analytical model can estimate the timing delay in NoC channels in the presence of crosstalk faults. However, recently proposed analytical model does not have enough accuracy and is based on 3-wire delay model. In this paper, an Accurate Crosstalk Model (ACM) based on 5-wire delay model is proposed to estimate the delay of communication channels in the presence of crosstalk faults. ACM is more accurate due to considering more wires in the delay model and also considering the overlaps between locations of transition patterns  

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... 

Lattice codes are known to outperform random codes for certain networks, especially in the Gaussian two-way relay channels (GTWRCs) where lattice codes are able to exploit their linearity. As an extension of the GTWRC, in this paper, we consider the asymmetric Gaussian two-way line network where two nodes exchange their messages through multiple relays. We first investigate the capacity region of the full-duplex two-way two-relay line network. The results can be extended to an arbitrary number of relays and to half-duplex scenarios. This channel consists of four nodes: 1 ↔ 2 ↔ 3 ↔ 4, where nodes 1 and 4 with the help of two full-duplex relays, i.e., nodes 2 and 3, exchange their messages... 

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, an extended large wireless network, with a single transmitter-receiver pair, under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI. Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named stochastic virtual beamforming, is proposed. Applying this scheme, any desired pair of secure rate and outage level denoted by (Rs, ϵ) will be achievable... 

We extend the result by Tse and Verdú on the optimum asymptotic multiuser efficiency of randomly spread code division multiple access (CDMA) with binary phase shift keying input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a K-user system with spreading gain N when K and N → ∞ and the loading factor, (K/N) , grows logarithmically with K under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high signal-to-noise ratio when K and N → ∞ and the loading factor, (K/N), is kept less than (log3 K/2). Random binary... 

In this paper, we address the problem of recovering degraded images using multivariate Gaussian mixture model (GMM) as a prior. The GMM framework in our method for image restoration is based on the assumption that the accumulation of similar patches in a neighborhood are derived from a multivariate Gaussian probability distribution with a specific covariance and mean. Previous methods of image restoration with GMM have not considered spatial (geometric) distance between patches in clustering. Our conducted experiments show that in the case of constraining Gaussian estimates into a finite-sized windows, the patch clusters are more likely to be derived from the estimated multivariate Gaussian... 

We introduce the concepts of cohering and decohering power of quantum channels. Using the axiomatic definition of the coherence measure, we show that the optimization required for calculations of these measures can be restricted to pure input states and hence greatly simplified. We then use two examples of this measure, one based on the skew information and the other based on the l1 norm; we find the cohering and decohering measures of a number of one-, two-, and n-qubit channels. Contrary to the view at first glance, it is seen that quantum channels can have cohering power. It is also shown that a specific property of a qubit unitary map is that it has equal cohering and decohering power in... 

Network-on-Chip (NoC) is a key element in the total power consumption of a chip multiprocessor. Dynamic Voltage Scaling is a promising method for power saving in NoCs since it contributes to reduction in both static and dynamic power consumptions. In this paper, we propose a novel scheme to reduce on-chip network power consumption when the number of Virtual Channels (VCs) with active allocation requests per cycle is less than the number of total VCs. In our method, we introduce a reconfigurable arbitration logic which can be configured to have multiple latencies and hence, multiple slack times. The increased slack times are then used to reduce the supply voltage of the routers in order to... 

Polar codes are a new class of error correcting linear block codes, whose generator matrix is specified by the knowledge of transmission channel parameters, code length and code dimension. Moreover, regarding computational security, it is assumed that an attacker with a restricted processing power has unlimited access to the transmission media. Therefore, the attacker can construct the generator matrix of polar codes, especially in the case of binary erasure channels, on which this matrix can be easily constructed. In this paper, we introduce a novel method to keep the generator matrix of polar codes in secret in a way that the attacker cannot access the required information to decode the... 

In a MIMO (Multiple Input Multiple Output) radar system, proper design of transmit signal and receive filter is an advantageous tool to improve the detection performance. Thus, in this paper, we consider the problem of transmit code and receive filter design, in order to maximize the Signal to Noise Ratio (SNR) at the receiver while enforcing a similarity constraint between the transmit space-time code (STC) and a reference STC which has a desirable ambiguity function. We will show that by solving such constrained optimization problem through successive iterations, our proposed method leads to satisfactory results