54 resultados para Power, Eugene B., 1905-
em Indian Institute of Science - Bangalore - Índia
Resumo:
Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.
Resumo:
This paper presents three methodologies for determining optimum locations and magnitudes of reactive power compensation in power distribution systems. Method I and Method II are suitable for complex distribution systems with a combination of both radial and ring-main feeders and having different voltage levels. Method III is suitable for low-tension single voltage level radial feeders. Method I is based on an iterative scheme with successive powerflow analyses, with formulation and solution of the optimization problem using linear programming. Method II and Method III are essentially based on the steady state performance of distribution systems. These methods are simple to implement and yield satisfactory results comparable with the results of Method I. The proposed methods have been applied to a few distribution systems, and results obtained for two typical systems are presented for illustration purposes.
Resumo:
Contention-based multiple access is a crucial component of many wireless systems. Multiple-packet reception (MPR) schemes that use interference cancellation techniques to receive and decode multiple packets that arrive simultaneously are known to be very efficient. However, the MPR schemes proposed in the literature require complex receivers capable of performing advanced signal processing over significant amounts of soft undecodable information received over multiple contention steps. In this paper, we show that local channel knowledge and elementary received signal strength measurements, which are available to many receivers today, can actively facilitate multipacket reception and even simplify the interference canceling receiver¿s design. We introduce two variants of a simple algorithm called Dual Power Multiple Access (DPMA) that use local channel knowledge to limit the receive power levels to two values that facilitate successive interference cancellation. The resulting receiver structure is markedly simpler, as it needs to process only the immediate received signal without having to store and process signals received previously. Remarkably, using a set of three feedback messages, the first variant, DPMA-Lite, achieves a stable throughput of 0.6865 packets per slot. Using four possible feedback messages, the second variant, Turbo-DPMA, achieves a stable throughput of 0.793 packets per slot, which is better than all contention algorithms known to date.
Resumo:
In this paper, a new approach to enhance the transmission system distance relay co-ordination is presented. The approach depends on the apparent impedance loci seen by the distance relay during all possible disturbances. In a distance relay, the impedance loci seen at the relay location is obtained by extensive transient stability studies. Support vector machines (SVMs), a class of patterns classifiers are used in discriminating zone settings (zone-1, zone-2 and zone-3) using the signals to be used by the relay. Studies on a sample 9-bus are presented for illustrating the proposed scheme.
Resumo:
We study the thermoelectric power under classically large magnetic field (TPM) in ultrathin films (UFs), quantum wires (QWs) of non-linear optical materials on the basis of a newly formulated electron dispersion law considering the anisotropies of the effective electron masses, the spin-orbit splitting constants and the presence of the crystal field splitting within the framework of k.p formalism. The results of quantum confined III-V compounds form the special cases of our generalized analysis. The TPM has also been studied for quantum confined II-VI, stressed materials, bismuth and carbon nanotubes (CNs) on the basis of respective dispersion relations. It is found taking quantum confined CdGeAs2, InAs, InSb, CdS, stressed n-InSb and Bi that the TPM increases with increasing film thickness and decreasing electron statistics exhibiting quantized nature for all types of quantum confinement. The TPM in CNs exhibits oscillatory dependence with increasing carrier concentration and the signature of the entirely different types of quantum systems are evident from the plots. Besides, under certain special conditions, all the results for all the materials gets simplified to the well-known expression of the TPM for non-degenerate materials having parabolic energy bands, leading to the compatibility test. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
We study power dissipation for systems of multiple quantum wires meeting at a junction, in terms of a current splitting matrix (M) describing the junction. We present a unified framework for studying dissipation for wires with either interacting electrons (i.e., Tomonaga-Luttinger liquid wires with Fermi-liquid leads) or noninteracting electrons. We show that for a given matrix M, the eigenvalues of (MM)-M-T characterize the dissipation, and the eigenvectors identify the combinations of bias voltages which need to be applied to the different wires in order to maximize the dissipation associated with the junction. We use our analysis to propose and study some microscopic models of a dissipative junction which employ the edge states of a quantum Hall liquid. These models realize some specific forms of the M matrix whose entries depends on the tunneling amplitudes between the different edges.
Resumo:
A generalized technique is proposed for modeling the effects of process variations on dynamic power by directly relating the variations in process parameters to variations in dynamic power of a digital circuit. The dynamic power of a 2-input NAND gate is characterized by mixed-mode simulations, to be used as a library element for 65mn gate length technology. The proposed methodology is demonstrated with a multiplier circuit built using the NAND gate library, by characterizing its dynamic power through Monte Carlo analysis. The statistical technique of Response. Surface Methodology (RSM) using Design of Experiments (DOE) and Least Squares Method (LSM), are employed to generate a "hybrid model" for gate power to account for simultaneous variations in multiple process parameters. We demonstrate that our hybrid model based statistical design approach results in considerable savings in the power budget of low power CMOS designs with an error of less than 1%, with significant reductions in uncertainty by atleast 6X on a normalized basis, against worst case design.
Carbohydrate binding specificity of the B-cell maturation mitogen from Artocarpus integrifolia seeds
Resumo:
Artocarpin, a mannose-specific lectin, is a homotetrameric protein (M(r) 65,000) devoid of covalently attached carbohydrates and consists of four isolectins with pI in the range 5-6.5. Investigations of its carbohydrate binding specificity reveal that among monosaccharides, mannose is preferred over glucose. Among mannooligosaccharides, mannotriose (Man alpha 1-3[Man alpha 1-6]Man) and mannopentaose are the strongest ligands followed by Man alpha 1-3Man. Extension of these ligands by GlcNAc at the reducing ends of mannooligosaccharides tested remarkably improves their inhibitory potencies, while substitution of both the alpha 1-3 and alpha 1-6 mannosyl residues of mannotriose and the core pentasaccharide of N-linked glycans (Man alpha 1-3[Man alpha 1-6]Man beta 1-4GlcNAc beta 1-4GlcNAc) by GlcNAc or N-acetyllactosamine in beta 1-2 linkage diminishes their inhibitory potencies. Sialylated oligosaccharides are non-inhibitory. Moreover, the substitution of either alpha 1-3 or alpha 1-6 linked mannosyl residues of M5Gn or both by mannose in alpha 1-2 linkage leads to a considerable reduction of their inhibitory power. Addition of a xylose residue in beta 1-2 linkage to the core pentasaccharide improves the inhibitory activity. Considering the fact that artocarpin has the strongest affinity for the xylose containing hepasaccharide from horseradish peroxidase, which differs significantly from all the mannose/glucose-specific lectins, it should prove a useful tool for the isolation and characterization of glycoproteins displaying such structure.
Resumo:
In this paper, an attempt is made to study the influence of external light waves on the thermoelectric power under strong magnetic field (TPSM) in ultrathin films (UFs), quantum wires (QWs) and quantum dots (QDs) of optoelectronic materials whose unperturbed dispersion relation of the conduction electrons are defined by three and two band models of Kane together with parabolic energy bands on the basis of newly formulated electron dispersion laws in each case. We have plotted the TPSM as functions of film thickness, electron concentration, light intensity and wavelength for UFs, QWs and ODs of InSb, GaAs, Hg1-xCdxTe and In1-xGaxAsyP1-y respectively. It appears from the figures that for UFs, the TPSM increases with increasing thickness in quantum steps, decreases with increasing electron degeneracy exhibiting entirely different types of oscillations and changes with both light intensity and wavelength and these two latter types of plots are the direct signature of light waves on opto-TPSM. For QWs, the opto-TPSM exhibits rectangular oscillations with increasing thickness and shows enhanced spiky oscillations with electron concentration per unit length. For QDs, the opto-TPSM increases with increasing film thickness exhibiting trapezoidal variations which occurs during quantum jumps and the length and breadth of the trapezoids are totally dependent on energy band constants. Under the condition of non-degeneracy, the results of opto-TPSM gets simplified into the well-known form of classical TPSM equation which the function of three constants only and being invariant of the signature of band structure.
Resumo:
Clustered VLIW architectures solve the scalability problem associated with flat VLIW architectures by partitioning the register file and connecting only a subset of the functional units to a register file. However, inter-cluster communication in clustered architectures leads to increased leakage in functional components and a high number of register accesses. In this paper, we propose compiler scheduling algorithms targeting two previously ignored power-hungry components in clustered VLIW architectures, viz., instruction decoder and register file. We consider a split decoder design and propose a new energy-aware instruction scheduling algorithm that provides 14.5% and 17.3% benefit in the decoder power consumption on an average over a purely hardware based scheme in the context of 2-clustered and 4-clustered VLIW machines. In the case of register files, we propose two new scheduling algorithms that exploit limited register snooping capability to reduce extra register file accesses. The proposed algorithms reduce register file power consumption on an average by 6.85% and 11.90% (10.39% and 17.78%), respectively, along with performance improvement of 4.81% and 5.34% (9.39% and 11.16%) over a traditional greedy algorithm for 2-clustered (4-clustered) VLIW machine. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Wave pipelining is a design technique for increasing the throughput of a digital circuit or system without introducing pipelining registers between adjacent combinational logic blocks in the circuit/system. However, this requires balancing of the delays along all the paths from the input to the output which comes the way of its implementation. Static CMOS is inherently susceptible to delay variation with input data, and hence, receives a low priority for wave pipelined digital design. On the other hand, ECL and CML, which are amenable to wave pipelining, lack the compactness and low power attributes of CMOS. In this paper we attempt to exploit wave pipelining in CMOS technology. We use a single generic building block in Normal Process Complementary Pass Transistor Logic (NPCPL), modeled after CPL, to achieve equal delay along all the propagation paths in the logic structure. An 8×8 b multiplier is designed using this logic in a 0.8 ?m technology. The carry-save multiplier architecture is modified suitably to support wave pipelining, viz., the logic depth of all the paths are made identical. The 1 mm×0.6 mm multiplier core supports a throughput of 400 MHz and dissipates a total power of 0.6 W. We develop simple enhancements to the NPCPL building blocks that allow the multiplier to sustain throughputs in excess of 600 MHz. The methodology can be extended to introduce wave pipelining in other circuits as well
Resumo:
The use of delayed coefficient adaptation in the least mean square (LMS) algorithm has enabled the design of pipelined architectures for real-time transversal adaptive filtering. However, the convergence speed of this delayed LMS (DLMS) algorithm, when compared with that of the standard LMS algorithm, is degraded and worsens with increase in the adaptation delay. Existing pipelined DLMS architectures have large adaptation delay and hence degraded convergence speed. We in this paper, first present a pipelined DLMS architecture with minimal adaptation delay for any given sampling rate. The architecture is synthesized by using a number of function preserving transformations on the signal flow graph representation of the DLMS algorithm. With the use of carry-save arithmetic, the pipelined architecture can support high sampling rates, limited only by the delay of a full adder and a 2-to-1 multiplexer. In the second part of this paper, we extend the synthesis methodology described in the first part, to synthesize pipelined DLMS architectures whose power dissipation meets a specified budget. This low-power architecture exploits the parallelism in the DLMS algorithm to meet the required computational throughput. The architecture exhibits a novel tradeoff between algorithmic performance (convergence speed) and power dissipation. (C) 1999 Elsevier Science B.V. All rights resented.