Noise analysis of double gate composite InAs based HEMTs for high frequency applications

Microsystem Technologies - The quantitative analysis of microwave noise available in the double gate (DG) high electron transistors of mobility (HEMT) is reported in this paper. For this analysis,...     

Extensive Study of Underlap Length Effect for 3-D SOI FinFET to Achieve High Switching Ratio and Low Power

Silicon - The primary purpose of this work is to study the effect of symmetric and asymmetric variation of underlap regions both on source and drain side of 3D SOI n-FinFET. Underlap length is...     

The effects of silicon on the properties of tantalum

The microalloying of tantalum with silicon has been effectively used on a commercial scale. However, data on effects of microalloying on processibility, microstructure and mechanical properties are not readily available. To develop some data, tantalum powder with various levels of silicon (0–50 ppm) was processed under identical conditions. Sheet samples were then annealed at different temperatures and evaluated via microstructural, chemical and mechanical tests. The recrystallization temperature was found to increase with silicon content, most probably as a result of the presence of an intermetallic (Ta₃Si) phase. The mechanical properties of unrecrystallized tantalum are, as expected, significantly different from those of recrystallized tantalum.     

Generalized differentiability and integrability for fuzzy set-valued functions on time scales

This paper deals with the fuzzy set-valued functions of real variables on time scale whose values are normal, convex, upper semicontinuous and compactly supported fuzzy sets in \(\mathbb {R}^{n}\). We introduce and study the fundamental properties of new class of derivative called generalized delta derivative (\(\Delta _{g}\)-derivative) and generalized delta integral (\(\Delta _{g}\)-integral) for such fuzzy functions.     

Outage Performance of Uplink (UL) NOMA Network

Wireless Personal Communications - This paper proposes and analyses the power allocation coefficient normalization for successive interference cancellation in power-domain non-orthogonal multiple...     

Compact MIMO-Antenna with Enhanced Isolation for Ultra-Wide-Band and Ku-Band Applications

Journal of Communications Technology and Electronics - A Compact U-shaped multiple-inputs and multiple-output (MIMO)-antenna with dimensions of 23 × 47 mm2 has been proposed for...     

Wavefront diffusion and LMSR: algorithms for dynamic repartitioningof adaptive meshes

Current multilevel repartitioning schemes tend to perform well on certain types of problems while obtaining worse results for other types of problems. We present two new multilevel algorithms for repartitioning adaptive meshes that improve the performance of multilevel schemes for the types of problems that current schemes perform poorly while maintaining similar or better results for those problems that current schemes perform well. Specifically, we present a new scratch-remap scheme called Locally-matched Multilevel Scratch-remap (or simply LMSR) for repartitioning of adaptive meshes. LMSR tries to compute a high-quality partitioning that has a large amount of overlap with the original partitioning. We show that LMSR generally decreases the data redistribution costs required to balance the load compared to current scratch-remap schemes. We present a new diffusion-based scheme that we refer to as Wavefront Diffusion. In Wavefront Diffusion, the flow of vertices moves in a wavefront from overweight to underweight subdomains. We show that Wavefront Diffusion obtains significantly lower data redistribution costs while maintaining similar or better edge-cut results compared to existing diffusion algorithms. We also compare Wavefront Diffusion with LMSR and show that these provide a trade-off between edge-cut and data redistribution costs for a wide range of problems. Our experimental results on a Gray T3E, an IBM SP2, and a cluster of Pentium Pro workstations show that both schemes are fast and scalable. For example, both are capable of repartitioning a seven million vertex graph in under three seconds on 128 processors of a Gray T3E. Our schemes obtained relative speedups of between nine and 12 when the number of processors was increased by a factor of 16 on a Gray T3E