#### Filter Results:

#### Publication Year

2010

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- S Ajitha, N Kalaiarasi
- 2010

This paper presents a current-fed full-bridge boost DC-AC-DC converter with transformer isolation operating without switching power dissipation. The output voltage is regulated by dc-ac converter whose frequency changes with a constant turn-off time of transistors. The proposed converter is devoid of parasitic oscillations, as all of the parasitic… (More)

- Uthra R, N Kalaiarasi, P Srinivas Aruntej
- 2013

Stator current drift compensation of induction motor based on RBF neural network is proposed here. In vector control of induction motor decoupling of speed and rotor flux equations and their simultaneous control are used to achieve the highest efficiency and fast dynamic performance. The highest efficiency is reached when the proper flux is selected and as… (More)

- N. Kalaiarasi, Sahitya Bhoumik
- 2012

In this paper, the implementation of DSP algorithms on FPGA devices are taken into consideration and the FFT spectral analysis as a real time application was tested in MATLAB System Generator. It integrates two separate fields Digital Signal Processing (DSP) and Very Large Scale Integration (VLSI). The structure and chronological procedure followed focuses… (More)

In this paper, sensor drift compensation of vector control of induction motor using neural network is presented. An induction motor is controlled based on vector control. The sensors sense the primary feedback signals for the feedback control system which is processed by the controller. Any fault in the sensors cause incorrect measurements of feedback… (More)

FFT algorithms are mainly used for the calculation of DFT because they are preferred due to their increased speed and higher efficiency, which arises due to the fact that for the calculation of an N-pt DFT, the sequence is broken into several segments and the DFT for each segment is calculated. However, for this many redundant memory spaces and the… (More)

- N. Kalaiarasi
- 2010

FFT algorithms is one of the many methods used for the calculation of DFT, but they are preferred due to their increased speed and higher efficiency, which arises due to the fact that for the calculation of a N-point DFT, the sequence is broken into several segments and the DFT for each segment is calculated. However, for this many redundant memory spaces… (More)

- ‹
- 1
- ›