Search

The Digital Image processing applications like medical imaging, satellite imaging, Biometric trait images etc., rely on multipliers to improve the quality of image. However, existing multiplication techniques introduce errors in the output with consumption of more time, hence error free high speed multipliers has to be designed. In this paper we propose FPGA based Recursive Error Free Mitchell Log Multiplier (REFMLM) for image Filters. The 2x2 error free Mitchell log multiplier is designed with zero error by introducing error correction term is used in higher order Karastuba-Ofman Multiplier (KOM) Architectures. The higher order KOM multipliers is decomposed into number of lower order multipliers using radix 2 till basic multiplier block of order 2x2 which is designed by error free Mitchell log multiplier. The 8x8 REFMLM is tested for Gaussian filter to remove noise in fingerprint image. The Multiplier is synthesized using Spartan 3 FPGA family device XC3S1500-5fg320. It is observed that the performance parameters such as area utilization, speed, error and PSNR are better in the case of proposed architecture compared to existing architectures

This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, short-range, low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture, industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit data to a sink node, but cannot receive acknowledgement control signals from the sink node. The proposed protocol GORMA provides QoS to the nodes which work independently on predefined time by allowing them to transmit each packet an optimal number of times within a given period. Our simulation results shows that the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and two QoS groups and minimize the energy consumption., Comment: 9 pages in IEEE format and 6 figures

Energy management is one of the critical parameters in Wireless Sensor Networks. In this paper we attempt for a solution to balance the energy usage for maximizing the network lifetime, increase the packet delivery ratio and throughput. Our proposed algorithm is based on Energy Density of the clusters in Wireless Sensor Networks. The cluster head is selected using two step method and on-demand routing approach to calculate the balanced energy shortest path from source to sink. This unique approach maintains the balanced energy utilization among all nodes by selecting the different cluster heads dynamically. Our simulation results have compared with one of the plain routing scheme (EBRP) and cluster based routing (TSCHS), which shows the significant improvements in minimizing the delay and energy utilization and maximizing the network lifetime and throughput with respect to these works., Comment: 18 pages,7 Figures

Similarity matching and join of time series data streams has gained a lot of relevance in today's world that has large streaming data. This process finds wide scale application in the areas of location tracking, sensor networks, object positioning and monitoring to name a few. However, as the size of the data stream increases, the cost involved to retain all the data in order to aid the process of similarity matching also increases. We develop a novel framework to addresses the following objectives. Firstly, Dimension reduction is performed in the preprocessing stage, where large stream data is segmented and reduced into a compact representation such that it retains all the crucial information by a technique called Multi-level Segment Means (MSM). This reduces the space complexity associated with the storage of large time-series data streams. Secondly, it incorporates effective Similarity Matching technique to analyze if the new data objects are symmetric to the existing data stream. And finally, the Pruning Technique that filters out the pseudo data object pairs and join only the relevant pairs. The computational cost for MSM is O(l*ni) and the cost for pruning is O(DRF*wsize*d), where DRF is the Dimension Reduction Factor. We have performed exhaustive experimental trials to show that the proposed framework is both efficient and competent in comparison with earlier works., Comment: 20 pages,8 figures, 6 Tables

Web sequential patterns are important for analyzing and understanding users behaviour to improve the quality of service offered by the World Wide Web. Web Prefetching is one such technique that utilizes prefetching rules derived through Cyclic Model Analysis of the mined Web sequential patterns. The more accurate the prediction and more satisfying the results of prefetching if we use a highly efficient and scalable mining technique such as the Bidirectional Growth based Directed Acyclic Graph. In this paper, we propose a novel algorithm called Bidirectional Growth based mining Cyclic behavior Analysis of web sequential Patterns (BGCAP) that effectively combines these strategies to generate prefetching rules in the form of 2-sequence patterns with Periodicity and threshold of Cyclic Behaviour that can be utilized to effectively prefetch Web pages, thus reducing the users perceived latency. As BGCAP is based on Bidirectional pattern growth, it performs only (log n+1) levels of recursion for mining n Web sequential patterns. Our experimental results show that prefetching rules generated using BGCAP is 5-10 percent faster for different data sizes and 10-15% faster for a fixed data size than TD-Mine. In addition, BGCAP generates about 5-15 percent more prefetching rules than TD-Mine., Comment: 19 pages

In this paper, we propose a high capacity, self-synchronized, lossless audio watermarking algorithm based on the alpha (‘ �’) statistic modulation. Here ‘ �’ is related to the correlation among any given sequence i.e audio samples and it is modulated according to the watermark bit stream. The embedding scheme is tested in both the time domain and DWT domain. Though the time domain embedding reduces the computational time in searching the synchronization codes, the time-frequency localization capability of DWT provides good trade off between the computational complexity and robustness of synchronization codes. In case of DWT, ‘�’ related to the 2 nd level DWT coarse wavelet components is used for embedding the watermark. The offset value used for embedding is made adaptive to the required SNR for the final watermarked audio signal. After extraction of the embedded watermark using a watermark key, original audio can be recovered with minimal distortion. The watermarking method presented here does not require the use of the original signal for watermark detection. Also high embedding capacity is achieved by using small sized audio frames. Experimental results reveal that the proposed watermarking scheme maintains high audio quality and is simultaneously highly robust to pirate attacks, including MP3 compression, cropping, filtering, re-sampling, and re-quantization.