Site diversity causes unfairness in packet reception that depends on the location of the mobile stations in the up-link of CDMA cellular packet communication systems. This paper proposes an adaptive transmit permission probability control scheme that reduces this unfairness in CDMA cellular slotted-ALOHA systems with site diversity. The proposed scheme adaptively controls the transmit permission probability according to the offered load and the location of the mobile stations. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that adaptive transmit permission probability control improves fairness of service for all mobile stations and throughput performance across all channel loads compared with the conventional scheme.

In industrial assembly lines, seam sealing is a painting process used for making watertight seals or for preventing rusting. In the process, sealant is painted on seams located at the joints of pressed metal parts. We developed a sealing robot system that adjusts the sealing gun motion adaptively to the seam position sensed by a range sensor (a scanning laser rangefinder which senses profile range data). In this paper, we propose a high-speed and highly reliable algorithm for seam position computation from the sensed profile range data around the seam. It is proved experimentally that the sealing robot system used with the developed algorithm is very effective, especially for reducing wasted sealant.

Vanadyl-phthalocyanine (VOPc) single crystals were prepared on KBr substrate by molecular beam epitaxy (MBE). Their maximum size is 1380.16 µm3. The morphology of the VOPc single crystal was investigated from the results of UV/VIS spectra and RHEED. They suggest that the VOPc single crystal may be grown with pseudomorphic layers. The growing process was expained by Volmer-Weber model. The third order nonlinear optical property of VOPc single crystal was measured with Maker fringe method. The value of the third order optical susceptibility (χ(3)) of VOPc single crystal was estimated to be about 10-9 esu from the result of Maker fringe.

Photoacoustic spectroscopy (PAS) has recently received much attention especially for plant photosynthesis research, because this technique is capable of performing non-destructive measurement without any pre-treatment of specimens. So far we have developed a PAS system equipped with an open photoacoustic cell (OPC), which allows in situ and in vivo measurements of plant photosynthesis of intact undetached leaves. In this study, we have measured photosynthesis reaction using OPC and developed a Confocal Scanning Photoacoustic Microscopy (CSPAM) system, in which PAS is combined with confocal scanning laser microscopy. The system allows simultaneous measurement of acoustic signal and another signal such as fluorescence, and also gives two- and three- dimensional intensity distributions of these signals, thereby giving two- and three- dimensional information about photosynthetic activity of plants.

We have fabricated a static induction transistor structure by using copper phthalocyanine (CuPc) films. Its layer-structure is Au(drain)/CuPc/Al(gate)/CuPc/Au(source)/glass. The source-drain current is controlled by the Al gate bias-voltage when the drain voltage is positive but is almost independent of it when the drain voltage is negative. The current-voltage characteristics are governed by the space-charge-limited conduction which depends on shallow traps.

As a flexible way to accommodate a variety of services, a number of spreading bands are now considered in International Mobile Telecommunications-2000 (IMT-2000) systems and more than two (overlaid) bands can be operated simultaneously in CDMA systems. Capacity estimation in CDMA systems is an important issue in performance analysis and call admission control (CAC), which is closely related to power control. This study derives the reverse link capacity of signal-to-interference ratio (SIR)-based power-controlled overlaid multiband CDMA systems in single and multiple cell environments. The weighted-aggregated data rate is introduced as the link capacity, which can reflect different spreading bandwidths and different QoS requirements. Various combinations of 5, 10, and 20 MHz subsystems are compared to one another in view of the maximum weighted-aggregated data rate. The impact of pulse shaping on CAC and the effect of multiple traffic accommodation on link capacity are also investigated.

A number of parallel algorithms have been developed to solve large-scale real world problems. Although there has been much work on the design of parallel algorithms, there has been little on the design of languages for expressing these algorithms. This paper describes the BPL, a new parallel language designed for butterfly networks. The purpose of this language is to help designers in hiding the complexity of the algorithm and leaving details of mapping between data and processors for lower level. BPL provides a simpler virtual machine for the designer , in order to avoid thinking about control of processors and data. From another point of view, BPL helps designer to logically check the algorithm and correct any possible error in it. The paper gives some examples implemented by this language. In addition, we have also implemented a software tool which simulates the running of the algorithm on the network. The results lead us to believe that this language would be useful in representing all kinds of algorithms on this network including normal algorithms and others.

This paper deals with the fundamental problem of automatic assessment of appearance of seam puckers on suits, and suggests possibilities for practical usage. Presently, evaluations are done by inspectors who compare standard photographs of suits to test samples. In order to avoid human errors, however, a method of automatic evaluation is desired. We process the problem as pattern recognition. As a feature we use fractal dimensions. The fractal dimensions obtained from standard photographs are used as template patterns. To make it easier to calculate fractal dimensions, we plot a curve representing the appearance of seam puckers, from which fractal dimensions of the curve can be calculated. The seam puckers in gray-scale images are confused with the material's texture, so the seam puckers must be enhanced for a precise evaluation. By using the concept of variance, we select images with seam puckers and enhance only the images with seam puckers. This is the novel aspect of this work. Twenty suits are used for the evaluation experiment and we obtain a result almost the same to the evaluation gained by inspection. That is, the evaluation of 11 samples is the same as that gained by inspection, the results of 8 samples differ by 1 grade, and the evaluation of 1 sample has a 2-grade difference. The results are also compared to the evaluation of the system using the Daubechies wavelet feature. The result of comparison shows that the present method gives a better evaluation than the system using the Daubechies wavelet.

We report a new type of electrooptic deflector using lens effect which is able to scan a space in two dimensions. The proposed device was developed from a quasi-velocity-matched electrooptic phase modulator with periodic domain inversion, therefore, it can operate efficiently at a microwave frequency. In the experiments, the demonstration of its operation and applications to ultrafast light control was done at 16.25 GHz.

We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.

In this paper, we propose an idea of the generalization of threshold signature and authenticated encryption for group communications. The concept of the (t, n) threshold signature with (k, l) shared verification is implemented in group-oriented cryptosystems. In the system, any t members can represent a group to sign a message and any k verifiers can represent another group to authenticate the signature. By integrating the cryptographic techniques of data encryption, digital signature and message recovery, a group-oriented authenticated encryption scheme with (k, l) shared verification is also proposed. The message expansion and communication cost can also be reduced in our schemes.

The potential of Software Radio (SR) has been slow to materialize. Born out of the spoils of the Cold War, the SR concept has remained prisoner of its origin, mainly focused on the terminal, and still under considerable military influence. Such narrow perspective does not fit with our long held conviction that SR has far-reaching potential, and much broader application. While some saw it as "simply" freeing us from standards, by allowing the definition of the radio terminal in software (hence Software Defined Radio, SDR), we see it as changing not only the way we think radio systems and networks, but also the way we define and provide the services and adapt the applications that ran on top of them. We discuss here this much broader, all encompassing approach. While the "canonical" SDR approach concentrates on the terminal side, ours covers the whole system, extending through the network into service creation and application development. Instead of settling for defining the radio in software, we envision Re-configuring on demand not only the terminal but also the serving network(s) and the services they provide (hence Re-configurable Radio Systems and Networks). To illustrate aspects of this novel approach, we discuss past and ongoing research in Europe on Re-configurable Radio Systems and Networks, and identify areas requiring further attention.

In this paper, we study efficient scheduling algorithms that are suitable for ATM networks. In ATM networks, all packets have a fixed small length of 53 bytes and they are transmitted at very high rate. Thus time complexity of a scheduling algorithm is quite important. Most scheduling algorithms proposed so far have a complexity of O(log N) per packet, where N denotes the number of connections sharing the link. In contrast, weighted round robin (WRR) has the advantage of having O(1) complexity; however, it is known that its delay property gets worse as N increases. To solve this problem, in this paper we propose two new variants of WRR, uniform round robin (URR) and idling uniform round robin (I-URR). Both disciplines provide end-to-end delay and fairness bounds which are independent of N. Complexity of URR, however, slightly increases as N increases, while I-URR has complexity of O(1) per packet. I-URR also works as a traffic shaper, so that it can significantly alleviate congestion on the network. We also introduce a hierarchical WRR discipline (H-WRR) which consists of different WRR servers using I-URR as the root server. H-WRR efficiently accommodates both guaranteed and best-effort connections, while maintaining O(1) complexity per packet. If several connections are reserving the same bandwidth, H-WRR provides them with delay bounds that are close to those of weighted fair queueing.

As the clock skew is one of the major constraints for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization may increase the total wire length; therefore, clock routing is performed within the given skew bound. Clock routing under the specified skew bound can decrease the total wire length. A new efficient algorithm for bounded clock skew routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevents the total wire length from increasing. Not only the total wire length and delay time minimization algorithm using the new merging point relocation method but also the clock skew reduction algorithm using link-edge insertion technique for a pair of nodes whose delay difference is large is proposed. The proposed algorithm constructs a new clock routing topology which is a generalized graph model, while most previous methods use only tree-structured routing topology. A new cost function is designed in order to select two nodes for link-edge addition. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance is small. Furthermore, routing topology construction and wire sizing algorithm is used to reduce the clock delay. The proposed algorithm is implemented in C programming language. The experimental results show that the total wire length can be reduced under the given skew bound.

A simple phase compensation technique with improved power supply rejection ratio (PSRR) for CMOS opamps is proposed. This technique is based on feeding back a current proportional to a derivative of the voltage difference between an output and an input, and does not require a common-gate circuit or a noise-free bias for the circuit. The proposed technique requires only two additional transistors, which are connected to the differential pair of transistors in a cascade manner, and the compensation capacitor is connected to the source node of the additional transistor. Experimental results show an improvement of more than 20 dB in the PSRR at high frequencies, comparing the technique with a Miller compensation. This technique also improves the unity gain frequency and the phase margin from 0.9 MHz and 17 to 1.8 MHz and 44 for 200 pF load capacitance, respectively.

We propose a novel Bragg grating filter synthesis method using a Fourier transform of the target scattering matrix. Multiple scattering processes are taken into account by iteration to improve the synthesis accuracy.

For plasma simulations, we developed a one-dimensional (1d) Object-Oriented Particle-in-Cell code for X11-based Unix workstations (XOOPIC) by modifying the current two-dimensional version which was originally developed by PTSG (Plasma theory and simulation group) in the University of California at Berkeley. We implemented a simplified field solve and current deposition in the code. We retained three components of particle velocity, although the spatial variation for particle position and field components is limited to one dimension. To verify the function of the 1d code, we perform simulations with typical models such as the Child-Langmuir current model and electromagnetic wave propagation in plasma. In both cases, the simulation results quantitatively agree with the theory.

This paper presents a constant-scale-factor radix-2-4-8 CORDIC algorithm for fast vector rotation and sine/cosine computation. The CORDIC algorithm is a well-known hardware algorithm for computing various elementary functions. Due to its sequential nature of computation, however, significant reduction in processing latency is required for real-time signal processing applications. The proposed radix-2-4-8 CORDIC algorithm dynamically changes the radix of computation during operation, and makes possible the reduction in the number of iterations by 37% for 64-bit precision. This paper also describes the hardware implementation of radix-2-4-8 CORDIC unit that can be installed into practical digital signal processors.

A new digital watermark approach based on fractal image coding is proposed in this letter. We present a way to use the fractal code as a means of embedding a watermark. The proposed approach has shown to be resistant to the JPEG lossy compression. Moreover, the digital watermark can be simply extracted from the watermarked image without resorting to the original image.

The call processing capacity of a base station in CDMA cellular network can be changeable due to the additive loads from handoff, paging and location registration as well as call setup/release. In general, the load box test is widely used for measuring the call processing capacity of a exchange in the fixed network. But, it is difficult to estimate the processing capacity accurately because system load includes hand-off, paging in a mobile network. In this paper, we propose a new methodology for the calculation of call processing capacity to investigate the effect of traffic parameters on the system capacity, through the traffic modeling of call flow in base station. This result shows that the traffic load of hand-off limits the system capacity largely and is more severe than has been expected. Regression analysis will be also derived for the investigation of unit load and linear relation between CPU load and traffic load. This analysis using the field data from an operating site indicates that the call processing capacity in the wireless network must be specified with the rates of hand-off, paging and location registration, in contrast with the fixed network.