A new polarization splitter at optical frequencies is proposed. The basic structure of the device is a tapered velocity coupler which is composed of a straight and a dimensionally tapered slab waveguide on a LiNbO3 substrate. The numerical results obtained with the finite difference method indicate that extinction ratios of polarization less than 2% for both TE and TM modes are possible of realization under moderate control voltages and that the splitting characteristics are stable over a wide range of frequencies.

By addressing design requirements for multicast ATM switching, this paper attempts to provide an integrated view of modular and expandable switch architectures suitable for both unicast and multicast switching for future B-ISDNs. Several large and modular multicast ATM switching architectures are discussed, each of which handles different traffic situations. These architectures consist of multiple shared-buffer copy network modules of adequate size suitable for fabrication on a single chip, and small output memory switch modules. A new modular link-grouped multistage interconnection network is proposed for interconnecting copy network modules and memory switch modules, so that future large multicast ATM switching networks can be built in a modular fashion. The described modular architectures can significantly facilitate signal synchronization in large-scale switching networks.

A new type of variable beam splitter at optical frequencies is proposed. The basic structure of the device utilizes a tapered velocity coupler which is composed of a center slab waveguide of constant-thickness, constant-index type and two identical outer slab waveguides of constant-thickness, variable-index type. The coupler is assumed to be fabricated on a LiNbO3 substrate, whith an external electric field applied in parallel with the optical axis. The numerical results obtained with the finite difference method show that a wide range of splitting ratios can be obtained with moderate drive voltages and that the splitting characteristics are stable over a wide range of frequencies.

We describe the characteristics of scattering and diffraction of plane E-waves by a lossy dielectric elliptic cylinder. The computational programs for calculating the analytic solutions for the diffraction of a lossy dielectric elliptic cylinder can be achieved. From the calculated results of the backscattering cross section (BSCS) (usually the radar cross section: RCS) and the forward-scattering cross section (FSCS) due to the cross-sectional shape and complex dielectric constant of the elliptic cylinder, the features of the BSCS and FSCS can be clarified as follows. (1) There is a cross-sectional shape of the cylinder which results in a minimum BSCS with a complex dielectric constant of the cylinder. (2) The BSCS and FSCS of the lossy dielectric scatterer approach zero as the scatterer approaches a strip. This result means that no material composing such a strip exists, and the features are very different from those in a perfectly conducting strip. (3) The influence of conductivity, σ, of the cylinder on a scattered wave is small for the relative dielectric constant of εr6. (4) The total scattering cross section of the lossy dielectric elliptic cylinder which causes the minimum BSCS is not small. Hence, it may be considered that the minimum BSCS is determined mainly by interference based on the cross-sectional shape and complex dielectric constant of cylinder, and is not caused by incident wave absorption due to the lossy dielectric.

This paper proposes a new class of unidirectional byte error locating codes, called single symmetric bit error correcting and single unidirectional byte error locating codes, or SEC–SUbEL codes. Here, "byte" denotes a cluster of b bits, where b2. First, the necessary and sufficient conditions of the codes are clarified, and then code construction method is demonstrated. The lower bound on check bit length of the SEC–SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient in some range of the information length. The code design concept presented for the SEC–SUbEL codes induces the generalized unidirectional byte error locating codes with single symmetric bit error correction capability.

There has been an increasing demand for telecommunication services that satisfy individual users' requirements such as personal telecommunication services and intelligent network services. This demand for advanced telecommunications services is having a great impact on the control architecture and mechanism. In this paper, we propose a new representation of processing power for telecommunications services, using TPS (Transaction Per Second), instead of BHCA, which has been the most commonly used parameter for conventional telephone networks. In developing an IN benchmark, telecommunications services are compared with the TPC-A (Transaction Processing Performance Council-A) benchmark model based on TPS. This benchmark is then used to estimate the requirements for processing power, which, in turn, indicate the necessity for a distributed control. A layered architecture, compatible architecture, and control mechanism for user services are employed to adapt to the distributed network environment.

An unsupervised segmentation technique is presented that is based on a layered statistical model for both region shapes and the region internal texture signals. While the image partition is modelled as a sample of a Gibbs/Markov random field, the texture inside each image segment is described using functional approximation. The segmentation and the unknown parameters are estimated through iterative optimization of an MAP objective function. The obtained tesults are subjectively agreeable and well suited for the requirements of region-oriented transform image coding.

A novel nonlinear directional coupler consisting of tapered and uniform waveguides with self-focusing or self-defocusing nonlinear material is proposed to improve all-optical switching characteristics. Its switching characteristics are analyzed by using a beam propagation method based on the Galerkin's finite element technique (FE-BPM), in which nonuniform sampling spacings along the transverse coordinate are adopted. It is presented that the tapered nonlinear directional coupler shows fairly distinct 'high' and 'low' states of output power with steep transition versus input power. This property is discussed in comparison with conventional nonlinear directional couplers consisting of uniform symmetric and uniform asymmetric coupled waveguides. In addition, the effects of loss on the characteristics of tapered nonlinear directional coupler are examined.

The classical supervised learning algorithms for optimizing multi-layered feedforward neural networks, such at the original back-propagation algorithm, suffer from several weaknesses. First, they have the possibility of being trapped at local minima during learning, which may lead to failure in finding the global optimal solution. Second, the convergence rate is typically too slow even if the learning can be achieved. This paper introduces a new learning algorithm which employs a genetic-type search during the learning phase of back-propagation algorithm so that the above problems can be overcome. The basic idea is to evolve the network weights in a controlled manner so as to jump to the regions of smaller mean squared error whenever the back-propagation stops at a local minimum. By this, the local minima can always be escaped and a much faster learning with global optimal solution can be achieved. A mathematical framework on the weight evolution of the new algorithm in also presented in this paper, which gives a careful analysis on the requirements of weight evolution (or perturbation) during learning in order to achieve a better error performance in the weights between different hidden layers. Simulation results on three typical problems including XOR, 3-bit parity and the counting problem are described to illustrate the fast learning behaviour and the global search capability of the new algorithm in improving the performance of back-propagated network.

The byte error locating codes specify the byte location in which errors are occurred without indicating the precise location of erroneous bit positions. This type of codes is considered to be useful for fault isolation and reconfiguration in the fault-tolerant computer systems. In this paper, difference between the code function of error-location and that of error-correction/error-detection is clarified. With using the concepts of unidirectional byte distance, unordered byte number and ordered byte number, the necessary and sufficient conditions of the unidirectional byte error locating codes are demonstrated.

This papter proposes a new type of unidirectional error control codes which indicates the location of unidirectional errors clustered in b-bit length, i.e., unidirectional byte error in b (b2) bits. Single unidirectional b-bit byte error locating codes, called SUbEL codes, are first clarified using necessary and sufficient conditions, and then code construction algorithm is demonstrated. The lower bound on check bit length of the SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient. Using the code design concept presented for the SUbEL codes, it is demonstrated that generalized unidirectional byte error locating codes are easily constructed.

Stored channel simulation for mobile radio channel can be the common base of the development of future world wide personal radio communication systems, especially for high bit-rate digital system. This paper proposes a mobile radio channel database which is suitable for the laboratory channel simulation using a simple stored channel simulator, also proposed by the author. The database enables the establishment of a mobile radio channel database containing worldwide channel data in a few discs of compact disc.

A 250-MIPS, 125-MFLOPS peak performance processing element (PE), which is being developed for an on-chip multiprocessor, has been modeled and evaluated. The PE includes the following new architecture components: an FPU shared by several IUs in order to increase the efficiency of the FPU pipelines, an on-chip data cache with a prefetch mechanism to reduce clock cycles waiting for memory, and an interface to high speed DRAM, such as Rambus DRAM and Synchronous DRAM. As a result, a PE model with an FPU shared by four or eight IUs causes only 10% performance reduction compared to a model with an un-shared FPU model while saving the cost of three FPUs. Furthermore, a PE model with prefetch operates 1.2 to 1.8 times faster than a model without prefetch at 250-MHz clock rate when the Rambus DRAM is connected. It becomes clear that this PE architecture can bring a high effective performance at over 250-MHz, and is cost-effective for the on-chip multiprocessor.

In this paper, radio propagation in the medium-scale building is investigated at 2.5GHz band. In order to predict the propagation loss in any place, four major modes of propagation are considered: low-loss in line-of-sight (LOS) wave, corridor guided wave, direct transmission wave through obstructions, and the reentered wave. Based on the measured results of attenuation characteristics, the macroscopic parameters for the above mentioned modes of wave propagation are determined. Using these parameters, signal strengths are predicted with average standard deviation of 4.5dB. The fading characteristics are studied by measuring the Rician parameter and the correlation coefficient for 2-branch diversity antennas separated by 50cm. The Rician parameters are 2 in case of the LOS propagation, and 1 in case of the no LOS propagation. The two branch correlation coefficients are less than 0.5 within coverage of 80-95% in almost all the locations.

Electromagnetic power absorption in multilayered tissue media including anisotropic muscle regions whose principal dielectric axes (that is, muscle fibers) have various directions are analyzed by using 44 matrix method. Numerical calculations in 10kHz-10MHz show the effects of orientation of muscle fibers and polarization of incident wave on absorbed power density in tissues.

A new design methodology is proposed and analyzed for the design of ternary logic systems. In the new ternary logic systems, no conversions among radices are required and only the two-state ternary literals associated with the ternary signals are transmitted in the whole system. With the new design methodology, the ternary systems can be realized by the dynamic CMOS logic circuits which are simple and fully compatible with those of the conventional binary logic circuits in process, power supply, and logic levels. A new dynamic differential logic called the CMOS Redundant Differential Logic (CRDL) is also developed to increase the logic flexibility and the circuit performance. Using the new design methodology and the CRDL circuits, the multiplier with redundant binary addition tree is designed in both non-pipelined and pipelined systems. The experimental chip has been fabricated and measured, which successfully verifies the correctness of the logic functions and the speed performance of the designed circuits.

Antenna selection diversity is an effective method to achieve both better transmission performance and compact circuit implementation in TDMA portable radio communications. However, diversity performance in fast fading environments is insufficient. This paper proposes a novel predictive antenna selection diversity scheme, PASD, which improves the diversity performance for higher fading rates. In PASD, received signal power for the assigned data slot is predicted from previously measured data. Thus, selection errors due to the receiving power changes caused by fast Rayleigh fading can be effectively avoided. An experimental result for a 3-ch TDMA system with a frame duration of 20ms shows that the diversity gain was increased by 1.3dB over the conventional method for a fading rate of 40Hz. PASD is also shown to have improved diversity performance against cochannel interference.

Many metrics between trees have been proposed. However, there is no research on a graph metric that can be applied to molecular graphs. And most of the reports on tree metrics have dealt with rooted and ordered trees. As the first step defining a graph metric for molecular graphs, this paper proposes a tree metric between unrooted and unordered trees. This metric is based on a mapping between trees that determines a transformation from one tree to another. The metric is the minimum weight among the weights of all possible transformations. The characteristics of the mapping are investigated. A top-down computing method is proposed using the characteristics of the mapping. The time and space complexities are OT(N 2aN 2b(N 3aN 3b)) and Os(N 2aN 2b), respectively, where Na and Nb are the numbers of vertices of the two trees. If the degrees of all vertices of the trees are bounded by a constant, the time complexity of the method is O (N 3aN 3b). The computing time to obtain the distance between a pair of molecular graphs using a computer (SUN SparcStation ELC) is 0.51 seconds on average for all the pairs of 111 molecular graphs that have 12.0 atoms on average. This methic can be applied to the clustering of molecular graphs.

Reduction of the complexity of the NLMS algorithm has received attention in the area of adaptive filtering. A processing cost reduction method, in which the component of the weight vector is updated when the absolute value of the sample is greater than or equal to the average of the absolute values of the input samples, has been proposed. The convergence analysis of the processing cost reduction method has been derived from a low-pass filter expression. However, in this analysis the effect of the weignt vector components whose adaptations are skipped is not considered in terms of the direction of the gradient estimation vector. In this paper, we use an arbitrary value instead of the average of the absolute values of the input samples as a threshold level, and we derive the convergence characteristics of the processing cost reduction method with arbitrary threshold level for zero-mean white Gaussian samples. From the analytical results, it is shown that the range of the gain constant to insure convergence and the misadjustment are independent of the threshold level. Moreover, it is shown that the convergence rate is a function of the threshold level as well as the gain constant. When the gain constant is small, the processing cost is reduced by using a large threshold level without a large degradation of the convergence rate.

This report describes 4-2 compressors composed of Complementary Pass-Transistor Logic (CPL). We will show that circuit designs of the 4-2 compressors can be optimized for high speed and small size using only exclusive-OR's and multiplexers. According to a circuit simulation with 0.8µm CMOS device parameters, the maximum propagation delay and the average power consumption per unit adder are 1.32 ns and 11.6 pJ, respectively.