51 research outputs found

    A new algorithm for factorization of logic expressions

    Get PDF
    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (leaves 53-54).by Farzan Fallah.M.S

    Wind farm reactive power optimization by using imperialist competitive algorithm

    Get PDF
    In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for optimization of the reactive power in a wind farm. The output power and also the reactive power of wind farms are not constant due to the oscillation in wind speed. Reactive power optimization is known as an efficient way to have an improvement in power quality and also to reduce power loss. The conventional optimization algorithms have some drawbacks, such as slow convergence and premature. ICA as one of the newest optimization algorithm could be applied in order to optimization of the reactive power and overcomes the difficulties which are coming from the traditional methods. In this paper, the reactive power consumption of a wind turbine is optimized by using (ICA) method. To illustrate the application of the method, a wind farm with some uncertainties is provided. Finally the results of the ICA method are compared with the one of conventional method. Results show that the proposed reactive power optimization method is simple and effective

    PID controller adjustment for MA-LFC by using a hybrid genetic-tabu search algorithm

    Get PDF
    In this paper a hybrid Genetic-Tabu Search Algorithm (GT) is used for tuning the elements of a PID controller which is applied in a Multi Area Load Frequency Control System (MA-LFC). If a large power imbalance is suddenly happened in a multi area power electric system, generation units and also consumer sides will be affected by the distortion in the energy balance between both two sides. This inequality is firstly handled by the kinetic energy of the system turning components, but, eventually, the frequency will change. Therefore, LFC is considered as one of the most challenging issues in power system control and operation. PID type controllers are conventional solutions for MA-LFC. The three parameters of the PID controllers have been adjusted traditionally. In this paper, a PID controller is applied for the MA-LFC problem and then its parts are modified by using GT method. To validate the application of the technique, a multi area network with some uncertainties is provided. Finally the results of the GT-PID controller are compared with the ones of GA optimized controllers. The simulation results show the success and the validity of the GT-PID controller in compare with the GA - PID controller

    Custom Integrated Circuits

    Get PDF
    Contains table of contents for Part III, table of contents for Section 1 and reports on eleven research projects.IBM CorporationMIT School of EngineeringNational Science Foundation Grant MIP 94-23221Defense Advanced Research Projects Agency/U.S. Army Intelligence Center Contract DABT63-94-C-0053Mitsubishi CorporationNational Science Foundation Young Investigator Award Fellowship MIP 92-58376Joint Industry Program on Offshore Structure AnalysisAnalog DevicesDefense Advanced Research Projects AgencyCadence Design SystemsMAFET ConsortiumConsortium for Superconducting ElectronicsNational Defense Science and Engineering Graduate FellowshipDigital Equipment CorporationMIT Lincoln LaboratorySemiconductor Research CorporationMultiuniversity Research IntiativeNational Science Foundatio

    Coverage-directed validation of hardware models

    No full text
    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (leaves 157-160 ).With the rapid increase in the number of transistors that can be fabricated on a single chip, digital systems have become very complex. The increase in the complexity of the digital systems, and the desire to achieve faster time-to-market has made the use of the Computer-Aided Design (CAD) tools indispensable. Designers typically start with writing behavioral or Register-Transfer level (RTL) description of the system functionality using a Hardware Description Language (HDL). After that they transform the HDL description to the gate-level, transistor level, and finally generate mask-level layout which is used to manufacture the chip. CAD tools are used extensively to execute transformations between different levels of abstraction. They also help to optimize the design so as to achieve better performance and meet different constraints relating to speed, power consumption, and area. In order to have a working chip, the designer has to make sure that the original HDL description is correct and also that no error is introduced during transformations to the lower levels. Currently validation of the initial HDL description and verifying the design in different levels of abstraction against each other is a major bottleneck in the design process. Because the HDL description is usually the first description of the design, simulation is the primary methodology for validating it. Simulation-based verification is necessarily incomplete because it is not computationally feasible to exhaustively simulate designs. It is important therefore to quantitatively measure the degree of verification coverage of the design. Simulation-based validation has suffered from a disconnect between the metrics used to measure the coverage of a set of simulation vectors and the vector generation process. This disconnect has resulted in the simulation of virtually endless streams of vectors which achieve enhanced coverage only infrequently. Another drawback has been that most coverage metrics proposed have either been too simplistic or too inefficient to compute. This thesis provides the details of an efficient method to compute an Observability-based Code COverage Metric (OCCOM) that can be used while simulating complex HDL designs. It also introduces a new method for generating test vectors under any coverage metric. In this thesis the problem of generating test vectors for both combinational and sequential circuits under OCCOM is discussed. A prototype system which generates test vectors under the OCCOM coverage metric has been built. The system can be used during the design process, as well as during post-design debugging to validate the initial HDL description.by Farzan Fallah.Ph.D

    Q[damaged area -- whole fields] ::> [Diagnosis = Anthracnose] D13: Q([time = Apr... Jul] [precipitation >_ n] [leaves = abn] (leafspots halos -- no yellow halosl[leafspots watersoaked margin = abs] (leafspot size> /s inch](leaf shredding = p]) + O([damage

    No full text
    This paper addresses the problem of low-power fanout optimization. We show that due to neglecting short-circuit current, previous analytical techniques proposed to optimize the area of a fanout tree may result in excessive power consumption. This shows to achieve a low-power fanout tree, an accurate power consumption model should be used as the objective function. Moreover, we propose an efficient method to minimize the total power consumption of a fanout tree by using MTCMOS and Multi-Vt techniques. Experimental results show that depending on the activity factor of the circuit, the proposed technique can reduce the power consumption of the fanout tree 18 % to 45%

    Simulation Vector Generation from HDL Descriptions for Observability-Enhanced Statement Coverage

    No full text
    Validation of RTL circuits remains the primary bottleneck in improving designturnaround time, and simulation remains the primary methodology for validation. Simulation-based validation has suffered from a disconnect between the metrics used to measure the error coverage of a set of simulation vectors, and the vector generation process. This disconnect has resulted in the simulation of virtually endless streams of vectors which achieve enhanced error coverage only infrequently. Another drawback has been that most error coverage metrics proposed have either been too simplistic or too inefficient to compute. Recently, an effective observability-based statement coverage metric was proposed along with a fast companion procedure for evaluating it. The contribution of our work is the development of a vector generation procedure targeting the observability-based statement coverage metric. Our method uses repeated coverage computation to minimize the number of vectors generated. For vector gen..
    corecore