266 resultados para SOI MULTIPLE GATE FET (MUGFET)
Resumo:
We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.
Resumo:
Though silicon tunnel field effect transistor (TFET) has attracted attention for sub-60 mV/decade subthreshold swing and very small OFF current (IOFF), its practical application is questionable due to low ON current (ION) and complicated fabrication process steps. In this paper, a new n-type classical-MOSFET-alike tunnel FET architecture is proposed, which offers sub-60 mV/decade subthreshold swing along with a significant improvement in ION. The enhancement in ION is achieved by introducing a thin strained SiGe layer on top of the silicon source. Through 2D simulations it is observed that the device is nearly free from short channel effect (SCE) and its immunity towards drain induced barrier lowering (DIBL) increases with increasing germanium mole fraction. It is also found that the body bias does not change the drive current but after body current gets affected. An ION of View the MathML source and a minimum average subthreshold swing of 13 mV/decade is achieved for 100 nm channel length device with 1.2 V supply voltage and 0.7 Ge mole fraction, while maintaining the IOFF in fA range.
Resumo:
We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at -5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.
Resumo:
An imaging technique is developed for the controlled generation of multiple excitation nano-spots for far-field microscopy. The system point spread function (PSF) is obtained by interfering two counter-propagating extended depth-of-focus PSF (DoF-PSF), resulting in highly localized multiple excitation spots along the optical axis. The technique permits (1) simultaneous excitation of multiple planes in the specimen; (2) control of the number of spots by confocal detection; and (3) overcoming the point-by-point based excitation. Fluorescence detection from the excitation spots can be efficiently achieved by Z-scanning the detector/pinhole assembly. The technique complements most of the bioimaging techniques and may find potential application in high resolution fluorescence microscopy and nanoscale imaging.
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.
Resumo:
This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.
Resumo:
This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.
Resumo:
Let Ohm be a bounded domain in IRN, N greater than or equal to 2, lambda > 0, q is an element of (0, N - 1) and alpha is an element of (1, N/N-1 In this article we show the existence of at least two positive solutions for the following quasilinear elliptic problem with an exponential type nonlinearity:
Resumo:
Passive wavelength/time fiber-optic code division multiple access (WIT FO-CDMA) network is a viable option for highspeed access networks. Constructions of 2-D codes, suitable for incoherent WIT FO-CDMA, have been proposed to reduce the time spread of the 1-D sequences. The 2-D constructions can be broadly classified as 1) hybrid codes and 2) matrix codes. In our earlier work [141, we had proposed a new family of wavelength/time multiple-pulses-per-row (W/T MPR) matrix codes which have good cardinality, spectral efficiency and at the same time have the lowest off-peak autocorrelation and cross-correlation values equal to unity. In this paper we propose an architecture for a WIT MPR FO-CDAM network designed using the presently available devices and technology. A complete FO-CDMA network of ten users is simulated, for various number of simultaneous users and shown that 0 --> 1 errors can occur only when the number of interfering users is at least equal to the threshold value.
Resumo:
The peptide Boc-Gly-Dpg-Gly-Gly-Dpg-Gly-NHMe (1) has been synthesized to examine the conformational preferences of Dpg residues in the context of a poor helix promoting sequence. Single crystals of 1 were obtained in the space group P21/c with a = 13.716(2) Å, b = 12.960(2) Å, c = 22.266(4) Å, and β = 98.05(1)°; R = 6.3% for 3660 data with |Fo| > 4σ. The molecular conformation in crystals revealed that the Gly(1)-Dpg(2) segment adopts φ, ψ values distorted from those expected for an ideal type II‘ β-turn (φGly(1) = +72.0°, ψGly(1) = −166.0°; φDpg(2) = −54.0°, ψDpg(2) = −46.0°) with an inserted water molecule between Boc-CO and Gly(3)NH. The Gly(3)-Gly(4) segment adopts φ, ψ values which lie broadly in the right handed helical region (φGly(3) = −78.0°, ψGly(3) = −9.0°; φGly(4) = −80.0°, ψGly(4) = −18.0°). There is a chiral reversal at Dpg(5) which takes up φ, ψ values in the left handed helical region. The Dpg(5)-Gly(6) segment closely resembles an ideal type I‘ β-turn (φDpg(5) = +56.0°, ψDpg(5) = +32.0°; φGly(6) = +85.0°, ψGly(6) = −3.0°). Molecules of both chiral senses are found in the centrosymmetric crystal. The C-terminus forms a hydrated Schellman motif, with water insertion into the potential 6 → 1 hydrogen bond between Gly(1)CO and Gly(6)NH. NMR studies in CDCl3 suggest substantial retention of the multiple turn conformation observed in crystals. In solution the observed NOEs support local helical conformation at the two Dpg residues.
Resumo:
The conformational properties of foldamers generated from alpha gamma hybrid peptide sequences have been probed in the model sequence Boc-Aib-Gpn-Aib-Gpn-NHMe. The choice of alpha-aminoisobutyryl (Aib) and gabapentin (Gpn) residues greatly restricts sterically accessible coil formational space. This model sequence was anticipated to be a short segment of the alpha gamma C-12 helix, stabilized by three successive 4 -> 1 hydrogen bonds, corresponding to a backbone-expanded analogue of the alpha polypeptide 3(10)-helix. Unexpectedly, three distinct crystalline polymorphs were characterized in the solid state by X-ray diffraction. In one form, two successive C-12 hydrogen bonds were obtained at the N-terminus, while a novel C-17 hydrogen-bonded gamma alpha gamma turn was observed at the C-terminus. In the other two polymorphs, isolated C-9 and C-7 hydrogen-bonded turns were observed at Gpn (2) and Gpn (4). Isolated C-12 and C-9 turns were also crystallographically established in the peptides Boc-Aib-Gpn-Aib-OMe and Boc-Gpn-Aib-NHMe, respectively. Selective line broadening of NH resonances and the observation of medium range NH(i)<-> NH(i+2) NOEs established the presence of conformational heterogeneity for the tetrapeptide in CDCl3 solution. The NMR results are consistent with the limited population of the continuous C-12 helix conformation. Lengthening of the (alpha gamma)(n) sequences in the nonapeptides Boc-Aib-Gpn-Aib-Gpn-Aib-Gpn-Aib-Gpn-Xxx (Xxx = Aib, Leu) resulted in the observation of all of the sequential NOEs characteristic of an alpha gamma C-12 helix. These results establish that conformational fragility is manifested in short hybrid alpha gamma sequences despite the choice of conformationally constrained residues, while stable helices are formed on chain extension.
Resumo:
This paper presents a glowworm swarm based algorithm that finds solutions to optimization of multiple optima continuous functions. The algorithm is a variant of a well known ant-colony optimization (ACO) technique, but with several significant modifications. Similar to how each moving region in the ACO technique is associated with a pheromone value, the agents in our algorithm carry a luminescence quantity along with them. Agents are thought of as glowworms that emit a light whose intensity is proportional to the associated luminescence and have a circular sensor range. The glowworms depend on a local-decision domain to compute their movements. Simulations demonstrate the efficacy of the proposed glowworm based algorithm in capturing multiple optima of a multimodal function. The above optimization scenario solves problems where a collection of autonomous robots is used to form a mobile sensor network. In particular, we address the problem of detecting multiple sources of a general nutrient profile that is distributed spatially on a two dimensional workspace using multiple robots.
Resumo:
Bacillus subtilis BacB is an oxidase that is involved in the production of the antibiotic bacilysin. This protein contains two double-stranded beta-helix (cupin) domains fused in a compact arrangement. BacB crystallizes in three crystal forms under similar crystallization conditions. An interesting observation was that a slight perturbation of the crystallization droplet resulted in the nucleation of a different crystal form. An X-ray absorption scan of BacB suggested the presence of cobalt and iron in the crystal. Here, a comparative analysis of the different crystal forms of BacB is presented in an effort to identify the basis for the different lattices. It is noted that metal ions mediating interactions across the asymmetric unit dominate the different packing arrangements. Furthermore, a normalized B-factor analysis of all the crystal structures suggests that the solvent-exposed metal ions decrease the flexibility of a loop segment, perhaps influencing the choice of crystal form. The residues coordinating the surface metal ion are similar in the triclinic and monoclinic crystal forms. The coordinating ligands for the corresponding metal ion in the tetragonal crystal form are different, leading to a tighter packing arrangement. Although BacB is a monomer in solution, a dimer of BacB serves as a template on which higher order symmetrical arrangements are formed. The different crystal forms of BacB thus provide experimental evidence for metal-ion-mediated lattice formation and crystal packing.
Resumo:
Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.
Resumo:
We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.