Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 113-132 of 1659
-
Antiresonance and Noise Suppression Techniques for Digital Power Distribution Networks
(2018-08-14)Power distribution network (PDN) design was a non-existent entity during the early days of microprocessors due to the low frequency of operation. Once the switching frequencies of the microprocessors started moving towards ... -
Application Of ANN Techniques For Identification Of Fault Location In Distribution Networks
(2008-10-03)Electric power distribution network is an important part of electrical power systems for delivering electricity to consumers. Electric power utilities worldwide are increasingly adopting the computer aided ... -
Application of coherent optical techniques in the study of serve mathematical operations
The aim of the project is to study some of the mathematical operations by coherent optical processing techniques with the help of gratings. These mathematical operations are namely: (1) Translation (2) Addition (3) ... -
Application of exponential power estimator for speech coding
In speech coding, it is known that the Differential Pulse Code Modulation (DPCM) schemes lead to the reduction of bandwidth requirement (by removing the redundancy) as compared to pulse Code Modulation (PCM) schemes, ... -
Application of finite graph models of context fue languages.
A finite graph model for a context?free language is proposed. The model is called an extended transition system; its nodes encode [pushdown automata state, top stack symbol] pairs and its arcs encode pushdown automaton ... -
Application of Semi Analytical Methods for Large Power System Simulations
Power system dynamics can be accurately modelled in time domain by using nonlinear differential and algebraic equations (DAEs). The challenge lies in solving the large number of nonlinear DAEs faster than real-time in order ... -
Application of trust region on methods to learning in feed forward neural networks
This thesis presents a novel algorithm for training feed-forward neural networks, addressing the limitations of the widely used back-propagation and Quickprop algorithms. While Quickprop is significantly faster than standard ... -
Approach to the Analysis of Scheduling Policies for Guaranteeing Delay with Arbitrary Arrivals
Many real-time applications require delay guarantees from the network. To achieve this, scheduling algorithms play a crucial role. Therefore, given a scheduling algorithm and a characterization of arriving traffic, it is ... -
Approach to the Analysis of Scheduling Policies for Guaranteeing Delay with Arbitrary Arrivals
Many real-tim e applications need a delay guarantee from th e network. For this scheduling algorithms are useful. Therefore, given a scheduling algorithm and a characterization of arriving traffic, it is im p o rtan t ... -
Approximate decoding over tail-biting trellises
This thesis proposes and implements soft-decision decoding algorithms on tail-biting trellises. For linear block codes, tail-biting trellises are interesting from a soft-decision decoding view-point, because of their reduced ... -
Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application
(2018-08-13)Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in the framework of Markov Decision Process (MDP). ... -
Approximation Algorithms for Geometric Packing and Covering Problems
We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ... -
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ... -
Approximation algorithms for the K- MST problem
Given a graph GGG on nnn vertices, the kkk-MST optimization problem is to find a tree spanning at least kkk vertices of GGG such that the cost of the tree is minimized over all such possible trees. The main contribution ... -
Architecture and Design of Wide Band Spectrum Sensing Receiver for Cognitive Radio Systems
(2018-01-03)To explore spectral opportunities in wideband regime for cognitive radio we need a wideband spectrum sensing receiver. Current wideband receiver architectures need wideband analog to digital converter (ADC) to sample ... -
Architecture Descriptions for Retargetable Code Translation
(Indian Institute of Science, 2005-03-14)The study of architectural parameterization has long neglected other parameterizations in favour of code selector descriptions. In this dissertation, we are concerned with providing linguistic notations for modelling ... -
Architecture, Performance and Applications of a Hierarchial Network of Hypercubes
(Indian Institute of Science, 2005-02-09)This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like versatile characteristics. The hierarchical ... -
Array combiner For GMRT
Today, Radio Astronomy has developed into a highly complex, interdisciplinary subject. Many radio astronomical problems need technologies from different engineering fields and knowledge from many scientific fields, at times ...