scispace - formally typeset
Search or ask a question

Showing papers by "Ankit Gupta published in 2013"


Journal Article
TL;DR: This paper gives an overview of Modeling and simulation of Doubly Fed Induction generator (DFIG) coupled with wind turbine and the response of DFIG wind turbine system to grid disturbances, which is simulated and verified experimentally.
Abstract: This paper gives an overview of Modeling and simulation of Doubly Fed Induction generator (DFIG) coupled with wind turbine. Latest researches and developments which have been published in imminent journals through rigorous review are overviewed in this paper. Because of the advantages of the DFIG over other generators it is being used for most of the wind applications. Various researches have been done in modelling and simulation field of DFIG coupled with wind turbine. This paper summarises the researches in the area of study of DFIG, steady state and transient analysis, its modelling, simulation, reactive power control strategies and performance analysis of DFIG coupled with wind turbine. The response of DFIG wind turbine system to grid disturbances, which is simulated and verified experimentally, is overviewed here. The behaviour of DFIG wind turbine system for different faults is also overviewed in this paper.

16 citations


Journal ArticleDOI
TL;DR: This paper introduces a term called ‘wastage capacity’, which gives the amount of wastage caused when a code (single or multiple) with a data rate higher than the rate of the incoming call is assigned to it, and suggests two methods to keep wastage capacity below an arbitrary threshold value or zero.
Abstract: SUMMARY Most third-generation and beyond wideband code division multiple access networks use the orthogonal variable spreading factor code tree for channelization codes. The codes in this code tree are limited and the performance of a wireless network depends upon the code assignment for new calls. In this paper, we introduce a term called ‘wastage capacity’, which gives us the amount of wastage caused when a code (single or multiple) with a data rate higher than the rate of the incoming call is assigned to it. We suggest two methods to keep wastage capacity below an arbitrary threshold value or zero. In the first method, we devised an algorithm in which wastage up to a certain threshold would be tolerated and the minimum rakes to get this wastage capacity were identified. In the second approach, we reduced the wastage capacity to zero irrespective of the number of rakes at the expense of higher cost and complexity. Copyright © 2011 John Wiley & Sons, Ltd.

3 citations