Sharif Digital Repository

Recently, it has been proved in Babadi [B. Babadi, N. Kalouptsidis, and V. Tarokh, "Asymptotic achievability of the Cramér-Rao bound for noisy compressive sampling", IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1233-1236, 2009] that in noisy compressed sensing, a joint typical estimator can asymptotically achieve the Cramér-Rao lower bound of the problem. To prove this result, Babadi used a lemma, which is provided in Akçakaya and Tarokh [M. Akçakaya and V. Trarokh, "Shannon theoretic limits on noisy compressive sampling", IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 492-504, 2010] that comprises the main building block of the proof. This lemma is based on the assumption of Gaussianity... 

The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions. In this paper, we have developed an algorithm based on Iterative Alternating Minimization technique which iteratively detects the location and the value of the channel taps. In fact, at each iteration we use an approximate Maximum A posteriori Probability (MAP) scheme for detection of the taps, while a least square method is used for estimating the values of the taps at each iteration. For approximate MAP detection, we have proposed three different methods leading to three variants for our algorithm. Finally, we... 

[No abstract available]  

In this paper, which is an extended version of our work at LVA/ICA 2010 [1], the problem of Inter Symbol Interface (ISI) Sparse channel estimation and equalization will be investigated. We firstly propose an adaptive method based on the idea of Least Mean Square (LMS) algorithm and the concept of smoothed l0 (SL0) norm presented in [2] for estimation of sparse ISI channels. Afterwards, a new non-adaptive fast channel estimation method based on SL0 sparse signal representation is proposed. ISI channel estimation will have a direct effect on the performance of the ISI equalizer at the receiver. So, in this paper we investigate this effect in the case of optimal Maximum Likelihood... 

In this paper, we firstly propose an adaptive method based on the idea of Least Mean Square (LMS) algorithm and the concept of smoothed l 0 (SL0) norm presented in [1] for estimation of sparse Inter Symbol Interface (ISI) channels which will appear in wireless and acoustic underwater transmissions. Afterwards, a new non-adaptive fast channel estimation method based on SL0 sparse signal representation is proposed. ISI channel estimation will have a direct effect on the performance of the ISI equalizer at the receiver. So, in this paper we investigate this effect in the case of optimal Maximum Likelihood Sequence-by-sequence Equalizer (MLSE) [2]. In order to implement this equalizer, we... 

In this paper, we investigate the implementation of wavelet modulation (WM) in a digital communication system and propose novel methods to improve its performance. We will put particular focus on the structure of an optimal detector in AWGN channels and address two main methods for inserting the samples of the message signal in different frequency layers. Finally, computer based algorithms are described in order to implement and optimize receivers and transmitters  

Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a fact, exploiting most of vulnerabilities result in access rights alteration. In this paper, we propose a new vulnerability analysis method based on the Take-Grant protection model. We extend the initial Take-Grant model to address the notion of vulnerabilities and introduce the vulnerabilities rewriting rules to specify how the protection state of the system can be changed by exploiting vulnerabilities. Our analysis is based on a bounded polynomial algorithm, which generates the closure of the Take-Grant graph... 

We study the translocation of stiff polymers through a nanopore, driven by the chemical-potential gradient exerted by binding proteins (chaperones) on the trans side of the pore. Bound chaperones prevent backsliding through the pore and, therefore, partially rectify the polymer passage. We show that the sequence of chain monomers with different binding affinity for the chaperones significantly affects the translocation dynamics. In particular, we investigate the effect of the nearest-neighbor adjacency probability of the two monomer types. Depending on the magnitude of the involved binding energies, the translocation speed may either increase or decrease with the adjacency probability. We... 

Combining the advection-diffusion equation approach with Monte Carlo simulations we study chaperone driven polymer translocation of a stiff polymer through a nanopore. We demonstrate that the probability density function of first passage times across the pore depends solely on the Péclet number, a dimensionless parameter comparing drift strength and diffusivity. Moreover it is shown that the characteristic exponent in the power-law dependence of the translocation time on the chain length, a function of the chaperone-polymer binding energy, the chaperone concentration, and the chain length, is also effectively determined by the Péclet number. We investigate the effect of the chaperone size on... 

The amount of rippling in graphene sheets is related to the interactions with the substrate or with the suspending structure. Here, we report on an irreversibility in the response to forces that act on suspended graphene sheets. This may explain why one always observes a ripple structure on suspended graphene. We show that a compression-relaxation mechanism produces static ripples on graphene sheets and determine a peculiar temperature Tc, such that for T