Magister

Permanent URI for this collectionhttps://dspace.univ-boumerdes.dz/handle/123456789/60

Browse

Start date: 2000Subject: search.filters.subject.Algorithmes

Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    Maximum power point tracking (MPPT) for photovoltaic system
    (2011) Malki, Sihem
    This thesis presents a theoretical study of maximum power point tracking (MPPT) for photovoltaic (PV) system. The study includes discussion of various MPPT algorithms and perform comparative tests of the two popular MPPT algorithms (the Perturbation and Observation algorithm and the Incremental and Conductance algorithm) using actual irradiance data. Some important applications of the MPPT for different loads are described; first the PV system with resistive load is discussed, the modeling and the simulation of the PV generator and the DC/DC converter is carried out using MATLAB software. After that a .study of PV water pumping system has been undertaken using DC motor and AC motor. A comparison between the performance of those systems with and without MPPT in terms of PV total energy produced and total volume of water pumped per day is carried out. Results show that MPPT can very significantly improve the performance of PV pumping system
  • No Thumbnail Available
    Item
    Implementation of IP cores dedicated to cryptography
    (2012) Alouani, Brahim
    This work consists to implement IP cores dedicated to cryptography, using an FPGA as a hardware working platform and VHDL as a hardware description language. The cryptography can be classified into two main parts. Secret key and public key encryption. The last one is more complicated because it uses hard arithmetic; the RSA (Rivest, Shamir, and Adleman), DH (Diffie-Hellman Key Agreement) and the elliptic curve algorithm (ECC) are the most used public key protocols in cryptography. The modular exponentiation is the core operation in these protocols. The security of these systems depends directly on the key bit lenght, in practice (between 160 and 1024 bits or more in some applications). A high bit length and complicated operations as the modular arithmetic make the hardware solution better in different applications. The modular exponentiation can be done by successive operations of modular multiplication, that is why we chose modular multiplication as a problematic in this report. Montgomery and the interleaved are the most modular product algorithms appropriate to hardware design. In our case; we chose an optimized version of Montgomery
  • No Thumbnail Available
    Item
  • No Thumbnail Available
    Item
    Analysis of small microstrip patch antennas for mobile communication
    (2010) Mouhouche, Faiza
    This work presents the analysis and design of small microstrip patch antennas that can be used in mobile communication using Finite Difference Time Domain (FDTD) method. The formulation of the FDTD algorithm is described along with its fundamental properties. At the beginning, the method is applied to the arbitrary shaped patch; and the radio-electric properties of the considered microstrip patch antennas are formulated. The method is then applied to some known structure shapes working in high microwave frequency bands; the shapes include rectangular (dipole), annular-ring and semi-ring patches. Different feeding methods (Microstrip line feed and coaxial line feed) are used to energize the considered antennas. The input impedance (VSWR), the return loss, and the far field radiation patterns calculated with the aid of FDTD method and compared with the results obtained with the HFSS simulator. Due to the nature of the chosen method, a new shape of patch is designed and analyzed. The new structure is named Berber-Z patch antenna taken from “TIFINAGH” Berber alphabet. The obtained results are Validated the HFSS simulator