The transmission S-parameter, S21, between dipole elements on a rectangular finite ground plane is calculated by the MoM with planar-segments in the horizontally and vertically polarized configurations. Supposed a 1/10 scaling, the frequency range is selected 0.15-0.8 GHz. The size of the finite ground plane is 40 cm 100 cm. The dipole-element length is 18.8 cm (half-wavelength at 0.8 GHz). The distance between dipole elements is 30 cm. The results are compared to the calculated results with the conventional MoM-GTD hybrid method and also the measured results with a TRL-calibrated network analyzer. It makes clear that the MoM-GTD hybrid method is not applicable to a small ground plane in the vertically polarized configuration. The results calculated by the MoM with planar-segments agree well to the measured results both in the horizontal and vertical polarizations. The results show that the size of the finite ground plane for the vertical polarization should be much larger than for the horizontal polarization.

In this paper, a novel cumulant-based adaptive notch filtering technique for the enhancement and tracking of a single sinusoid in additive noise is presented. In this technique, the enhanced signal is obtained as the output of a narrow bandpass filter implemented using a second-order pole-zero constraint IIR adaptive notch filter, which needs only one coefficient to be updated. The filter coefficient, which leads to identifying and tracking the sinusoidal frequency, is updated using a suggested adaptive algorithm employing a recursive estimate of the kurtosis and only one-sample-lag point of a selected one-dimensional fourth-order cumulant slice of the input signal. Therefore, the proposed technique provides automatically resistance to additive Gaussian noise. It is also shown that the presented technique outperforms the correlation-based counterpart in handling additive non-Gaussian noise. Simulation results are provided to show the effectiveness of the proposed algorithm in comparison with the correlation-based lattice algorithm.

This paper proposes a method of supporting behavioral decision-making with a rule-based system to be used for the design stage of service specifications or service scenarios based on a state transition model. We consider telecommunication services as service scenarios of state transitions. A state transition can be described as a transition rule that is represented as the notation of an IF-THEN rule : "if < condition > then < action >. " Thus, behaviors or service scenarios are assumed to be treated as a set of IF-THEN rules in this paper. In general, an "if < condition > then < action >" rule is called a production rule, and production rules are often used to represent knowledge in expert systems. Thus, rules treated in this paper are a kind of production rule. It is still difficult to decide if behaviors are concurrent, cooperative, or exclusive as a whole system when many service scenarios are combined, even if each rule is clearly described and easy to understand. When several service scenarios are combined, it is necessary for the sub-elements of each state transition to cooperate. The method proposed in this paper consists of the following techniques: (1) decompositions of a state transition to sub-elements, (2) rule descriptions for the decomposed sub-elements and the application of rules, (3) use of conflict and cooperation strategies, and (4) support for behavioral decision-making by showing recommendations for cooperative, exclusive, or concurrent behavior. We provide examples of telecommunication services to show the effectiveness of the proposed method in an easy-to-understand manner. We also show cooperative resolution in the interactions among several services.

Message Sequence Chart (MSC) standardized by International Telecommunication Union is a graphical and textual language for specification of concurrent systems. It has been used formally as well as informally to specify behavior of real-time systems, in particular telecommunication switching systems. Formal verification of a system specification is crucial to ensure that implementation of the system works correctly. In particular, verification methods based on finite states have been widely used in telecommunication systems design. The methods determine global system states and transitions between them (i. e. , build a global state transition graph (GSTG)), and verify the system's desired properties, such as safety and liveness, on the GSTG. In this paper, we focus on construction of GSTGs from MSC specifications. We propose action dependency graph as an intuitive description of semantics of MSC specifications and present an algorithm to translate MSC specifications to action dependency graphs as well as an algorithm to construct a global state transition graph from an action dependency graph.

Using decision trees to fill the missing values in data has been shown experimentally to be useful in some domains. However, this is not the general case. In other domains, using decision trees for imputing missing attribute values does not outperform other methods. Trying to identify the reasons behind the success or failure of the various methods for filling missing values on different domains can be useful for deciding the technique to be used when learning concepts from a new domain with missing values. This paper presents a technique by which to approach to previous goal and presents the results of applying the technique on predicting the success or failure of a method that uses decision trees to fill the missing values in an ordered manner. Results are encouraging because the obtained decision tree is simple and it can even provide hints for further improvement on the use of decision trees to impute missing attribute values.

The features of the negative resistance in common source and common gate FET configurations for wideband VCO are studied. They are also explained by the simplified three-capacitor model. A design procedure is then developed. The results are applied to a design of wide band oscillator at the several gigahertz region.

The paper proposes a transmitter diversity scheme with a desired signal selection for the mobile communication systems in which the severe cochannel interference (CCI) is assumed to occur at the base station. The feature of the proposed scheme is that the criterion of the downlink branch selection is based on the desired signal power estimated by the correlation between the received signal and the unique word at the matched filter. Moreover, the unique word length control method according to the instantaneous SIR is applied to the proposed scheme, taking account of the uplink transmission efficiency. Computer simulation results show that the proposed scheme provides the better performance than the conventional transmitter diversity in the severe CCI environments, and that the unique word length control method applied to the proposed scheme decreases the unique word length without the degradation of the transmission quality, comparing with the fixed unique word length method.

It is one of the difficulties in enterprise modeling that we must deal with many fragmented pieces of knowledge provided by various domain-experts, which are usually based on mutually different viewpoints of them. This paper presents a formal approach to integrate those pieces into enterprise-wide model units using Rough Set Theory (RST). We focus on business processes in order to recognize and identify the constituents or units of enterprise models, which would compose the model expressing the various aspects of the enterprise. We defined five model unit types of "resource," "organization," "task," "function," and "behavior. " The first three types represent the static aspect of the enterprise, whereas the last two types represent the dynamic aspect of it. Those units are initially elicited from each domain-expert as his/her own individual model units, then they are integrated into enterprise-wide units using RST. Our approach is methodology-free, and any methodologies can include it in their early stage to identify what composes the enterprise.

This paper presents an efficient approach for a hardware/software partitioning problem: synthesis of an application-specific coprocessor which accelerates an embedded software running on a main processor. Given a set of data flow graphs (DFGs), most of previous hardware/software partitioning approaches have focused on mapping DFGs to hardware or software. Their common weaknesses are that 1) they ignore various implementation alternatives in realizing DFGs as hardware based on the assumption that only a single hardware implementation exists for a DFG, and that 2) they don't consider the effect of merging on hardware area when synthesizing a coprocessor by merging DFGs. To deal with the first issue, we formulate both the mapping of DFGs to hardware or software and the selection of the appropriate hardware implementation for each DFG as a single integer programming problem, and then apply an iterative algorithm based on the Kernighan and Lin's heuristic to solve the problem. To reduce the CPU time, we have devised data structures that quickly calculate costs of hardware implementations. To deal with the second issue, our method links DFGs with dummy nodes to produce a single large DFG, and then synthesizes a target coprocessor by globally scheduling the DFG and allocating its datapath. Experimental results demonstrate that our approach outperforms the previous approach based on genetic algorithm (GA) in both the coprocessor area and the CPU time.

This paper presents a method of determining a fitness function in a genetic algorithm for routing the shortest route via several designated points. We can search for the optimum route efficiently by using the proposed fitness function and its validity is verified by applying it to the actual map data.

This paper proposes two novel Multi-bit Delta-Sigma Modulator (Δ Σ M) architectures based on a Dual-Quantization architecture. By using multi-bit quantization with single-bit feedback, Both eliminate the need for a multi-bit digital-to-analog converter (DAC) in the feedback loop. The first is a Digital quantization-Error Canceling Multi-bit (DECM)-Δ Σ M architecture that is able to achieve high resolution at a low oversampling ratio (OSR) because, by adjusting the coefficients of both analog and digital circuits, it is able to cancel completely the quantization error injected into the single-bit quantizer. Simulation results show that a signal-to-quantization-noise ratio of 90 dB is obtained with 3rd order 5-bit quantization DECM-Δ Σ M at an OSR of 32. The second architecture, an analog-to-digital mixed (ADM)-Δ Σ M architecture, uses digital integrators in place of the analog integrator circuits used in the Δ Σ M. This architecture reduces both die area and power dissipation. We estimate that a (2+2)-th order ADM-Δ Σ M with two analog-integrators and two digital-integrators will reduce the area of a 4-th order Δ Σ M by 15%.

A 5.6 GOPS/1.4 GFLOPS 350 MHz, four-way very long instruction word (VLIW) microprocessor is developed for embedded applications in a 0.18 µm five-layer-metal CMOS process. This processor features a two-way integer pipeline and two-way floating/media pipelines. Each floating pipeline and media pipeline has two-parallel and four-parallel single instruction multiple-data (SIMD) mechanisms, respectively. The processor has separate instruction and data caches, each of 16 KB in size and having four-way set associative. The data cache employs a non-blocking technique and can process two load instructions in parallel. The processor had about a 50% clock net power reduction compared with one without power optimization. 6.7 million transistors are integrated in an area of 7.5 mm 7.5 mm. Since all circuit blocks were developed using logic synthesis, the processor is easy to adapt to system-on-a-chip (SoC) applications.

This paper presents adaptive image enhancement algorithms which enhance hidden signals in the pictures and describes their implementation for real-time video signals. An image enhancement algorithm proposed by T. Peli and J. S. Lim is extended for application to video signals. A fast implementation algorithm is provided with parallel implementation. The proposed algorithms are shown to be realized in real-time on 200 MHz microprocessors with multimedia extensions for 720 480 (pixels) 30 frames/sec video signals.

A direct conversion receiver IC including an on-chip balun, an I/Q mixer, a variable gain amplifier and a 90 phase-shifter is fabricated in a Bi-CMOS technology with 15 GHz transition frequency (fT). This paper demonstrates that cascaded connection of an on-chip balun and a double balanced mixer as the I/Q mixer is effective to achieve a low DC offset and a low second-order distortion, on the basis of both careful examination of the mixer behavior and measurement. Input-referred DC offset voltage of less than 300 µV and spurious free dynamic range (SFDR) of over 67 dB are obtained by measurement. The IC consumes 52 mA from 2.7 V power supply voltage. The die size is 3 mm 3 mm.

For evaluating the output response fluctuation of the actual environmental acoustic system excited by arbitrary random inputs, it is important to predict a whole probability distribution form closely connected with many noise evaluation indexes Lx, Leq and so on. In this paper, a new type evaluation method is proposed by introducing lower and higher order type functional models matched to the prediction of the response probability distribution form especially from a problem-oriented viewpoint. Because of the non-negative property of the sound intensity variable, the response probability density function can be reasonably expressed in advance theoretically by a statistical Laguerre expansion series form. The system characteristic between input and output can be described by the regression relationship between the distribution parameters (containing expansion coefficients of this expression) and the stochastic input. These regression functions can be expressed in terms of the orthogonal series expansion. Since, in the actual environment, the observed output is inevitably contaminated by the background noise, the above regression functions can not be directly employed as the models for the actual environment. Fortunately, the observed output can be given by the sum of the system output and the background noise on the basis of additivity of intensity quantity and the statistical moments of the background noise can be obtained in advance. So, the models relating the regression functions to the function of the observed output can be derived. Next, the parameters of the regression functions are determined based on the least-squares error criteria and the measure of statistical independency according to the level of non-Gaussian property of the function of the observed output. Thus, by using the regression functions obtained by the proposed identification method, the probability distribution of the output reducing the background noise can be predicted. Finally, the effectiveness of the proposed method is confirmed experimentally too by applying it to an actual indoor-outdoor acoustic system.

In this paper we propose a mobile positioning method based on a recursive least squares (RLS) algorithm for suppressing the non-line of sight (NLOS) effects in cellular systems. The proposed method finds the position of a mobile station from TOAs measured by three BSs. Simulation results show that the proposed method has a fast convergence time and greatly reduces the positioning error especially in NLOS situations. Thus it is expected that the proposed method can be effectively used in a dense urban environment.

For physically disabled persons, the conventional computer keyboard is insufficient as a useable communication device. In this paper, Morse code is selected as a communication adaptive device for persons with impaired hand coordination and dexterity. Morse code is composed of a series of dots, dashes, and space intervals. Each element is transmitted by sending a signal for a defined length of time. Maintaining a stable typing rate by the disabled is difficult. To solve this problem, a suitable adaptive automatic recognition method, which combines a variable degree variable step size LMS algorithm with a learning vector quantization method, was applied to this problem in the present study. The method presented here is divided into five stages: space recognition, tone recognition, learning process, adaptive processing, and character recognition. Statistical analyses demonstrated that the proposed method elicited a better recognition rate in comparison to alternative methods in the literature.

We propose a blind source separation algorithm for the mixture of finite alphabet sources where sensors are less than sources. The algorithm consists of an update equation of an estimated mixing matrix and enumeration of the inferred sources. We present the bound of a step size for the stability of the algorithm and two methods of assignment of the initial point of the estimated mixing matrix. Simulation results verify the proposed algorithm.

This paper evaluates the security of the block cipher E2 against truncated differential cryptanalysis. We show an algorithm to search for effective truncated differentials. The result of the search confirmed that there exist no truncated differentials that lead to possible attacks for E2 with more than 8 rounds. The best attack breaks an 8-round variant of E2 with either IT-Function (the initial transformation) or FT-Function (the final transformation) using 294 chosen plaintexts. We also found the attack which distinguishes a 7-round variant of E2 with IT- and FT-Functions from a random permutation using 291 chosen plaintexts.

This paper proposes a statistical method to estimate the optimal software release time which minimizes the expected total software cost incurred in both testing and operation phases. It is shown that the underlying cost minimization problem can be reduced to a graphical one. This implies that the software release problem under consideration is essentially equivalent to a time series forecasting for the software fault-occurrence time data. In order to predict the future fault-occurrence time, we apply three extraordinary auto-regressive models by Singpurwalla and Soyer (1985) as the prediction devices as well as the well-known AR and ARIMA models. Numerical examples are devoted to illustrate the predictive performance for the proposed method. We compare it with the classical exponential software reliability growth model based on the non-homogeneous Poisson process, using actual software fault-occurrence time data.