Hogg and Huberman have proposed a strategy for stabilizing chaotic multi-agent systems. This paper applies their strategy to a resource allocation problem in a manufacturing system consisting of two machines and two types of parts. These part-types conflict each other over resource allocation. We introduce a discrete-time model of the system by using game theory, and examine stability and bifurcation phenomena of its fixed point. We show by computer simulation that chaotic behaviors are observed after successive occurrence of period-doubling bifurcations. It is also shown that the optimal state of the system is stabilized by a reward mechanism.

Direct sequence code division multiple access (DS-CDMA) is attractive for mobile radio use because of its inherently high capacity. There is great demand for mobile radio to offer multimedia services. This means that various service rates and qualities should be supported. DS-CDMA systems are flexible and can accommodate various user rates easily so these demands can be met. As many users will occupy the same frequency band simultaneously, the traffic capacity of a DS-CDMA system is determined by interference power. Interference cancellation is one of the important techniques in decreasing interference power at the demodulation stage and thus increasing traffic capacity. In this paper, we propose the delayed symbol combining interference canceller which can suppress the interference from various users sending at different information rates. Performance of the proposed method is calculated by computer simulations. Furthermore, the effect of adding forward error correction to the proposed canceller is also evaluated by computer simulations. In the quasi static flat fading environment, it is found that the Eb/No degradation due to interference is suppressed to 3 dB at BER=10-3 with 24 users. In the quasi static frequency selective fading environment, it is found that the required Eb/No of the frequency selective fading canceller is about 11 dB better than that of the flat fading canceller for the target BER of 10-3. It is found that BER<10-3 is achieved with forward error correction and bit interleaving even when the maximum Doppler frequency normalized by low data bit rate is 0. 0008 and Eb/No is 20 [dB] in frequency selective fading and 30 [dB] in flat fading.

This paper proposes a bit-stream-arranged weighted modulation scheme to improve voice quality in low delay spread frequency selective fading channels. The proposed modulation scheme employs an input bit stream arrangement method that changes the bit stream order for significant bits so that they are not adjacent to each other over time; a mapping method that controls the amplitude of the modulation signals according to the importance of the bits; and modified differential encoding to prevent the error propagation from insignificant to significant bits. Computer simulations clarify that the proposed bit-stream-arranged weighted modulation scheme shows a S/N improvement of 8 dB in an 8-bit linear pulse code modulation (PCM) voice signal compared with the conventional non-weighted π/4-shift quadrature phase shift keying (QPSK) modulation scheme. The proposed scheme also shows 3. 5 dB improvement in a 4-bit adaptive differential pulse code modulation (ADPCM) voice signal. In this case, occurence of 'click noise' in recovered voice signal is halved. Although the proposed scheme increases the peak power of the modulated signals, the non-linearity of the power amplifier is not fatal.

To enhance the anti-fading technique of direct sequence code division multiple access (DS/CDMA) schemes in land mobile radio communication systems, a two-dimensional RAKE reception (2D-RAKE) scheme in beam space digital beam forming (BS-DBF) antenna configuration is proposed. The proposed scheme is applied to cellular base stations where the received signals in the reverse link are relieved from multipath fading by means of enhanced RAKE combining in spacial and temporal domains. Fundamental performance in the reverse link under multipath fading environments is investigated by computer simulation applying a wideband propagation channel model.

We developed a measuring system that measures both capacitance and transmittance of a liquid crystal (LC) cell simultaneously. We then studied the dynamic orientation process of nematic LC molecules between two-photochromic command surfaces. The command surfaces consist of a polymer monolayer bearing azobenzene side chains and they are deposited on glass substrate coated with indium-tin-oxide by using the Langmuir-Blodgett technique. The capacitance of LC cells increased and decreased alternately due to orientation transition in LC molecules by irradiating ultraviolet (UV) and visible light, respectively. Similarly, with the alternating irradiation of UV and visible lights, the transmittance of the LC cell changed periodically. Mean tilt angles of LC molecules under irradiation of UV and visible lights were evaluated from the results of capacitance and transmittance. It was found that the transient transmittance response was delayed to the transient capacitance under the UV irradiation. This result corresponds to that the LC molecules in homeotropic mode tend to remain the optical alignment.

We have improved the optical beam induced resistance change (OBIRCH) system so as to detect (1) a current path as small as 10-50 µA from the rear side of a chip, (2) current paths in silicide lines as narrow as 0. 2 µm, (3) high-resistance Ti-depleted polysilicon regions in 0. 2 µm wide silicide lines, and (4) high-resistance amorphous thin layers as thin as a few nanometers at the bottoms of vias. All detections were possible even in observation areas as wide as 5 mm 5 mm. The physical causes of these detections were characterized by focused ion beam and transmission electron microscopy.

IDDQ testing, or current testing, is a powerful method which detects a large class of defects which cause abnormal quiescent current, by measuring the power supply current. One of the problems on IDDQ testing which prevent its full practical use in manufacturing is that the testing speed is slow owing to time-consuming IDDQ measurement. One of the solutions to this problem is test pattern compaction. This paper presents an efficient method for generating a compact test set for IDDQ testing of bridging faults in combinational CMOS circuits. Our method is based on the iterative improvement method. Each of random primary input patterns is iteratively improved through changing its values pin by pin selected orderly, so as to increase the number of newly detected faults in the current yet undetected fault set. While our method is simple and easy to implement, it is efficient. Experimental results for large ISCAS benchmark circuits demonstrate its efficiency in comparison with results of previous methods.

The Rician factor is an important parameter in evaluating the outage probability and reuse distance of cellular systems. From the measurement of 1. 8 GHz radio propagation in outdoor urban microcells, it is found that the measured pdf of the Rician factor for low tier systems follows a lognormal distribution and the factor is independent on the propagation distance.

An equivalent circuit for designing a coherent power combiner using a quasi-optical resonator has been developed. In the resonator, large numbers of devices (HEMT, HBT, etc. ) are arrayed two dimensionally and mounted on a surface of a metal grooved-mirror. A newly developed equivalent circuit for the resonator has been constructed using a transmission-line model. Experiments performed at Ku-band have shown that oscillation frequencies in a 33 HEMT array oscillator can be predicted with errors of less than 1% by using this equivalent circuit.

We propose a fault-tolerant routing algorithm for 2D meshes. Our routing algorithm can tolerate any number of concave fault regions. It is based on xy-routing and uses the concept of the fault ring/chain composed of fault-free elements surrounding faults. Three virtual channels per physical link are used for deadlock-free routing on a fault ring. Four virtual channels are needed for a fault chain. For a concave fault ring, fault-free nodes in the concave region have been deactivated to avoid deadlock in the previous algorithms, which results in excessive loss of the computational power. Our algorithm ensures deadlock-freedom by restricting the virtual channel usage in the concave region, and it minimizes the loss of the computational power. We also extend the proposed routing scheme for adaptive fault-tolerant routing. The adaptive version requires the same number of virtual channels as the deterministic one.

In this paper, a modified multi-step SIR-based down-link power control method is proposed. The main idea is to predict the variation of Rayleigh fading from the received signal-to-interference ratio and then to track it in time. A computer program is developed to simulate the performances of this new method as well as the original multi-step SIR-based method. Simulation results show that, of the two, the former performs better than the latter, even if the bit error rate of power control command is around 0. 001.

The TMN that appears to operate the various communication networks generally and efficiently is developed under the different platform environment such as the different hardware and the different operating system. One of the main problems is that all the agents of the TMN system must be duplicated and maintain the software and the data blocks that perform the identical function. Therefore, the standard of the Q3 interface development cannot be defined and the multi-platform cannot be supported in the development of the TMN agent. In order to overcome these problems, the Farming methodology that is based on the Farmer model has been suggested. The main concept of the Farming methodology is that the software and the data components that are duplicated and stored in each distributed object are saved in the Platform Independent Class Repository (PICR) by converting into the format of the independent componentware in the platform, so that the componentwares that are essential for the execution can be loaded and used statically or dynamically from PICR as described in the framework of each distributed object. The distributed TMN agent of the personal communication network is designed and developed by using the Farmer model.

For people with serious disability, it is most significant to be able to use the same communication methods, for instance a telephone and an electronic mail system (e-mail), as ordinary people do in order to get a normal life and communicate with other people for leading a social life. In particular, having communications access to an e-mail is a very effective method of communication that enables them to convey their intention to other people directly while at the same time keep their privacy. However, it takes them much time and effort to input an e-mail text on the computer. They also need much support by their attendants. From this point of view, we propose a multi-modal communication system that is composed of a voice recognizer, a pointing device, and a text composer. This system intend to improve the man-machine interface for people with physical disability. In this system, our voice recognition technology plays a key role in providing a good interface between disabled people and the personal computer. When generating e-mail contents, users access the database containing user keywords, and the guidance menu from which they select the appropriate word by voice. Our experimental results suggest that this communication system improves not only the time efficiency of text composition but also the readiness of disabled people to communicate with other people. In addition, our disabled subject on this paper is not able to move his body, legs and hands due to suffer from muscular dystrophy. And he is able to move only his fingers and speak command words with the assistance of a respirator.

We propose a Generalized Order Statistic Cell Averaging (GOSCA) CFAR detector. The weighted sums of the order statistics in the leading and lagging reference windows are utilized for the background level estimate. The estimate is obtained by averaging the weighted sums. By changing the weighting values, various CFAR detectors are obtained. The main advantage of the proposed GOSCA CFAR detector over the GOS CFAR detector is to reduce a computational time which is critical factor for the real time operation. We also derive unified formulas of the GOSCA CFAR detector under the noncoherent integration scheme. For Swerling target cases, performances of various CFAR detectors implemented using the GOSCA CFAR detector are derived and compared in homogeneous environment, and in the case of multiple targets and clutter edges situations.

This paper presents a technique to transmit 16QAM signals in mobile radio environments by using extended symbol-aided estimation (ESAE) method for compensating the multipath fading effect. The main results of this paper are the symbol error rate (SER) performance analyses for BPSK and 16QAM systems using the proposed estimation method under Rician fading. The analytical results demonstrate better performance of the proposed systems compared with those of the conventional systems under fast and severe fading, especially in the region of high signal to noise ratio.

A GaAs power amplifier IC has been developed for 1. 9-GHz digital mobile communication applications, such as the handsets of the Japanese personal handy phone system (PHS), which was assembled into a very small 0. 012-cc surface mount plastic package. This power amplifier using refractory WNx/W self-aligned gate MESFETs with p-pocket layers can operate with high efficiency and low distortion with a single 3-V supply. A very low dissipated current of 119 mA was obtained with an output power of 21. 1 dBm and a low 600-kHz adjacent channel leakage power (ACP) of -63 dBc for π/4-shifted quadrature phase shift keying (QPSK) modulated input.

In land mobile communication, CMA (Constant Modulus Algorithm) has been studied to reduce multipath fading effect. By this method, the transmitted power is not used efficiently since all the multipath components have the same information. To make use of received power efficiently, we propose a Blind Multiple Beam Adaptive Array. It has the following three feature points. First, we use CMA which can reduce the multipath fading effect to some extent without training signal. Second, LMS algorithm which can capture the multipath components which are separated from the reference signal by some extent. Third, we use FDF (Fractional Delay Filter) and TED (Timing Error Detector) loop which can detect and compensate fractional delay. As a result of utilizing the multipath components which is suppressed by CMA, the proposed technique achieves better performance than CMA adaptive array.

The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.

The exact expected test lengths of pseudo-random patterns that are generated by LFSRs are theoretically analyzed for a CUT containing hard random-pattern-resistant faults. The exact expected test lengths are also analyzed when more than one primitive polynomials are selected.

For a given N-vertex graph H, a graph G obtained from H by adding t vertices and some edges is called a t-FT (t-fault-tolerant) graph for H if even after deleting any t vertices from G, the remaining graph contains H as a subgraph. For the n-dimensional cube Q(n) with N vertices, a t-FT graph with an optimal number O(tN+t2) of added edges and maximum degree of O(N+t), and a t-FT graph with O(tNlog N) added edges and maximum degree of O(tlog N) have been known. In this paper, we introduce some t-FT graphs for Q(n) with an optimal number O(tN+t2) of added edges and small maximum degree. In particular, we show a t-FT graph for Q(n) with 2ctN+ct2((logN)/C)C added edges and maximum degree of O(N/(logC/2N))+4ct.