Génie Eléctriques
Permanent URI for this communityhttps://dspace.univ-boumerdes.dz/handle/123456789/58
Browse
7 results
Search Results
Item Task partition based parallel design and implementation of the MSSM algorithm on network of transputers(1995) Cheref, MohamedThe present work is concerned with the parallel design and implementation of the multiple scale signal matching (MSSM) [26,38] algorithm on a transporter [7,10,25,40] network. The MSSM algorithm is based on a multichannel vision model [35], to establish the correspondence between two images with the allowance that one of them can be deformed elastically. The MSSM algorithm uses a process consisting of two stages: the filtering and the matching stages. This process is iterated following a coarse-to-fine regime of the vision channels [35] at which the matching process is performed…Item On the irreducible realization of rational transfer function matrices(1995) Yaici, MalikaThe problem of finding the minimal realization of a given transfer function matrix has been studied by several authors. it is to determine state variable realizations with the minimum possible number of states. the irreducible realization is useful in analog and digital computer simulation or operational amplifier circuit synthesis of the transfer function. irreducible realizations are desirable for reasons of economy and sensitivity…Item Multivariable design via the solution of the lyapunov equation(1999) Amroune, HouriaRelocating poles theory has been the subject of an important number of research studies. Using state feedback for this purpose is a widely used technique because of its simplicity and the quality of control achieved. the control signal is designed to be a function of the state and the reference signal. Controllability of an open-loop system is equivalent to the possibility of assigning anarbitrary set of eigenvalues to the closed-loop system's matrix by means of suitable linear feedback of the state…Item Design and implementation of a parallel wavelet transform algorithm using unity model and systolic arrays(1997) Yahiaoui, AichaIn the past two decades, there has been a tremendous progress in the development and analysis of parallel programs for different applications. Since the time required to solve a problem by a traditional computer is significantly reduced when using a parallel computer, we worked on the design and analysis of a parallel algorithm to solve the wavelet transform because the analysis and synthesis using wavelets has became a very useful tool for analyzing non-stationary signals in completion of the windowed Fourier transform which is the most known time-frequency representation…Item Application of parallel processing to medical imaging(2008) Bouklachi, AbbesCe travail de recherche consiste à la conception de solutions efficientes à des algorithmes d’imagerie médicale en termes de performance, de croissante et de généralité. Nous avons sélectionné des algorithmes qui présentent une complexité considérable et une importante charge et conçu des solutions basées sur deux concepts. Le premier consiste a exploiter le parallélisme inhérent dans l’algorithme tandis que le deuxième consiste a coder les donnés avec une structure qui nous permet d’identifier les régions cohérentes et par conséquent réduire le temps d’exécution pour les régions homogènes. En outre, nous avons utilisé les modèles parallèles pour exploiter une variété de formes de synchronisation et de planification sur les topologies de réseaux pour assurer la balance de charge et l’habilité de croissance. Finalement, nous avons utilisé des architectures de machine abstraite pour étudier les algorithmes et de débattre leurs efficacités sans se soucier d’un hardware spécifiqueItem Algorithms for the factorization of matrix polynomials(1992) Dahimene, AbdelhakimThe factorization (root finding) of scalar polynomials is an important tool of analysis and design for linear systems. This thesis is a part of an ongoing effort to generalize these tools to multivariable systems via the factorization of matrix polynimials. The main contribution of this thesis can be summarized as follows...Item Continuous speech recognition(2009) Dahimene, AbdelhakimContinuous speech recognition is one of the greatest challenges in this beginning of the centurie. The impressive advances in hardware allow the use of sophisticated mathematical methods to solve complex problems. In this thesis, we show that methods invented for solving long constraint length convolutional codes can be used in speech recognition. The main contributions of this thesis can be summarized as follows: (1) The applicability of the stack decoding algorithm to continuous speech recognition. (2) The development and the analysis of a path metric based on the Mahalanobis distance. This path metric has been used in the implementation of the stack algorithm in recognition program and also in the Viterbi algorithm in the training program. (3) The development of a novel algorithm for clipped speech restoration based on linear prediction (4) Speech denoising method based on time varying Wiener filters. We obtained remarkable results using a very low order filter. (5) In order to develop a good path metric for our stack algorithm, we have performed a statistical analysis of three parametric representations of speech and we have shown that the MFCC set is nearly Gaussian and provides the best separability between classes as compared with LPC and PARCOR coefficients. (6) In the last chapter of the thesis, we have developed an automatic segmentation algorithm that we use for training the speech recognition program