Sharif Digital Repository

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

The main recognition procedure in modern HMM-based continuous speech recognition systems is Viterbi algorithm. Viterbi algorithm finds out the best acoustic sequence according to input speech in the search space using dynamic programming. In this paper, dynamic programming is replaced by a search method which is based on particle swarm optimization. The major idea is focused on generating initial population of particles as the speech segmentation vectors. The particles try to achieve the best segmentation by an updating method during iterations. In this paper, a new method of particles representation and recognition process is introduced which is consistent with the nature of continuous... 

In this paper, a fast phoneme recognition system is introduced based on sparse representation. In this approach, the phoneme recognition is fulfilled by Viterbi decoding on support vector machines (SVM) output probability estimates. The candidate classes for classification are adaptively pruned by a k-dimensional (KD) tree search followed by a sparse representation (SR) based class selector with adaptive number of classes. We applied the proposed approach to introduce a phoneme recognition system and compared it with some well-known phoneme recognition systems according to accuracy and complexity issues. By this approach, we obtain competitive phoneme error rate with promising computational... 

This paper presents a solution in order to solve the problem of using HMM-based POS tagger in some languages where a word can be comprised of several tokens. Viterbi algorithm is modified in order to support segment of words within a model state. In the other word, the proposed system has a built-in tokenizer where indicates words boundaries as well as its corresponding tag sequence  

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

We consider an internally coded multiple access technique for Ultra Wide-Band systems which combines time-hopping (TH) and spread-time (ST) techniques using a super-orthogonal encoder. In this method, the duration of each bit is divided into Ns frames. The outputs of a superorthogonal encoder and a PN sequence specify the frame number, in which the data is transmitted in spread-time CDMA form using the second PN sequence. We consider soft decision before Viterbi decoding at the receiver. We obtain the performance of the proposed method. We also consider the uncoded ST-CDMA system and compare its performance with our method. The results indicate that our method has much more better... 

One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorithms yield to many attempts in this field, but there is a long way to solve these problems efficiently, yet. The importance of the problem encouraged us to work on a new approach as a solution. We use the content of web pages together with the link structure between them to improve the accuracy of results. In this work we use Naïve-bayes models for each predefined webpage class and an extended version of Hidden Markov Model is used as website class models. A few sample websites are adopted as seeds to calculate... 

In CDMA systems with variable number of users, the decoder consists of two stages. The first stage is the active user identification and the second one is the multi-user detection. Most of the proposed active user identification methods fail to work in overloaded CDMA systems (when the number of users is more than the spreading factor). In this paper we propose a joint active user identification and multi-user detection for binary input CDMA systems using the Viterbi algorithm. We will show that the proposed identification/detection method is Maximum A posteriori Probability (MAP) and outperforms the pervious results. In addition, some suboptimum decoders will be proposed that have lower... 

Inserting redundancy to arithmetic codes is a common strategy to add error detection capability to this well-known family of source codes. By using this strategy error correction is possible through some decoding algorithms such as Viterbi decoder. In this paper a system has proposed that uses finite state integer arithmetic codes (FSAC) as a joint source-channel code in combination with a cyclic redundancy check (CRC) and a List Viterbi decoder. The proposed scheme has shown better performance than previous ones. © 2009 IEEE  

We consider an internally coded scheme for multicarrier frequency-hopping CDMA (MC-FH-CDMA) communication systems. In this method, the total bandwidth is partitioned into Ns1 disjoint bands and each band is also segmented into Ns2 subbands. Based on the super-orthogonal encoder output and a pseudorandom (PN) sequence, one of the Ns1 bands is selected. Then, the data is transmitted in that band in the form of multicarrier frequency-hopping technique using BPSK modulation. At the receiver front end, we use soft detector, then we apply Viterbi decoding algorithm. We evaluate the performance of the proposed method. The results indicate that our method outperforms the previously presented uncoded... 

The main core of HMM-based speech recognition systems is Viterbi algorithm. Viterbi algorithm uses dynamic programming to find out the best alignment between the input speech and a given speech model. In this paper, dynamic programming is replaced by a search method which is based on particle swarm optimization algorithm. The major idea is focused on generating an initial population of segmentation vectors in the solution search space and improving the location of segments by an updating algorithm. Several methods are introduced and evaluated for the representation of particles and their corresponding movement structures. In addition, two segmentation strategies are explored. The first... 

The main core of HMM-based speech recognition systems is the Viterbi Algorithm. Viterbi is performed using dynamic programming to find out the best alignment between input speech and given speech model. In this paper, dynamic programming is replaced by a search method which is based on particle swarm optimization algorithm. The major idea is focused on generating an initial population of segmentation vectors in the solution search space and improving the location of segments by an updating algorithm. Two methods are introduced for representation of each particle and movement structure. The results show that the effect of these factors is noticeable in finding the global optimum while... 

Guess-and-determine (GD) attacks are general attacks on stream ciphers, which have often been implemented in an ad hoc manner. The authors introduce a heuristic approach to the design of GD attacks, that is a dynamic programming method using a Viterbi-like algorithm which is a well-known decoding algorithm for convolutional codes. The authors also show that with this method, the resulting GD attacks, named heuristic GD (HGD) attacks, on TIPSY, SNOW1 and SNOW2 lead to less computational complexity than the previously known GD attacks. The main advantage of HGD attacks, over ad hoc GD attacks, is that while being powerful, they can be designed algorithmically for classes of stream ciphers,... 

In this paper, we consider the internally coded time-hopping spread-time multiple access scheme introduced in [1]. We evaluate the performance of the correlator receiver followed by the Viterbi algorithm in fading channel. We analyze the effect of multiple access interference (MAI) and narrowband interference (NBI). We also provide simulation results and further evaluate the performance of the system for the ultra wide band (UWB) application with the UWB channel model specified by the IEEE 802.15.4a group. For comparison, we consider the conventional ST-CDMA system. The results indicate that our method has much better performance while it has the same bandwidth and spectral efficiency as the... 

Network function virtualization (NFV) and software-defined networking (SDN) are two promising technologies to enable 5G and 6G services and achieve cost reduction, network scalability, and deployment flexibility. However, migration to full SDN/NFV networks in order to serve these services is a time-consuming process and costly for mobile operators. This paper focuses on energy efficiency during the transition of mobile core networks (MCN) to full SDN/NFV networks and explores how energy efficiency can be addressed during such migration. We propose a general system model containing a combination of legacy nodes and links, in addition to newly introduced NFV and SDN nodes. We refer to this...