Search
Now showing items 1-10 of 10
Spectral estimation using WRLS algorithm for multiband detection
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
Signal parameter estimation in the presence of noise has been a key area of research. Many applications have benefited from advancements made in this field within the last two decades. The method proposed in the thesis ...
Path complexity of maximum segment sum problem
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...
Localization for a habitat monitoring sensor network for ground turtles
(Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
This thesis work deals with the localization problem (i.e. finding the location of the sensor nodes) in sensor networks. This work is specifically concerned with the localization of the sensor nodes on small ground turtles ...
Embedding binary trees and caterpillars into the hypercube
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary ...
On path complexities of heapsort algorithm and the class stack
(Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
A measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two ...
Improved algorithms for modular multiplication and its application to block cipher RC6
(Dhirubhai Ambani Institute of Information and Communication Technology, 2004)
This thesis explores the area of hardware implementation of block ciphers. An al¬gorithm for modular multiplication is proposed which is efficient in terms of speed and area. To demonstrate the effectiveness of the algorithm ...
Path complexity of the class binary search tree
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...
Efficient algorithms for hierarchical online rule mining
(Dhirubhai Ambani Institute of Information and Communication Technology, 2006)
Association rule Mining, as one of the technologies equipped with Data Mining, deals with the challenge of mining the informative associations from the fast accumulating data. From the past decade, the research community ...
Object classification in images using information slicing
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
Human visual system, in real world, identifies objects by their shapes, sizes and colors. More than often we identify objects around us specifically by using contextual knowledge of the objects. For example, an area of ...
High-speed 512-point FFT single-chip processor architecture
(Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
This thesis present a fully parallel novel fixed point 16-bit word width 512 point FFT processor architecture. The 512 point FFT is realized by decomposing it into three 8 point FFT units. This approach reduces the number ...