http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

Principles of Plant Breeding.

The present capabilities of speech recognition algorithms will be surveyed. The application of IC technology to the implementation of these algorithms will be explored and potential future directions will be determined.

Speech recognition

We describe various design automation solutions for design migration to a dual-Vt process technology. We include the results of a Lagrangian relaxation based tool, iSTATS, and a heuristic iterative optimization flow. Joint dual-Vt allocation and sizing reduces total power by 10+% compared with Vt allocation alone, and by 25+% compared with pure sizing methods. The heuristic flow requires 5/spl times/ larger computation runtime than iSTATS due to its iterative nature.

/pdf/total-power-optimization-by-simultaneous-dual-vt-allocation-51sc8wwpbu.pdf

Total power optimization by simultaneous dual-Vt allocation and device sizing in high performance microprocessors

One of the challenging issues in optical networks is call blocking and it increases with the number of connection requests due to the limited number of wavelength channels in each fiber link. In this paper, we propose a priority based routing and wavelength assignment scheme with incorporation of a traffic grooming mechanism (PRWATG) to reduce call blocking. In this scheme, the connection requests having the same source-destination (s-d) pair are groomed first to avoid intermediate optical-electrical-optical conversation and then these groomed connection requests are served for routing and wavelength assignment according to their priority order. The priority order of each groomed connection request is estimated based on type of path (direct link physical path or indirect link physical path) first and then the traffic volume. If the priority order of connection requests is estimated using these criteria, blocking of connection requests due to wavelength continuity constraints can be reduced to a great extent, which will in turn lead to better performance of the network in terms of lower blocking probability and congestion. The performance analysis of our proposed scheme is made in terms of blocking probability and congestion and compared with a similar non-priority based routing and wavelength assignment scheme (NPRWATG). It is seen that using the PRWATG scheme, the blocking probability and the congestion of the network are significantly reduced compared to NPRWATG. It is also seen that the performance of the proposed scheme is better compared to NPRWATG when the number of connection requests increases in the network.

Priority based routing and wavelength assignment with traffic grooming for optical networks

Introduction.- MOS Fabrication Technology.- MOS Transistors.- MOS Inverters.- MOS Combinational Circuits.- Sources of Power Dissipation.- Supply Voltage Scaling for Low Power.- Switched Capacitance Minimization.- Leakage Power Minimization.- Adiabatic Logic Circuits.- Battery-Aware Systems.- Low Power Software Approaches.

Low-Power VLSI Circuits and Systems

/pdf/assisted-leach-a-leach-energy-efficient-routing-protocol-for-59npfcflc2.pdf

Assisted-Leach (A-Leach) Energy Efficient Routing Protocol for Wireless Sensor Networks

Development of the process technology for dual threshold (dual V/sub th/) CMOS circuit has opened up the possibility of using it to reduce static power in low voltage high performance circuits. It has been demonstrated that by using transistors of a low threshold voltage for gates on the critical path, and by using a high threshold voltage for gates in the off-critical path it is possible to significantly reduce leakage power consumption of a circuit without performance degradation. In this paper we have a new algorithm to realize dual CMOS circuits. Our algorithm produces significantly better results for ISCAS benchmark circuits compared to reported results.

Optimal assignment of high threshold voltage for synthesizing dual threshold CMOS circuits

In wavelength routed optical networks, the number of wavelength channels is limited due to several constraints and each wavelength as well as each lightpath support traffic in the Gbps range. On the other hand, the traffic requested by an individual connection is still in the Mbps range. Therefore, to utilize the network resources (such as bandwidth and transceivers) effectively, several low-speed traffic streams have to be efficiently groomed or multiplexed into one or more high-speed lightpaths. The grooming problem of a static demand is considered as an optimization problem. In this work, we have investigated the traffic grooming problem with the objective of maximizing the network throughput for wavelength-routed mesh networks and map this problem to the clique partitioning problem. We have proposed an algorithm to handle general multi-hop static traffic grooming based on the clique partitioning concept. The efficiency of our approach has been established through extensive simulation on different sets of traffic demands with different bandwidth granularities for different network topologies and compared the approach with existing algorithms.

Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning

Thirty eight genotypes of bread wheat (Triticum aestivum L) collected from DWR, Karnal, Haryana were evaluated in Randomized Block Design with three replications at the Teaching Farm of the Bidhan Chandra Krishi Viswavidyalaya in 2008–09 crop season Observations for eighteen different yield contributing characters viz, plant height, days to heading, flowering, maturity, tiller number per plant, length of spike, number of spikes per plant, and per meter square, number of spikelets per spike, number of grains per spike, grain weight per spike, chlorophyll-a, b and total chlorophyll content, thousand grain weight, grain protein content, yield per plant and grain weight per meter square were recorded The genotypes exhibited significant variation for all the characters studied The estimate of PCV in all the traits studied were greater than those of the GCV, The close proximity between PCV and GCV values for most of the characters indicated less influence of environment on the expression of the characters under study Considering heritability, most of the characters showed high values High heritability coupled with high genetic advance (in % of mean) were recorded for the grain weight per spike, per plant and per meter square, number of grains per spike, thousand grain weight and the grain protein content indicating the characters to be under additive genetic control and also scope of improvement through direct selection

Ajit Pal

Papers

Low-Power VLSI Circuits and Systems

Assisted-Leach (A-Leach) Energy Efficient Routing Protocol for Wireless Sensor Networks

Optimal assignment of high threshold voltage for synthesizing dual threshold CMOS circuits

Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning

Estimation of variability for yield parameters in Bread Wheat (Triticum aestivum L.) grown in Gangetic West Bengal