FPGA Based Control Method for Three Phase BLDC Motor

This paper introduces a good method which is helpful to assist in the design and control of cost effective, efficient Brushless Direct Current (BLDC) motors. Speed Control of BLDC motor using PIC microcontrollers requires more hardware, and with the availability of FPGA versatile features motivated to develop a cost effective and reliable control with variable speed range. In this paper, an algorithm which uses the Resolver signals captured from the motor is developed with the help of Resolver to Digital converters. The program has been written using VHDL. This program generates the firing pulses required to drive the MOSFETs of three phase fully controlled bridge converter driven by drivers. Then the program has been loaded on the Spartan- 3 FPGA device and tested on the 30V, 2000 rpm BLDC motor which can make the motor run at constant speed ranging from 10 to 2000 rpm. The proposed hardware and the program are found to be very good and efficient. The results are good compare to PIC Microcontroller based design

Information from quantum blackhole physics

The study of BTZ blackhole physics and the cosmological horizon of 3D de Sitter spaces are carried out in unified way using the connections to the Chern Simons theory on three manifolds with boundary. The relations to CFT on the boundary is exploited to construct exact partition functions and obtain logarithmic corrections to Bekenstein formula in the asymptotic regime. Comments are made on the dS/CFT correspondence frising from these studies.Comment: 11 pages; 1 figure(eps file);Talk presented at the conference Space-time and Fundamental Interactions: Quantum Aspects'' in honour of A.P. Balachandran's 65th birthday, Vietri sul Mare, Salerno, Italy 26th-31st May, 200

Algorithmic Motion Planning and Related Geometric Problems on Parallel Machines (Dissertation Proposal)

The problem of algorithmic motion planning is one that has received considerable attention in recent years. The automatic planning of motion for a mobile object moving amongst obstacles is a fundamentally important problem with numerous applications in computer graphics and robotics. Numerous approximate techniques (AI-based, heuristics-based, potential field methods, for example) for motion planning have long been in existence, and have resulted in the design of experimental systems that work reasonably well under various special conditions [7, 29, 30]. Our interest in this problem, however, is in the use of algorithmic techniques for motion planning, with provable worst case performance guarantees. The study of algorithmic motion planning has been spurred by recent research that has established the mathematical depth of motion planning. Classical geometry, algebra, algebraic geometry and combinatorics are some of the fields of mathematics that have been used to prove various results that have provided better insight into the issues involved in motion planning [49]. In particular, the design and analysis of geometric algorithms has proved to be very useful for numerous important special cases. In the remainder of this proposal we will substitute the more precise term of algorithmic motion planning by just motion planning