As many research works are based on some previous results, my paper, namely The Integrated Scheduling and Allocation of High-Level Test Synthesis, makes use of some techniques by T. Kim. However, I did not state explicitly that some parts of my work are based on Kim's approach although I have referred to his paper. I would like to express my deep apology to Kim for not having emphasized Kim's contribution to my work. But my intention was not to steal Kim's ideas. I would like to emphasize the following difference.

In this paper, the Linear Exponential Quadratic Gaussian with Loop Transfer Recovery (LEQG/LTR) methodology is employed for the design of high performance induction motor servo systems. In addition, we design a speed sensorless induction motor vector controlled driver with both the extended Kalman filter and the LEQG/LTR algorithm. The experimental realization of an induction servo system is given. Compared with the traditional PI and LQG/LTR methods, it can be seen that the system output sensitivity for parameter variations and the rising time for larger command input of the proposed method can be significantly reduced.

In this paper, we show two process allocation schemes to tolerate multiple faults when the primary-backup replication method is used. The first scheme, called multiple backup scheme, is running multiple backup processes for each process to tolerate multiple faults. The second scheme, called regenerative backup scheme, is running only one backup process for each process, but re-generates backup processes for processes that do not have a backup process after a fault occurrence to keep the primary-backup process pair available. In both schemes, we propose heuristic process allocation methods for balancing loads in spite of the occurrence of faults. Then we evaluate and compare the performance of the proposed heuristic process allocation methods using simulation. Next, we analyze the reliability of two schemes based on their fault-tolerance capability. For the analysis of fault-tolerance capability, we find the degree of fault tolerance for each scheme. Then we find the reliability of each scheme using Markov chains. The comparison results of two schemes indicate that the regenerative single backup process allocation scheme is more suitable than the multiple backup allocation scheme.

This article discusses automatic strategy acquisition for the game "Othello" based on a reinforcement learning scheme. In our approach, a computer player, which initially knows only the game rules, becomes stronger after playing several thousands of games against another player. In each game, the computer player refines the evaluation function for the game state, which is achieved by min-max reinforcement learning (MMRL). MMRL is a simple learning scheme that uses the min-max strategy. Since the state space of Othello is huge, we employ a normalized Gaussian network (NGnet) to represent the evaluation function. As a result, the computer player becomes strong enough to beat a player employing a heuristic strategy. This article experimentally shows that MMRL is better than TD(0) and also shows that the NGnet is better than a multi-layered perceptron, in our Othello task.

In this paper, we present a new approach which is spanning tree-based genetic algorithm for solving a multi-objective transportation problem. The transportation problem as a special type of the network optimization problems has the special data structure in solution characterized as a transportation graph. In encoding transportation problem, we introduce one of node encodings based on a spanning tree which is adopted as it is capable of equally and uniquely representing all possible basic solutions. The crossover and mutation were designed based on this encoding. Also we designed the criterion that chromosome has always feasibility converted to a transportation tree. In the evolutionary process, the mixed strategy with (µ+λ)-selection and roulette wheel selection is used. Numerical experiments show the effectiveness and efficiency of the proposed algorithm.

This paper examines fairness of service in the up-link of CDMA cellular slotted-ALOHA packet communication systems with site diversity reception. Site diversity rescues the packets originating mainly from near the edge of the cells, whereas packets originating near the base stations can not obtain the benefits of diversity reception. This situation causes an unfairness in packet reception that depends on location of the mobile station. Two transmission control schemes for reducing this unfairness are proposed. In the first scheme, mobile stations control the target received power for the open-loop power control based on the reception level of the pilot signals of the surrounding base stations. In the second, mobile stations control transmit permission probability. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that both schemes improve service fairness for all mobile stations and throughput performances. A performance comparison between the two schemes concludes that transmission power control outperforms transmit permission probability control as a simple technique for maintaining fairness of services.

The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.

This paper proposes a new vector error measurement scheme for orthogonal frequency division multiplexing (OFDM) systems that is used to define transmit modulation accuracy. The transmit modulation accuracy is defined to guarantee inter-operability among wireless terminals. In OFDM systems, the transmit modulation accuracy measured by the conventional vector error measurement scheme can not guarantee inter-operability due to the effect of phase noise. To overcome this problem, the proposed vector error measurement scheme utilizes pilot signals in multiple OFDM symbols to compensate the phase rotation caused by the phase noise. Computer simulation results show that the vector error measured by the proposed scheme uniquely corresponds to the C/N degradation in packet error rate even if phase noise exists in the OFDM signals. This means that the proposed vector error measurement scheme makes it possible to define the transmit modulation accuracy and so guarantee inter-operability among wireless terminals.

Multi-path propagation structure in the urban mobile communication environment of 25 GHz band has been measured by means of newly developed "multi-path propagation parameter measurement equipment," which is capable of estimating coupled DOA (Direction Of Arrival), TOA (Time Of Arrival) and relative field strength by super resolution techniques. Before measurement, basic performance of the equipment has been evaluated in the anechoic chamber in order to ascertain limitation on measurement. For practice and verification of outdoor propagation characteristics, basic data have been collected in a works where accurate buildings and road layout is known. Sub-sequently, data have been collected in the urban mobile communication environment and following characteristics have been confirmed. 1) DOA and TOA of wave reflected by the side of building almost follow the ray-trace. 2) Street trees make 25 GHz band wave attenuate. 3) There are such unusual cases that it is possible to communicate in spite of out of line-of-sight by multi-path propagation. 4) Narrow streets have very complicated propagation structures. Finally, technologies that should be developed for the high-speed digital mobile communication are proposed based on the measurement results.

This paper describes a method of predicting transmission performance to be obtained by applying RAKE reception and parallel transmission in realistic urban multipath environments. Delay profiles measured in metropolitan Tokyo at microwave frequencies were used to obtain the impulse responses of radio channels, and the closed-form equations corresponding to the performance of these anti-multipath techniques were derived, by means of the characteristic function method, under the assumption that the phases of the impulse responses are uniformly distributed. Results show that RAKE reception provides bit error rates 100 times lower than bare transmission does, whereas the improvement obtained by using parallel transmission should be especially valuable in broadband communication systems, such as those operating at data rates above 10 Mb/s.

One way of accommodating multimedia traffic having various transmission rates is to use multicode transmission in CDMA cellular systems. A multicode user, however, corresponds to locally concentrated single-code users, and the simultaneous transmission of multiple signals causes non-uniform traffic on cellular systems. We evaluate the performance of multicode transmission in CDMA systems in terms of call blocking and communications quality. We also estimate the number of receivers and searchers needed in a base station. Our previously proposed dynamic cell configuration (DCC) scheme reduces the adverse effects of non-uniform traffic in CDMA systems. In the present study, we found that the use of DCC for voice/data integrated traffic using multicode transmission reduces call blocking and improves communications quality for both voice and data users.

This paper proposes a new polling-based dynamic slot assignment (DSA) scheme. With the rapid progress of wireless access systems, wireless data communication will become more and more attractive. In wireless data communication, an efficient DSA scheme is required to enhance system throughput, since the capacity of radio links is often smaller than that of wired links. A polling-based DSA scheme is typically used in centralized slot assignment control systems. It, however, is difficult to assign the slots to the targeted mobile terminals in a fair-share manner if only a polling-based scheme is used, especially in unbalanced-traffic circumstances, as revealed later. To solve this problem, we propose the exponential decreasing and proportional increasing rate control as is employed in available bit rate (ABR) service in ATM so that fair slot assignment is achieved even in heavily-unbalanced-traffic circumstances. Moreover, so that an AP operating with a large number of MTs can avoid long transmission delays, a polling-based resource request scheme with random access is featured in a new algorithm. Simulations verify that the proposed scheme offers fair slot assignment for each user while maintaining high throughput and short delay performance.

Hallen's integral equation for cylindrical antennas is modified to deal with finite gap excitation. Because it is based on more realistic modeling, the solution is more accurate, and the convergence is guaranteed. The new equation is written with a new excitation function dependent on the gap width. The moment method analysis is presented where the piecewise sinusoidal surface current functions are used in Galerkin's procedure. Total, external and internal current distributions can be determined. Numerical results for cylindrical antennas with wide variety of gap width and radius are shown, and are compared with the numerical results by the Pocklington type integral equation and those by measurement.

In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, the mean service time of a station and the mean token rotation time are derived, as functions of the given network parameters such as the total number of stations on the network, the arrival rate of frames, the transmission rate of frames, and the buffer capacity. The variance of service time of a station is also derived. By examining derived results, it is shown that they exactly describe the actual operations of the network. In addition, computer simulations with sufficient confidence intervals help to validate the results.

This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.

An accurate and efficient numerical solution is presented for a two-dimensional electromagnetic wave scattering from a multilayered resistive strip grating embedded in a dielectric slab. Both E- and H-waves are treated. The problem is formulated into a set of integral equations, which is solved by the moment method accompanied by a regularization procedure. The resultant set of linear algebraic equations has the form of the Fredholm second kind, and therefore yields stable and accurate numerical solutions. The power distribution is computed for several grating parameters. Attention is paid to seek a set of parameters that maximizes absorption in the strips. The low frequency approximate formulas are also derived. This analysis would be useful in designing electromagnetic wave absorbers.

A coterie is a set of quorums such that any two quorums intersect each other, and is used in a quorum based algorithm for solving the mutual exclusion problem. The availability of a coterie is the probability that the algorithm (adopting the coterie) tolerates process and/or link failures. Constructing an optimal coterie in terms of the availability is therefore important from the view of fault tolerance, but unfortunately, even calculating the availability is known to be #P-hard. Recently Harada and Yamashita proposed several heuristic methods for improving the availability of a coterie. This letter first evaluates their performance and then proposes a practical method for constructing a semi-optimal coterie by using one of the heuristic methods as a main component.

This paper proposes a short delay, error-resilient video transmission scheme for mobile radio channels. Compressed video data are sensitive to channel error. Video coding schemes such as H. 263 use variable length coding so channel error can cause synchronization failure in the decoder and fatally degrade the reconstructed video sequence by triggering intra- and inter-frame error propagation. ARQ prevents all forms of error propagation but significantly increases the transmission delay of the video frame. We propose a new error control scheme to reduces the delay incurred by ARQ; the receiving buffer can transmits the video frame data to the video decoder even if not all ARQ frames containing the video frame are received. The encoder transmits additional information, the Macro Block (MB) size, in the video frame header. Upon receiving this information, the receiving buffer can determine MB length which allows MB de-synchronization to be prevented. For example, if an ARQ frame is lost, the decoder determines the position of the missing MB and replace this MB with the equivalent block in the previous video frame; this prevents intra-frame error propagation. When all ARQ frames are received and decoded correctly, the video frame in the reference video memory is replaced with the correctly decoded one. Simulation results show that the proposed scheme can minimize the delay and the reduction in frame rate caused by retransmission control without intra- and inter-error propagation.

In this paper, we describe an implementation of analog neural network system with on-line learning capability. A learning rule using the simultaneous perturbation is adopted. Compared with usage of the ordinary back-propagation method, we can easily implement the simultaneous perturbation learning rule. The neural system can monitor weight values and an error value. The exclusive OR problem and a simple function problem are shown.

To improve frequency efficiency or user capacity in multi-path fading environments, we introduce and investigate an orthogonal multi-carrier frequency hopping-code division multiple access (FH-CDMA). These improvements are achieved by combining the orthogonal frequency division multiplexing (OFDM) and FH-CDMA schemes. The basic idea has been previously proposed by the authors. The aim of study in this paper is to evaluate the performance of this scheme in various environments. The theoretical analysis of bit error rate (BER) performance in this paper includes the effects of frequency selective fading in land mobile communications and of nonlinear amplification in satellite communications. A modified scheme of controlling transmission power to be controlled according to the number of simultaneously accessing users is also discussed. This modified scheme improves BER performance for frequency selective fading when the number of simultaneously accessing users in a cellular zone is small. Furthermore, an error-correcting code and its erasure decoding are applied in order to reduce errors due to hits in asynchronous FH/CDMA for reverse link as well as errors due to fading and noise.