This paper proposes a fast encoding algorithm for iterated function system (IFS) coding of gray-level homogeneous fractal images. In order to realize IFS coding of high order fractal images, it is necessary to solve a set of simultaneous equations with many unknowns. Solving the simultaneous equations using a multi-dimensional, numerical root-finding method is however very time consuming. As preprocessing of numerical computation, the proposed algorithm employs univariate polynomial manipulation, which requires less computation time than multivariate polynomial manipulation. Moreover, the symmetry of the simultaneous equations with respect to the displacement coefficients enables us to derive an equation with a single unknown from the simultaneous equations using univariate polynomial manipulation. An experimental result is presented to illustrate that the encoding time of the proposed algorithm is about 5 seconds on a personal computer with a 400 MHz Pentium II processor.

This paper presents a novel dead-beat synchronization scheme and applies it to communications in discrete-time chaotic systems. A well-known Henon system is considered as an illustrative example. In addition, a Henon-based image processing application effectively exploits the proposed scheme's effectiveness.

A clock recovery circuit is a key component in optical communication systems. In this paper, an optoelectronic clock recovery circuit is reported that monolithically integrates a resonant tunneling diode (RTD) and a uni-traveling-carrier photodiode (UTC-PD). The circuit is an injection-locked-type RTD oscillator that uses the photo-current generated by the UTC-PD. Fundamental and sub-harmonic clock extraction is confirmed for the first time with good clock recovery circuit characteristics. The IC extracts an electrical 11.55-GHz clock signal from 11.55-Gbit/s RZ optical data streams with the wide locking range of 450 MHz and low power dissipation of 1.3 mW. Furthermore, the extraction of a sub-harmonic clock from 23.1-Gbit/s and 46.2-Gbit/s input data streams is also confirmed in the wider locking range of 600 MHz. The RMS jitter as determined from a single sideband phase noise measurement is extremely low at less than 200 fs in both cases of clock and sub-harmonic clock extraction. To our knowledge, the product of the output power and operating frequency of the circuit is the highest ever reported for injection-locked-type RTD oscillators. These characteristics indicate the feasibility of the optoelectronic clock recovery circuit for use in future ultra-high-speed fully monolithic receivers.

The onboard antenna beam forming network (BFN) of the next-generation communication satellites must offer multiple beam forming and beam steering. The conventional BFN, which directly controls the array elements, is not suitable for a large-scale array antenna because of the difficulty of BFN control. This paper proposes a new BFN configuration that consists of three/four-way variable power dividers and a Butler matrix (FFT circuit). This BFN can offer continuous beam steering with fewer variable components. By introducing new techniques based upon excluding FFT periods and power evaluations by definite integration, the deviation in beamwidth is reduced by 75% or more and the maximum sidelobe level is improved by 10 dB or more.

One effective way to make a large-capacity mobile communication system is to use a microcellular system. One way to do this is to place the base station antennas lower than the surrounding buildings. This result in what is called a street microcellular system. We previously presented basic simulation results evaluating the performance of a different-sized cell combination algorithm (DCC) designed to avoid the problems due to an unbalanced distribution of traffic in street microcellular systems. In this paper, we present the results of simulations evaluating the performance of an improved active different-sized cell combination method (ADCC) that controls the transmission power of each base station.

Newton based adaptive algorithms are among the algorithms which are known to exhibit a higher convergence speed in comparison to the least mean square (LMS) algorithms. In this paper we propose a simplified Newton based adaptive algorithm for an adaptive infinite impulse response (IIR) filter implemented using cascades of second order allpass filters and a finite impulse response (FIR) filter. The proposed Newton based algorithm avoids the complexity that may arise in the direct differentiation of the mean square error. The analysis and simulation results presented for the algorithm, show that the property of convergence of the poles of the IIR ADF to those of the unknown system will be maintained for both white and colored input signal. Computer simulation results confirm an increase in convergence speed in comparison to the LMS algorithm.

High-temperature superconductor (HTS) receiving filter subsystem for mobile telecommunication base station has been developed. An 11-pole HTS filter using YBa2Cu3O7-δ (YBCO) thin films and a low noise amplifier were cooled to 70 K by a small cryocooler. Total noise figure of this subsystem was measured to be 0.5 dB. Furthermore the effect of using the subsystem in the receiver front-end of Code Division Multiple Access (CDMA) cellular base station was investigated. The transmitting power reduction of handy terminal was estimated to be about 35%.

This paper presents two man-machine reliability models. A system consists of one machine unit, one operator, and one event detecting monitor. The machine unit has three states, normal, abnormal, and failed. The event detecting monitor may fail in two ways. If a machine unit becomes abnormal, the event detecting monitor sends a signal, and the operator takes necessary actions. If the operator fails in the action in the cause of human error, the machine unit goes down. The condition of the operator is classified into two types, good and bad. The time to repair, and the human error rate both depend on the condition of the operator. The MTTF is obtained by using a Markov model and numerical computation. Furthermore, the optimal operating period which minimizes the overall cost is decided by using computer methods. Some numerical examples are shown.

This paper proposes a new design method of nonlinear filtering and fixed-point smoothing algorithms in discrete-time stochastic systems. The observed value consists of nonlinearly modulated signal and additive white Gaussian observation noise. The filtering and fixed-point smoothing algorithms are designed based on the same idea as the extended Kalman filter derived based on the recursive least-squares Kalman filter in linear discrete-time stochastic systems. The proposed filter and fixed-point smoother necessitate the information of the autocovariance function of the signal, the variance of the observation noise, the nonlinear observation function and its differentiated one with respect to the signal. The estimation accuracy of the proposed extended filter is compared with the extended maximum a posteriori (MAP) filter theoretically. Also, the current estimators are compared in estimation accuracy with the extended MAP estimators, the extended Kalman estimators and the Kalman neuro computing method numerically.

In this paper, the performance of dynamic channel assignment for cellular systems with an array antenna is evaluated assuming realistic beamformer. A new dynamic channel assignment algorithm is proposed to improve the performance by forming a directional beam pattern to cancel stronger co-channel interference with higher priority. Performance comparison is carried out by computer simulations. Conventional algorithm shows 2.7 fold capacity increase compared with an omni antenna system, whereas proposed algorithm shows around 3.3 fold capacity increase, at the point of 3 percent blocking probability. The simulation results also denote that a shorter reuse distance can be achieved by the proposed algorithm, which indicates a more efficient utilization of channel resource.

This paper presents a new approach to computer image generation via three proposed methods for translating the evolution of a Petri net into fractal image synthesis. The idea is derived from the concept of fractal iteration principles in the escape-time algorithm and chaos game. The approach uses a Petri net as a powerful abstract modeling tool for fractal image synthesis via its duality, deadlock, inhibitor arc, firing sequence and marking reachability. The objective of this approach is to enhance the analysis technique of a Petri net and use it as a novel technique for fractal image synthesis. Generating fractal images via the dynamics of a Petri net allows an easy and direct proof for the similarity and correspondence between the dynamics of complex quadratic fractals by the recursive procedure of the escape-time algorithm and the state of a Petri net via a reachability problem. The reachability problem will be manipulated in terms of the dynamics of the fractal in order to generate images via three proposed methods. Validation of our approach is given by discussion and an illustration of some experimental results.

In a personal communication system (PCS), a scheme for reforwarding call-terminating setup messages (SETUP messages) from a network or a cell station is used to guard against their loss. We have developed a method for evaluating the loss probability of a reforwarding scheme in which the network monitors the response messages from a personal station after forwarding a SETUP message to that personal station and reforwards the SETUP message only if a response message is not received. We started with a stochastic model in which messages registered in the paging-channel queue in a cell station are cyclically forwarded to the wireless area. This model corresponds to the finite-capacity M/D/1/N model with vacation time. We then added a method for calculating the "timeout" probability. Next we expanded the model into one in which the SETUP messages are reforwarded when a response message is not received by the network. This model corresponds to the M/D/1/N model with vacation time and retrials. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the traffic characteristics of PCS call-terminating control.

By integrating three networks, namely, Public Switched Telephone Network (PSTN), Personal Handy-Phone System (PHS) and Intelligent Network (IN) to work together as a Personal Communication Telephone (PCT) service to be offered in the Bangkok metropolis area, the PCT service enables the advent of three new concepts, first, using the same telephone number as that of the fixed line to become a "Personal Number," second, a cell coverage designed to cover larger areas than that of the PHS (by changing hand-out threshold level from 33 dBµV to 30 dBµV and hand-in threshold level from 30 dBµV to 25 dBµV) in order to reduce the muting time during the handover process and provide higher mobility at up to 60 kilometers per hour, and third, a technique of "2 carriers per area" to reduce "call drop." All these techniques will be described in this paper.

The concept of controlled resource sharing and dynamic quality of service (QoS) on the next generation Internet has attracted much attention recently. It is suggested that, by imposing real-time revision of shared resource allocated to individual media streams or data flows according to user/application QoS demand and resource availability, more balanced and efficient multimedia services can be provided. In this paper, we present an Adaptive Control Framework (ACF), which is developed for controlled resource sharing and dynamic QoS in real-time multimedia service. We discuss main elements of ACF including 1) Control schemes applicable in the framework, and 2) Control mechanisms used in ACF. It is clearly shown in this paper that, with control schemes and mechanisms incorporated in ACF and supportive algorithms and protocols for ACF applications on the Internet, more flexible service and better overall performance in terms of packet loss, latency, signal-noise ratio and re-synchronization delay, can be offered.

In this paper, the performance of some communication systems using chaos synchronization is evaluated and compared. A new channel model taking the attenuation, impedance mismatch and noise into account, is proposed for the performance evaluation. The evaluation of bit error rate is done for both ideal and non-ideal conditions using the channel model. It is confirmed that some chaos-based communication systems have a good performance compared with conventional analog communication schemes.

A distributed computing system consists of processing elements, communication links, memory units, data files, and programs. These resources are interconnected via a communication network and controlled by a distributed operating system. The distributed program reliability (DPR) in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to retrieve data files from other processing elements will be executed successfully. This reliability varies according to 1) the topology of the distributed computing system, 2) the reliability of the communication edges, 3) the data files and programs distribution among processing elements, and 4) the data files required to execute a program. In this paper, we show that computing the distributed program reliability on a star distributed computing system is #P-complete. A polynomially solvable case is developed for computing the distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing the distributed program reliability with approximate solutions when the star topology has no the additional file distribution.

To design and develop user-oriented, flexible and distributed applications which can deal with various users' requirements, new technologies to manage, control and utilize the services of communication networks have to be provided. In this paper, the current challenges faced by large-scale distributed applications are discussed and a framework for the next generation network operation and management is presented on the basis of agent-based computing technologies. Examples of flexible distributed applications are presented to clarify the role of application-centric flexible network operation and management.

This paper presents a method of calculating an interval including a bifurcation point. Turning points, simple bifurcation points, symmetry breaking bifurcation points and hysteresis points are calculated with guaranteed accuracy by the extended systems for them and by the Krawczyk-based interval validation method. Taking several examples, the results of validation are also presented.

A new concept of "an imperfect singular solution" is defined as an approximate solution which becomes a singular solution by adding a suitable small perturbation to the original equations. A numerical method is presented for proving the existence of imperfect singular solutions of nonlinear equations with guaranteed accuracy. A few numerical examples are also presented for illustration.

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.