A comprehensive analysis methodology allowing investigation of the RF performance of Si and strained Si:SiGe MOSFETs is presented. It is based on transient ensemble Monte Carlo simulation which correctly describes device transport, and employs a finite element solver to account for complex device geometries. Transfer characteristics and figures of merit for a number of existing and proposed RF MOSFETs are discussed.

This paper proposes a fast and simple adaptive algorithm for MMSE (Minimum Mean Square Error) adaptive array antenna or MMSE combining diversity. This algorithm can be implemented with as a small operation as LMS since it is based on VS-LMS (variable step size LMS) for which the step size is provided with a fixed profile. Computer simulation results show that the proposed algorithm has much better convergence behavior and BER performance than LMS.

In this paper, performance of a PN code acquisition scheme is analyzed and simulated for a DS/CDMA overlay system where a CDMA user and a narrowband user coexist in the same frequency band. A narrowband user is modelled as a narrowband interference (NBI) located at the fraction of a CDMA user's bandwidth. To suppress the NBI, an interference suppression filter is employed at the receiver frontend. Acquisition performance is evaluated in terms of mean acquisition time using state transition diagram for acquisition process. To apply for a DS/CDMA mobile cellular environments, multiple access interference and imperfection of power control are taken into account in the analysis of acquisition performance. The imperfect power control is considered by modelling the power of each user to be lognormally distributed about nominal received power. From the simulation results, it is shown that for the cases of perfect and imperfect power control, the interference suppression filter is very effective for supprssion of the NBI and rapid PN code acquisition in a DS/CDMA overlay environment. It is also shown that the one-sided tap number of 5 for interference suppression filter is sufficient to suppress the NBI. And, capacity estimates are compared based on acquisition and BER performance. The analysis in this paper can be applied to the practical situations for a DS/CDMA overlay environment.

Credit-based electronic payment systems are considered to play important roles in future automated payment systems. Like most other types of payment systems, however, credit-based systems proposed so far generally involve computationally expensive cryptographic operations. Such a relatively heavy computational load is preventing credit-based systems from being used in applications which require very fast processing. A typical example is admission-fee payment at the toll gate of an expressway without stopping a vehicle that travels at a high speed. In this article, we propose a very fast credit-based electronic payment protocol for admission-fee payment. More specifically, we propose a payment system between a high-speed vehicle and a toll gate which uses only very simple and fast computations. The proposed system makes use of an optimized Key Pre-distribution System (or KPS) to obtain high resistance against collusion attacks.

In this paper, the effective uses of Gerschgorin radii of the similar transformed covariance matrix for source number estimation are introduced. A heuristic approach is used for developing the detection criteria. The heuristic approach applying the visual Gerschgorin disk method (VGD), developed from the projection concept, overcomes the problems in cases of small data samples, an unknown noise model, and data dependency. Furthermore, Gerschgorin disks can be formed into two distinct, non-overlapping collections; one for signals and the other for noises. The number of sources can be visually determined by counting the number of Gerschgorin disks for signals. The proposed method is based on the sample correlation coefficient to normalize the signal Gerschgorin radii for source number detection. The performance of VGD shows improved detection capabilities over Gerschgorin Disk Estimator (GDE) in Gaussian white noise process and was used successfully in measured experimental data.

An MPEG-2 422P@HL encoder chip set composed of a preprocessing LSI, an encoding LSI, and a motion estimation LSI is described. This chip set realizes a two-type scalability of picture resolution and quality, and executes a hierarchical coding control in the overall encoder system. Due to its scalable architecture, the chip set realizes a 422P@HL video encoder with multi-chip configuration. This single encoding LSI achieves 422P@ML video, audio, and system encoding in real time. It employs an advanced hybrid architecture with a 162 MHz media processor and dedicated video processing hardware. It also has dual communication ports for parallel processing with multi-chip configuration. Transferring of reconstructed data and macroblock characteristic data between neighboring encoder modules is executed via these ports. The preprocessing LSI is fabricated using 0.25 micron three-layer metal CMOS technology and integrates 560 K gates in an area of 12.0 mm 12.0 mm . The encoding LSI is fabricated using 0.25 micron four-layer metal CMOS technology and integrates 11 million transistors in an area of 14.2 mm 14.2 mm . The motion estimation LSI is fabricated using 0.35 micron three-layer metal CMOS technology. It integrates 1.9 million transistors in an area of 8.5 mm 8.5 mm . This chip set makes various system configurations possible and allows for a compact and cost-effective video encoder with high picture quality.

To improve the resolution capability of the directions-of-arrival (DOA) estimation, some subspace-based methods have recently been developed by exploiting the specific signal properties (e.g. non-Gaussian property and cyclostationarity) of communication signals. However, these methods perform poorly as the ordinary subspace-based methods in multipath propagation situations, which are often encountered in mobile communication systems because of various reflections. In this paper, we investigate the direction estimation of coherent signals by jointly utilizing the merits of higher-order statistics and cyclostationarity to enhance the performance of DOA estimation and to effectively reject interference and noise. For estimating the DOA of narrow-band coherent signals impinging on a uniform linear array, a new higher-order cyclostationarity based approach is proposed by incorporating a subarray scheme into a linear prediction technique. This method can improve the resolution capability and alleviate the difficulty of choosing the optimal lag parameter. It is shown numerically that the proposed method is superior to the conventional ones.

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of non-homogeneous fractal images with unequal probabilities. Moment based encoding algorithms for IFS coding of non-homogeneous fractal images require a solution of simultaneous algebraic equations that are difficult to handle with numerical root-finding methods. The proposed algorithm employs a variable elimination method using Grobner bases with floating-point coefficients in order to derive a numerically solvable equation with a single unknown. The algorithm also employs a varying associated-probabilities method for the purpose of decreasing the computational complexity of calculating Grobner bases. Experimental results show that the average computation time for encoding a non-homogeneous fractal image of 256256 pixels and 256 gray levels is about 200 seconds on a PC with a 400 MHz AMD K6-III processor.

In this paper, a new set of difference equations is derived for transient analysis of the convergence of adaptive FIR filters using the Sign-Sign Algorithm with Gaussian reference input and additive Gaussian noise. The analysis is based on the assumption that the tap weights are jointly Gaussian distributed. Residual mean squared error after convergence and simpler approximate difference equations are further developed. Results of experiment exhibit good agreement between theoretically calculated convergence and that of simulation for a wide range of parameter values of adaptive filters.

The classical algebraic modelling approach for integer programming (IP) is not suitable for some real world IP problems, since the algebraic formulations allow only for the description of mathematical relations, not logical relations. In this paper, we present a language + for IP, in which we write logical specification of an IP problem. + is a language based on the predicate logic, but is extended with meta predicates such as at_least(m,S), where m is a non-negative integer, meaning that at least m predicates in the set S of formulas hold. The meta predicates facilitate reasoning about a model of an IP problem rigorously and logically. + is executable in the sense that formulas in + are mechanically translated into a set of mathematical formulas, called IP formulas, which most of existing IP solvers accept. We give a systematic method for translating formulas in + to IP formulas. The translation is rigorously defined, verified and implemented in Mathematica 3.0. Our work follows the approach of McKinnon and Williams, and elaborated the language in that (1) it is rigorously defined, (2) transformation to IP formulas is more optimised and verified, and (3) the transformation is completely given in Mathematica 3.0 and is integrated into IP solving environment as a tool for IP.

In this work, distributed dynamic channel assignment strategies with violation to the reuse pattern using vehicular mobility information for highway microcellular environments are proposed. It is shown that, when vehicular mobility information is included in the acquisition channel policy, the outage probability degradation because of the use of channels with one violation to the reuse pattern is negligible. Also, it is shown that, using different moving direction strategies it is possible to control the tradeoff between capacity and quality of service. The local packing algorithm (LP), was modified to allow the use of two different moving direction strategies with violation to the reuse pattern, resulting the VDLP1 and VDLP2 algorithms. The characteristics of user mobility are considered and a free-flowing vehicular traffic is assumed. Simulation results show that the use of vehicular mobility information in the distributed dynamic channel algorithms with violation to the reuse pattern, produce a considerable increase in the system capacity at the expense of an insignificant degradation of the quality of service. For a grade of service (GOS) of 0.1, the VDLP1 and VDLP2 carry 4% and 1.5% more traffic than the maximum packing algorithm, respectively. For the same GOS, the VDLP1 and VDLP2 carry 68% and 64% more traffic than the fixed channel assignment algorithm, respectively.

In this paper the application of a linear-quadratic processor is proposed for detection of each user's signal in a direct sequence code division multiple access scheme and, in particular, for W-CDMA systems. In this method, the knowledge of the user of interest, and some statistical knowledge of interfering transmitters' signals are used to detect the desired user's signal without needing exact "a priori" knowledge of the interfering signal parameters such as spreading sequences and signal powers. Parameters of the proposed processor, which are derived so as to maximise the signal-to-interference-plus-noise ratio (SINR), can generally be obtained by solving a system of linear equations for which many effective techniques exist. A model for this detection procedure is developed and shown--through analytical and numerical results--to offer a good compromise between complexity and quality of performance.

In this letter, we remark a well-known nonlinear filtering technique realize immediate effect to suppress the influence of the additive measurement noise in the input to a set theoretic linear blind deconvolution scheme. Numerical examples show ε-separating nonlinear pre-filtering techniques work suitably to this noisy blind deconvolution problem.

This paper reports a Monte Carlo calculation of the bimolecular reaction of arsenic precipitation. As the accuracy of the numerical solution for the coupled rate equations strongly depends on the size of grid spacing, it is necessary to choose adequate number of rate equations in order to understand the behavior of the extended defects. Therefore, we developed a general kinetic Monte Carlo model for the extended defects, which explicitly takes the time evolution of the size density of the extended defects into account. The Monte Carlo calculation exhibits a quantitative agreement with the experimental data for deactivation, and successfully reproduces the rapid deactivation at the beginning phase followed by slow deactivation in the subsequent steps.

This paper newly proposes radio-over-fiber systems using cascaded radio-to-optic direct conversion (ROC) scheme. The ROC system can convert a radio signal into an optical signal with the same signal format. The received carrier-to-noise ratio (CNR) performance of the radio-over-fiber systems using the ROC/heterodyne detection (HD) scheme and the ROC/self-heterodyne detection (SHD) scheme are theoretically analyzed. The optimization of an optical modulation index (OMI) in each radio base station (RBS) is also presented. By using the proposed OMI optimization method, the ROC/HD and the ROC/SHD schemes are shown to provide approximately 16 dB and 14 dB improvement over the intensity modulation/direct detection scheme when the number of RBS is 20 and the radio-frequency (RF) signal bandwidth is 150 MHz, respectively. The ROC/SHD scheme enables a receiver structure to become simple while still achieving high received CNR.

We study the joint optimization problem of a transmitter with multiple transmit antennas and a receiver with multiple receive antennas in a narrow-band communication system. We discuss the problem of designing a pre-filter at the transmitter, a post-filter at the receiver, and a bit allocation pattern to multiple symbols in the sense of minimizing the average bit error rate. With the optimized filters and the bit allocation, we could realize high efficiency and high data rate in band-limited channels.

This paper studies the problem of book-embeddings of graphs. When each edge is allowed to appear in one or more pages by crossing the spine of a book, it is well known that every graph G can be embedded in a 3-page book. Recently, it has been shown that there exists a 3-page book embedding of G in which each edge crosses the spine O(log2 n) times. This paper considers a book with more than three pages. In this case, it is known that a complete graph Kn with n vertices can be embedded in a n/2 -page book without any edge-crossings on the spine. Thus it becomes an interesting problem to devise book-embeddings of G so as to reduce both the number of pages used and the number of edge-crossings over the spine. This paper shows that there exists a d-page book embedding of G in which each edge crosses the spine O(logd n) times. As a direct corollary, for any real number s, there is an ns -page book embedding of G in which each edge crosses the spine a constant number of times. In another paper, Enomoto-Miyauchi-Ota show that for an integer d, if n is sufficiently large compared with d, then for any embedding of Kn into a d-page book, there must exist Ω(n2 logd n) points at which edges cross over the spine. This means our result is the best possible for Kn in this case.

A Schottky contact model was implemented as a boundary condition for Monte Carlo device simulations. Unlike the ideal ohmic contact, the thermal equilibrium is unnecessary around the Schottky contact. Therefore, the wide region with high impurity concentration around the contact is not required to maintain the thermal equilibrium, which means that it is possible to avoid assigning a lot of particles to the low-field region. The validity of the present boundary condition for contacts was verified by simulating a rectifying characteristic of a Schottky barrier diode. As an application example using the present contact model, we simulated transport in n+nn+ structures with sub-0.1 µm channel lengths. We observed direction dependence of the electron velocity dispersion, which indicates that the direction dependence of the diffusion constant or the carrier temperature should be taken into account in the hydrodynamic simulation for sub-0.1 µm devices.

This paper reports the implementation in three dimensions (3D) of diffusion models for low dose implanted dopants in silicon and the various numerical issues associated with it. In order to allow the end-users to choose between high accuracy or small calculation time, a conventional and 5-species diffusion models have been implemented in the 3D module DIFOX-3D belonging to the PROMPT plateform. By comparison with one and two-dimensional (1D and 2D) simulations performed with IMPACT-4, where calibrated models exist, the validity of this 3D models have been checked. Finally, the results obtained for a 3-dimensional simulation of a rapid thermal annealing step involved in the manufacturing of a MOS transistor are presented what show the capability of this module to handle the optimization of real devices.

The individually normalized least mean square (INLMS) algorithm is proposed as an adaptive algorithm suitable for the fixed point processing. The convergence property of the INLMS algorithm, however, is not yet analyzed enough. This paper first derives an equation describing the convergence property by exploiting the technique of expressing the INLMS algorithm as a first order infinite impulse response (IIR) filter. According to the equation derived thus, the decreasing process of the estimation error is represented as the response of another IIR filter expression. By using the representation, this paper second derives the convergence condition of the INLMS algorithm as the range of the step size making a low path filter of the latter IIR filter. This paper also derives the step size maximizing the convergence speed as the maximum coefficient of the latter IIR filter and finally clarifies the range of the step size recommended in the practical system design.