No abstract

Circuit partitioning plays an important role in physical design automation of very large scale integration (VLSI) chips. In this brief we present a new connectivity based top down as well as bottom up approach to clustering algorithm for VLSI circuit partitioning. The proposed clustering algorithm partitions the circuit by focusing on highly interconnected cell groups. This clustering algorithm leads to a parallel implementation in which multiple processors are used to identify clusters simultaneously. The process starts with forming clusters by grouping the cells that are tightly connected and as well as the cells that are loosely connected. Considering both types of groups has the advantage that clusters formed from this technique will be highly connected and compact too. Therefore the proposed clustering method can reduce the size and also speed-up the large-scale partitioning problem without loosing partitioning solution qualities. The performance of the proposed clustering algorithm is evaluated on a standard set of partitioning benchmark-ISPD98 benchmark suite.

No abstract

A blind audio watermarking algorithm in Discrete Cosine Transform domain using the relationship among the consecutive groups of samples is proposed in this work. Here, we divided the DCT represented audio signal into equal-sized non-overlapping segments which in turn divided into four non-overlapping consecutive frames. Here, an informative relation between the frames in a segment is maintained to indicate the successful embedding of a watermark i.e. in case of embedding '1' in a segment, make the value of the 'difference between the first two frames' higher than the value of the 'difference between the last two frames' at a distance of threshold value and we do the opposite if the watermark bit is '0'. Embedding a single watermark bit in multiple segments makes the scheme robust. In this work, the size of frame and the segment entirely depend on the number of watermark bit which helps the proposed scheme to increase the capacity of watermarking. Additionally, in order to maintain security against hackers a secret key permutation is proposed to apply on the watermark message. The experimental result shows that the method provides high robustness against common signal manipulation as well as high capacity without significant perceptual distortion.

Global connectivity to Mobile Ad Hoc Network (MANET) is necessary to access the

In this paper, a framework is presented for node distribution with respect to density, network connectivity and communication time. According to modeled framework we evaluate and compare the performance of three routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) in MANETs and VANETs using two Mac-layer protocols; 802.11 and 802.11p. We have further modified these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed in NS-2 for the comparison of these routing protocols for varying mobilities and scalabilities of nodes. To evaluate their efficiency; throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) of these protocols are taken into account as performance parameters. After extensive simulations, we observe that AODV outperforms both with MANETs and VANETs. Index Terms-MANETs, VANETs, AODV, DSR, FSR, Routing, Throughput, E2ED, NRLwhere,φ n (i) = φ n P n (i) and;2013 Eighth International Conference on Broadband, Wireless Computing, Communication and Applications 978-0-7695-5093-0/13 $31.00

No abstract

To truly realize potential ofMANET, multimedia services must be provisioned with a minimum level ofQoS. To meet the QoS requirement of such services, many attributes need to be considered. To keep the routing process lightweight, standard QoS aware routing protocol in MANET works with one or two such parameters. In this paper, we have proposed an on-demand source routing protocol for MANET that works with six important QoS attributes by varying priority for different category oftraffic flow. We have reflected this variation by incorporating Analytic Hierarchy Process in the proposal.