When designing microwave amplifiers, it is the task to select values of the source (input generator) and load reflection coefficients for the transistor, to achieve certain amplifier performance requirements and ensure stability. For unconditionally stable transistors, simultaneous conjugate matching can be achieved using well-known design formulae. Under this condition, the gain is maximised, and the input and output ports are matched. On the other hand when the transistor is conditionally stable, source and load reflection coefficients are selected using graphical design methods, involving gain and stability circles. To eliminate the reliance on graphical techniques, this paper shows the derivation of explicit design formulae that ensure maximum gain for a minimum specified safety margin, with one port matched. In this work, the safety margin is the distance between the chosen source or load reflection coefficient and its respective stability circle. In a production environment, where the circuit and transistor parameters are subject to random variations, the safety margin therefore makes allowance for such variations. This paper shows that the design problem for conditionally stable transistors can be reduced from the selection of values for two complex variables (port terminations) to the selection of the value for just one scalar variable.

An efficient algorithm for reconstructing all polyhedral 3D objects from two orthographic views is presented. Since the two-view orthographic representation of a 3D object is ambiguous, it requires a numerous amount of combinatorial searches in the process of reconstruction. Also, multiple number of solutions in contrast to the designers intention can be existed in the problem. This paper proposes a two phase algorithm to reduce the search space and to select the most plausible solution described by the given projections. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings in its first phase. Then the complete objects are obtained from the partially constructed objects by adding other candidates with geometrical validity in the second phase. The algorithm performs a combinatorial search based on the face decision rules along with two heuristics. Decision rules check geometrical validity and heuristic rules enhance the search speed. In addition, the reconstruction finds the most plausible 3D object that human observers are most likely to select first among the given multiple solutions. Several examples from a working implementation are given to show the completeness of the algorithm.

We propose a novel planar filter design for narrow-band applications. The filter consists of half-wavelength ring resonators with open gaps. This design has three advantages over conventional planar designs: a smaller size despite narrow bandwidth, a sharper skirt response at the passband edge without notch, an excellent out-band attenuation. We demonstrated these advantages by fabricating an 8-poles filter centered at 1.95 GHz with a 5 MHz bandwidth using YBCO films on a 2 inch diameter MgO substrate.

This paper describes a 10-bit 40-MS/s pipelined A/D converter implemented in a 0.8-µm double-poly, double-metal CMOS process. This A/D converter achieves low power dissipation of 36-mW at 5-V power supply. A 1.5-bit/stage pipelined architecture allows large correction range for comparator offset, and performs fast interstage signal processing. For high speed and low power operation, the sample-and-hold amplifier is designed using op-amp sharing technique and dynamic comparator. In addition, fully-differential folded-cascode op amp with gain-boosting stage is designed by an automatic design tool. When 10-MHz input signal is applied, SNDR is 55.0 dB, and SNR is 56.7 dB. The DNL and INL exhibit 0.6 LSB, +1/-0.75 LSB respectively.

TCAD (Technology Computer Aided Design) is the simulation of semiconductor processes and devices. Despite twenty years of development, there are still many TCAD skeptics. This paper will discuss some of the problems and limitations of TCAD, present some successful examples of its use, and discuss future simulation needs from a user's perspective. A key point is that the time pressures in modern semiconductor technology development often dictate the use of simple models for approximate results.

In a multisystem data sharing environment (MDSE), the computing nodes are locally coupled via a high-speed network and share a common database at the disk level. To reduce the amount of expensive and slow disk I/O, each node caches database pages in its main memory buffer. This paper focuses on the MDSE that uses record-level locking as a concurrency control. While the record-level locking can guarantee higher concurrency than page-level locking, it may result in heavy message traffic. In this paper, we first propose a cache coherency scheme that can reduce the message traffic in the standard locking. Then the scheme is extended to the context where lock caching and lock de-escalation are adopted. Using a distributed database simulation model, we evaluate the performance of the proposed schemes under a wide variety of database workloads.

Our simulation method by using a combination of discrete event simulation and detailed parametric models of the VLSI manufacturing test system is verified by comparing simulated results with actual ones of a real wafer test facility of one-chip microcomputer in a Japanese semiconductor company. The simulated results are found to be in close agreement with the actual ones. As an application of the verified simulation method, we evaluate the economic effect of the introduction in the wafer test process of LSI testers that allows us to test multiple chips simultaneously. It is found that the optimum number of chips simultaneously tested by an LSI tester is 4 when considering both of the test cost per chip and the average test TAT.

Network monitoring is one of the most significant functions in network management to understand the state of a network in real-time. In SNMP (Simple Network Management Protocol), polling is used for this purpose. If the time interval for two consecutive polling requests is too long, then we cannot understand the state of the network in real-time. Conversely, if it is too short, then the polling message traffic increases and imposes a heavy load on the network. Many dynamic polling algorithms have been proposed for controlling the increase in the polling message traffic. However, they cannot keep track of the time variations of management information values, since their main objectives are to check whether or not a network node is active and the next polling interval is determined being independent of the time variations of the values. The existing polling algorithms are thereby not applicable to the case where monitoring the time variation of management information values is critical. This paper proposes a new dynamic polling algorithm which, by making use of Discrete Fourier Transformation, enables not only to control the increase in the polling message traffic but also to keep track of the time variations of network management information values. We show the availability of the proposed algorithm by evaluating it through both simulations and experiments in actual network environment.

In this paper, we propose a new adaptive control system design using internal model principle (IMP) for a bounded polynomial parameters. In this method, we regard time varying parameters as variable disturbance and design an estimating law used the internal model of the disturbance so that the law is able to rejected the effectness of the disturbance. Our method has the features that the tracking error can converge to zero. Furthermore, we give a sufficient condition for the stability based on a small-gain theorem. The condition shows that our proposed method relax the stability condition more than the conventional methods based on a passivity theorem. Finally, we contain a numerical simulation to show an effect of our system.

This paper discusses the classification of targets buried in the underground by radar polarimetry. The subsurface radar is used for the detection of objects buried beneath the ground surface, such as gas pipes, cables and cavities, or in archeological exploration operation. In addition to target echo, the subsurface radar receives various other echoes, because the underground is inhomogeneous medium. Therefore, the subsurface radar needs to distinguish these echoes. In order to enhance the discrimination capability, we first applied the polarization anisotropy coefficient to distinguish echoes from isotropic targets (plate, sphere) versus anisotropic targets (wire, pipe). It is straightforward to find the man-made target buried in the underground using the polarization anisotropy coefficient. Second, we tried to classify targets using the polarimetric signature approach, in which the characteristic polarization state provides the orientation angle of an anisotropic target. All of these values contribute to the classification of a target. Field experiments using an ultra-wideband (250 MHz to 1 GHz) FM-CW polarimetric radar system were carried out to show the usefulness of radar polarimetry. In this paper, several detection and classification results are demonstrated. It is shown that these techniques improve the detection capability of buried target considerably.

In this paper, a clustering-based method is proposed for automatically constructing a multi-input Takagi-Sugeno (TS) fuzzy model where only the input-output data of the identified system are available. The TS fuzzy model is automatically generated by the process of structure identification and parameter identification. In the structure identification step, a clustering method is proposed to provide a systematic procedure to partition the input space so that the number of fuzzy rules and the shapes of fuzzy sets in the premise part are determined from the given input-output data. In the parameter identification step, the recursive least-squares algorithm is applied to choose the parameter values in the consequent part from the given input-output data. Finally, two examples are used to illustrate the effectiveness of the proposed method.

Recent years have seen great advances in our understanding and modeling of the coupled diffusion of dopants and defects in silicon during integrated circuit fabrication processes. However, the ever-progressing shrinkage of device dimensions and tolerances leads to new problems and a need for even better models. In this review, we address some of the advances in the understanding of defect-mediated diffusion, focusing on the equations and parameters appropriate for modeling of dopant diffusion in submicron structures.

In this paper, a novel variable-rate vector quantizer (VQ) design algorithm using fuzzy clustering technique is presented. The algorithm, termed fuzzy entropy-constrained VQ (FECVQ) design algorithm, has a better rate-distortion performance than that of the usual entropy-constrained VQ (ECVQ) algorithm for variable-rate VQ design. When performing the fuzzy clustering, the FECVQ algorithm considers both the usual squared-distance measure, and the length of channel index associated with each codeword so that the average rate of the VQ can be controlled. In addition, the membership function for achieving the optimal clustering for the design of FECVQ are derived. Simulation results demonstrate that the FECVQ can be an effective alternative for the design of variable-rate VQs.

In this paper, quasi-Gaussian filter, quasi-median filter and locally adaptive filters are introduced. A new adaptive vector filter based on noise estimate is proposed to suppress Gaussian and/or impulse noise. To estimate the type and degree of noise corruption, a noise detector and an edge detector are introduced, and two key parameters are obtained to characterize noise in color image. After globally estimating the type and degree of noise corruption, different locally adaptive filters are properly chosen for image enhancement. All noisy images, used to test filters in experiments, are generated by PaintShopPro and Photoshop software. Experimental results show that the new adaptive filter performs better in suppressing noise and preserving details than the filter in Photoshop software and other filters.

This paper introduces an alternating rebound Turing machine and investigates some fundamental properties of it. Let DRTM (NRTM,ARTM) denote a deterministic (nondeterministic and alternating) rebound Turing machine, and URTM denote an ARTM with only universal states. We first investigate a relationship between the accepting powers of rebound machines and ordinary machines, and show, for example, that (1) there exists a language accepted by a deterministic rebound automaton, but not accepted by any o(log n) space-bounded alternating Turing machine, (2) alternating rebound automata are equivalent to two-way alternating counter automata, and (3) deterministic rebound counter automata are more powerful than two-way deterministic counter automata. We next investigate a relationship among the accepting powers of DRTM's, NRTM's, URTM's and ARTM's, and show that there exists a language accepted by alternating rebound automata, but not accepted by any o(logn) space-bounded NRTM (URTM). Then we show that there exists an infinite space hierarchy for DRTM's (NRTM's, URTM's) with spaces below log n. Furthermore, we investigate a relationship between the strong and weak modes of space complexity, and finally show that the classes of languages accepted by o(logn) space-bounded DRTM's (NRTM's, URTM's) are not closed under concatenation and Kleene .

In this paper, a new multicast routing method for layered streams is proposed. This method is an extension of the weighted greedy algorithm (WGA) and uses two kinds of weight values to refine the link distance. It can cope with dynamic change in the group members without multicast tree re-construction. The method is compatible with the RSVP and can be utilized in existing shared tree type routing protocols such as CBT and PIM sparse mode. The network resources can be utilized efficiently; furthermore, the loss rate of member's requests to receive more layers can be reduced by this routing method when a sufficient number of nodes have the packet filtering function and a sufficient number of hops is permitted.

This paper investigates a relationship between accepting powers of two-way deterministic one-counter automata and one-pebble off-line deterministic Turing machines operating in space between loglog n and log n, and shows that they are incomparable.

A new method using new test structure, which is connected 15.4 million MOS transistor, for evaluating extrinsic oxide breakdown is proposed. The active gate area which is needed to predict reliability will be shown. And by using this new method, activation energy not only for the intrinsic breakdown but also for the extrinsic breakdown are obtained.

The effect of lot size change and test processing logistics on VLSI manufacturing final test process efficiency and cost due to the transition of from conventional 5 or 6 inches to 300 mm (12 inches) in wafer size is evaluated through simulation analysis. Simulated results show that a high test efficiency and a low test cost are maintained regardless of arrival lot size in the range of the number of 300 mm wafers per lot from 1 to 25 and the content of express lots in the range of up to 50% by using WEIGHT+RPM rule and the right final test processing logistics. WEIGHT+RPM rule is the rule that considers the jig and temperature exchanging time, the lot waiting time in queue and also the remaining processing time of the machine in use. The logistics has a small processing and moving lot size equal to the batch size of testing equipment.

We first demonstrate a self-pulsation phenomenon in a semiconductor ring laser(SRL). Not only self-mode-locked optical pulse but self-Q-switched optical pulse can be observed in a SRL. Furthermore, experimental results show that the repetition period of the Q-switched optical pulse train can be controlled by the injection current to a SRL.