A LiNbO3 piezoelectric actuator controls the Au-Au contact gap. The control accuracy of the actuator is within the sub-micron range. Contact voltage, contact current, displacement of electrodes and driving voltage of the actuator were continuously and synchronously recorded by an A/D converter and send to a computer. The measured oscillograph data for 1500 contact operation were processed by the computer. Factors of discharge and bridge phenomena were derived at a contact operation. The delay time between displacement and driving signal of the actuator increased when one side of electric contact were vibrated. The resonance was seen in the actuator, and the dependency to the current and the amplitude was seen.

We propose a new frequency and frame synchronization technique for orthogonal frequency division multiplexing (OFDM) systems in frequency domain by using the channel information. The proposed frequency synchronization scheme shows optimal performance. Also it is shown that the proposed frame synchronization scheme has significantly enhanced performance improvement and wide estimation range.

This paper proposes a new dynamic multicast routing algorithm for layered streams. Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost, and that it works well on large-scale networks and those with traffic heterogeneity and a small number of routing control messages.

Discrete cosine transform (DCT) coding has been proven to be an efficient means of image compression coding. A lot of efforts have been made to improve the coding efficiency of DCT based coding. This paper presents an adaptive DCT coding based on geometrical edge representation. This scheme is designed to properly exploit the correlation between edge direction and distribution of DCT coefficients. Edges are extracted from original images first. Then, sub-optimal block-size and scanning order are determined at each block based on the extracted edges. In this way an adaptive DCT scheme taking account of local characteristics of image can be achieved. It is shown through the simulations that the proposed algorithm outperforms a conventional coding scheme in terms of coding efficiency by 10-15%.

Various optical fiber connectors have been developed during the 20 years since optical fiber communications systems were first put into practical use. As the domain of optical fiber communication systems expanded from trunk lines to subscriber lines and customer premises the main focus changed from performance improvement to miniaturization and cost reduction. This paper describes the technical background, recent trends in standard optical connectors, and recent issues related to photonic connection technologies.

Nowadays electronic devices and systems are widely used in various dynamic environments. However, they cause electrical contact instability that can easily be ignored. This phenomenon is considered as contact failure caused by a dynamic influence. In this paper, the investigation of contact failure caused by dynamic influences and analysis method for such contact failure are discussed. The results show that a dynamic influence could not be well covered in the experimental testing for a new product.

A minor component analysis approach based on the generalized sidelobe canceler is presented to realize the blind suppression of multiple-access interference in multicarrier code division multiple access systems. With a rough user-code and timing estimations, this proposed method of less computation performs the same as minimum mean square error detectors and outperforms existing blind detectors. Simulation results illustrate the effectiveness of the blind multiuser detection.

The energy conservation law and the optical theorem in the grating theory are discussed: the energy conservation law states that the incident energy is equal to the sum of diffracted energies and the optical theorem means that the diffraction takes place at the loss of the specularly reflection amplitude. A mathematical relation between the optical theorem and the energy conservation law is given. Some numerical examples are given for a TM plane wave diffraction by a sinusoidal surface.

The key elements of sub-100 nm MOSFET modeling for circuit simulation are accurate representation of new physical phenomena arising from advancing technologies and numerical efficacy. We summarize the history of MOSFET modeling, and address difficulties faced by conventional methods. The advantage of the surface-potential-based approach will be emphasized. Perspectives for next generations will be also discussed.

Utilizing a macromodel which calculates the floating gate potential by combining resistances and dependent voltage and current sources, DC transfer characteristics for multi-input neuron MOS inverters and for those in the neuron MOS full adder circuit are simulated both at room temperature and at 77 K. Based on the simulated results, low temperature circuit failures are discussed. Furthermore, circuit design parameter optimization both for low and room temperature operations is described.

This paper deals with the wave scattering from a periodic surface with finite extent. Modifying a spectral formalism, we find that the spectral amplitude of the scattered wave can be determined by the surface field on only the corrugated part of the surface. The surface field on such a corrugated part is then expanded into Fourier series with unknown Fourier coefficients. A matrix equation for the Fourier coefficients is obtained and is solved numerically for a sinusoidally corrugated surface. Then, the angular distribution of the scattering, the relative power of each diffraction beam and the optical theorem are calculated and illustrated in figures. Also, the relative powers of diffraction are calculated against the angle of incidence for a periodic surface with infinite extent. By comparing a finite periodic case with an infinite periodic case, it is pointed out that relative powers of diffraction beam are much similar in these of diffraction for the infinite periodic case.

To estimate the electromagnetic noise radiated from a printed circuit board (PCB) driven by a switching device, the finite difference time domain (FDTD) simulation method implementing the switching transistor is developed. The electric and magnetic field distributions on the signal line driven by a switching transistor are calculated or measured. These calculated and measured results show good agreement. The electric and magnetic field noises at typical impedance conditions modeled for the switching condition, i.e., the ON or OFF state of the transistor, are estimated by the FDTD calculation. The variation of the radiation noise when the switching transistor is turned ON or OFF is large at 216 MHz, whose input impedance of the signal line is small. It is speculated that the noise radiation at the 10 Ω signal source impedance condition that is modeled for the ON condition shows good agreement with the noise distributions at the driving condition.

As a new material, silver (Ag) coated fabric has been developed, and its use for shielding electromagnetic radiation is expected. In this paper, seven kinds of Ag coated fabrics, woven, knitted and nonwoven by Ag coated fibers, are prepared, and placed over a PCB with a microstrip line, which is used as a noise source. By measuring the input impedance of the microstrip line, the distance between the PCB and the fabric is fixed to 8 mm to reduce the coupling paths. The shielding effect SE of those fabrics was compared by measuring the magnetic near-field with a small shielded-loop probe. In the results, the resonance frequency is dependent on the fabric's length, as well as the case of a copper sheet. Comparing the texture, the SE of woven and nonwoven fabrics is larger than the knitted fabric. Comparing with the copper sheet, the SE of the fabrics is smaller below 200 MHz, but elsewhere is almost the same.

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We generate maximal-period sequences with negative auto-correlations based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm to find such maximal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for practical CDMA applications. We also report that maximal-period sequences can outperform conventional Gold sequences in terms of bit error rate (BER) in asynchronous DS-CDMA systems.

Takine investigated the continuous time queueing system with single server and Markovian arrival streams (MAS) where service times of customers depend on the states of the underlying Markov chain immediately before and after arrivals and may differ from one another among streams. In this paper, we consider the discrete version of Takine's model. Since a MAS can be used to model the correlated traffics of several classes, we consider the discrete time queueing system with MAS as an input traffic. Moreover packets from different classes of traffic may require different service times. So service times of customers which are different from one another among streams and may depend on the states of the underlying Markov chain immediately before and after arrivals, are also considered. We obtain the distribution of the workload in the system using Neuts' matrix analytic method. Based on this result, we obtain the distributions of the actual waiting time and the sojourn time of a customer of each class and the joint distribution of the numbers of customers of each class. We also provide a recursion formula for computing the joint queue length distribution. We give an application to multimedia conference system and numerical example.

Optical Burst Switching (OBS) is one of the most important switching technologies in future optical Internet. One of critical design issues in OBS is how to reduce burst dropping resulting from resource contention. Especially when traffic load is high, there should be frequent deflection routing as well as more contentions in an optical burst-switched network. The burst loss performance can be improved by implementing a proper deflection routing scheme. In this paper, we propose a limited deflection routing scheme to prevent injudicious deflection routing. The proposed scheme reduces unnecessary contentions resulting from deflection routing itself, increasing the utilization of network resource such as channels. Simulation tests were performed to evaluate the performance of the proposed scheme.

We discuss applications of quantum computation to geometric data processing. Especially, we give efficient algorithms for intersection problems and proximity problems. Our algorithms are based on Brassard et al. 's amplitude amplification method, and analogous to Buhrman et al. 's algorithm for element distinctness. Revealing these applications is useful for classifying geometric problems, and also emphasizing potential usefulness of quantum computation in geometric data processing. Thus, the results will promote research and development of quantum computers and algorithms.

The main contribution of this paper is to present an FPGA-based implementation of an instance-specific hardware which accelerates the CKY (Cocke-Kasami-Younger) parsing for context-free grammars. Given a context-free grammar G and a string x, the CKY parsing determines whether G derives x. We have developed a hardware generator that creates a Verilog HDL source to perform the CKY parsing for any given context-free grammar G. The generated source is embedded in an FPGA using the design software provided by the FPGA vendor. We evaluated the instance-specific hardware, generated by our hardware generator, using a timing analyzer and tested it using the Altera FPGAs. The generated hardware attains a speed-up factor of approximately 750 over the software CKY parsing algorithm.

Counting the number of points of Jacobian varieties of hyperelliptic curves over finite fields is necessary for construction of hyperelliptic curve cryptosystems. Recently Gaudry and Harley proposed a practical scheme for point counting of hyperelliptic curves. Their scheme consists of two parts: firstly to compute the residue modulo a positive integer m of the order of a given Jacobian variety, and then search for the order by a square-root algorithm. In particular, the parallelized Pollard's lambda-method was used as the square-root algorithm, which took 50CPU days to compute an order of 127 bits. This paper shows a new variation of the baby step giant step algorithm to improve the square-root algorithm part in the Gaudry-Harley scheme. With knowledge of the residue modulo m of the characteristic polynomial of the Frobenius endomorphism of a Jacobian variety, the proposed algorithm provides a speed up by a factor m, instead of in square-root algorithms. Moreover, implementation results of the proposed algorithm is presented including a 135-bit prime order computed about 15 hours on Alpha 21264/667 MHz and a 160-bit order.

The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.