Sharif Digital Repository

One of the most important practices of cybercrime investigations is to search a network traffic history for an excerpt of traffic, such as the disclosed information of an organization or a worm's signature. In post-mortem investigations, criminals and targets are detected by attributing the excerpt to payloads of traffic flows. Since it is impossible to store the high volume of data related to long-term traffic history, payload attribution systems (PASs) based on storing a compact digest of traffic using Bloom filters have been presented in the literature. In these systems, querying the stored digest for an excerpt results in a low number of suspects instead of certain criminals. In this... 

the parallel form in adaptive HR filtering is an efficient realization that provides robust stability monitoring with less complexity than that of the direct form. This paper presents an implementation of two line parallel structure employing a real orthogonal transform and real coefficients second-order section as sub filters on FPGA. Architecture that is implemented is in pipeline fashion and it is independent from its building blocks and they may have its own implementation or in other system numbering. In the last section, we compared throughput of our architecture with a Ti DSP (TMS320C3x/4x), the results show that this architecture works better than the DSP  

This paper describes an improved version of the recently proposed fast converging algorithm. PNLMS, for network echo cancellers. We have introduced a simple analysis of the PNLMS convergence behavior to show why after the fast initial convergence, it slows down. Also, the method has been worked out to overcome this deficiency is presented. Improvement is shown by several simulation results. © 2002 IEEE  

Automatic image annotation methods generate a list of tags for each test image and present it in a matrix structure. To achieve a more accurate annotation, we propose a method with the aim of correcting the tag list. In our method, we detect an indicator for each group of tags and use it to rectify the annotation results. To find a correct indicator, we apply a deep feature vector generated by the “AlexNet” model. Using this indicator, we determine the suitable tags for an image. The purposed method is independent of feature vector, dataset, and annotation method. It can be applied to the currently available annotation methods. Our experiments showed improvement in all annotation methods... 

In this paper, a two channel abdominal PPG instrumentation is developed. The proposed instrument consists of IR-LED and its driver, photo-detector and data acquisition card. The modulation frequency generation, demodulation and digital signal processing is done completely in the digital domain using LabView. The results show that the developed instrument is able to acquire signal from the abdomen even at 4 cm source to detector separation. This instrument is intended for future application in trans-abdominal fetal heart rate detection. © 2008 Springer-Verlag  

In this paper, a new graph product, called Edge Graph Product (EGP) is proposed by replacing each edge in the multiplicand graph by a copy of the multiplier graph via two candidate nodes. The edge product, unlike other products already proposed, results in a graph whose number of edges is numerical product of the number of the edges in the multiplicand and multiplier graphs, and the number of vertices is not equal to the numerical product of the number of vertices in the multiplicand and multiplier graphs. After formal definition of the new product, some basic properties of the product operator are studied. We then address Hamiltonian, Eulerian and routing properties of the new product, and... 

In this paper, a new algorithm for Sparse Component Analysis (SCA) in the noisy underdetermined case (i.e., with more sources than sensors) is presented. The solution obtained by the proposed algorithm is compared to the minimum l1 -norm solution achieved by Linear Programming (LP). Simulation results show that the proposed algorithm is approximately 10 dB better than the LP method with respect to the quality of the estimated sources. It is due to optimality of our solution (in the MAP sense) for source recovery in noisy underdetermined sparse component analysis in the case of spiky model for sparse sources and Gaussian noise. © 2007 IEEE  

A wireless network with beamforming capabilities at the receiver is considered that allows two or more transmitters to share the same channel to communicate with the base station. A novel approach is introduced, which combines the effects of the digital signal processing (adaptive beamforming) at the physical layer with the traffic policies at the network layer on the overall queuing model of a cell. The effect of signal processing on the queuing model of the cell is represented by a parameter in the final cell model. Each cell is modeled by a multiuser/multiserver service facility, where each server is a beamformed channel formed by the cell's base station. From this effective cell model,... 

The main motivation behind compressive sensing is to reduce the sampling rate at the input of a digital signal processing system. However, if for processing the sensed signal one requires to reconstruct the corresponding Nyquist samples, then the data rate will be again high in the processing stages of the overall system. Therefore, it is preferred that the desired processing task is done directly on the compressive measurements, without the need for the reconstruction of the Nyquist samples. This paper addresses the case in which the processing task is “detection” (the existence) of a sparse signal in additive white Gaussian noise, with applications e.g. in radar systems. Moreover, we will... 

In this paper, a diffusion-based molecular communication channel between two nano-machines is considered. The effect of the amount of memory on performance is characterized, and a simple memory-limited decoder is proposed; its performance is shown to be close to that of the best possible decoder (without any restrictions on the computational complexity or its functional form), using genie-aided upper bounds. This effect is adapted to the case of Molecular Concentration Shift Keying; it is shown that a four-bit memory achieves nearly the same performance as infinite memory for all of the examples considered. A general class of threshold decoders is considered and shown to be suboptimal for a... 

Classical sampling theorem states that by using an anti-aliased low-pass filter at the Nyquist rate, one can transmit and retrieve the filtered signal. This approach, which has been used for decades in signal processing, is not good for high quality speech, image and video signals where the actual signals are not low-pass but rather sparse. The traditional sampling theorems do not work for sparse signals. Modern approach, developed by statisticians at Stanford (Donoho and Candes), give some lower bounds for the minimum sampling rate such that a sparse signal can be retrieved with high probability. However, their approach, using a sampling matrix called compressive matrix, has certain... 

This work provides a canonical representation for manipulation of RTL designs. Work has already been done on a canonical and graph-based representation called Taylor Expansion Diagram (TED). Although TED can effectively be used to represent arithmetic expressions at the word-level, it is not memory efficient in representing bit-level logic expressions. In addition, TED cannot represent Boolean expressions at the word-level (vector-level). In this paper, we present modifications to TED that will improve its ability for bit-level logic representation while enhancing its robustness to represent word-level Boolean expressions. It will be shown that for bit-level logic expressions, the Enhanced... 

Trigonometric functions are one of the most applicable functions in digital signal processing. In this paper, we propose two approaches for optimizing pipeline implementation of the CORDIC algorithm and compare it with other previous approaches. The proposed solutions are implemented on one of the Xilinx Virtex family's FPGAs. Our simulation results show that for high input bits, our approach is preferable to other existing approaches. ©2007 IEEE  

An HMM-based speech enhancement in Mel-frequency domain is introduced and improved. It is shown that hidden Markov modeling in the Mel-frequency domain is beneficial due to its effective representation of the speech spectrum; however, speech enhancement in this domain requires an inversion from the Mel-frequency to the spectral domain which introduces distortion artifacts for spectrum estimation. To reduce the distortion effects of the inversion and employ the advantages of robustness modeling in the Mel-frequency domain, a parallel cepstral and spectral (PCS) modeling is proposed. In PCS, a concurrent modeling in both cepstral and spectral domains is performed. The performances of the... 

Reducing the computational complexity as well as convergence time is the main task of adaptive antenna array processing. This article proposes an improved algorithm for estimating the weights of adaptive array elements based on Constant Modulus Algorithm (CMA). In this new type of algorithm, those weights that have higher effect on the radiation pattern will be estimated and antenna pattern will be adjusted by changing these weights. In this research, 3 new algorithms are proposed. By simulating these algorithms and comparing them with conventional full weight CMA, finally new algorithm that has a reduced complexity and an acceptable performance at different signal to noise ratios (SNRs) is... 

In this paper a new least mean square (LMS) based adaptive weighting algorithm is proposed. It is appropriate for antenna array systems with moving targets and mobile applications. The essential goal of this algorithm is to reduce the complexity of weighting process and to decrease the time needed for adjusting the antenna radiation pattern. The main lobe of antenna will be adjusted in the direction of desired signal (main signal) and nulls pointed in the direction of undesired signals (interference signals). By predicting the relative velocity of source, the next location of the source will be estimated and the array weights will be determined using LMS algorithm before arriving to the new... 

Time-interleaved analog to digital converters (TI-ADC) offer high sampling rates by passing the input signal through C parallel low-rate ADCs. We can achieve C-times the sampling rate of a single ADC if all the shifts between the channels are identical. In practice, however, it is not possible to avoid mismatch among shifts. Besides, the samples are also subject to jitter noise. In this paper, we propose a blind method to mitigate the joint effects of sampling jitter and shift mismatch in the TI-ADC structure. We assume the input signal to be bandlimited and incorporate the jitter via a stochastic model. Next, we derive an approximate model based on a first-order Taylor series and use an... 

This paper presents two new space time block codes (STBCs) with quasi orthogonal structure for an open loop multi-input single-output (MISO) systems. These two codes have been designed to transmit from three or four antennas at the transmitter and be given to one antenna at the receiver. In this paper first, the proposed codes are introduced and their structures are investigated. This is followed by the demonstration of how the decoder decodes half of transmitted symbols independent of the other half. The last part of this paper discusses the simulation results, makes performance comparison against other popular approaches and concludes that the proposed solutions offer superiority