This paper presents scattering characteristics of a TE electromagnetic plane wave by a photo-induced plasma strip grating in a semiconductor slab at millimeter wave frequencies. The characteristics are analyzed by using the moment method and estimated numerically over a frequency band from 30-50 GHz. It is shown that the resonance anomaly in the grating can be controlled by changing not only the periodic light illumination pattern but also the plasma density.

For transmission of video signals, it is important that the system allows a certain degree of flexibility in bit rate as well as quality, depending upon the requirements of media and channel conditions. In this paper, we discuss the hierarchical transmission of Huffman code using multi-code/multi-rate DS/SS system to realize flexible transmission. We first discuss and show that the structure of Huffman code tree directly expresses hierarchical structure, and that parallel transmission of Huffman code can achieve hierarchical transmission. By assigning different transmission data rate to the bits in each stratum, it is possible to transmit different amount of information from each stratum. Further, we show the quality of each of the stratum can easily controlled by an appropriate power distribution to each parallel transmission branch.

The problem of electromagnetic scattering caused by inductive discontinuities locate in parallel-plate waveguides, in particular when dealing with discontinuous conductors of finite thickness, is analyzed using the modified residue-calculus method, the equations suitable for a numerical calculation are derived. The incident wave is taken to be the dominant mode, and the reflection and transmission properties of a symmetrical inductive iris are discussed.

A simple and efficient adaptive mesh generation for the approximate scalar analysis of optical waveguides is proposed. Two types of local weight estimates which can take into account both a field amplitude and its variation on a problem domain are introduced. One is a difference between linear and quadratic element solutions and the other is a residual for the partial differential equation to be solved. To show the validity and usefulness of the present scheme, the guided-mode analysis of a rib waveguide and the beam propagation analysis of a tilted slab waveguide and a Y-branching rib waveguide are performed.

In this paper, we analyze the inverse scattering problem by a new deterministic method called "Source and Radiation Field Solution," which has the merit that both the source and the radiation field can be treated at the same time, the effect of which has already shown in ordinary scattering problems.

Major problems of traffic control in ATM networks include how to decide whether a network accepts a new call or not in real time and how to select the best set of Dual Leaky Bucket (DLB) parameter values. To solve these problems, it is necessary to determine the amount of network bandwidth required by the call. In this paper, we present an analysis based on bounding technique to derive an upper bound on bandwidth requirement when the call is characterized by a set of DLB parameters. Consequently, a new definition of the upper bound on bandwidth requirement and simple formulae used for computing the upper bound have been obtained. To clarify the advantages of the derived upper bound, we demonstrate its two applications, one to select the best set of DLB parameter values from candidates for minimizing the amount of bandwidth to be allocated to the call and the other to establish a Connection Admission Control (CAC) scheme. The upper bound-based CAC scheme is fast enough to process in real time due to its simplicity and provides a significant improvement of network utilization compared to the peak rate-based CAC scheme.

A method of visualization of multimodal images by one monochromatic image is presented on the basis of the projection pursuit approach of the inverse process of the anisotropic diffusion which is a method of image restoration enhancing contrasts at edges. The extension of the projection from a linear one to nonlinear sigmoidal functions enhances the contrast further. The deterministic annealing technique is also incorporated into the optimization process for improving the contrast enhancement ability of the projection. An application of this method to a pair of MRI images of brains reveals its promising performance of superior visualization of tissues.

This paper implements some new techniques to analyze the light beam scattering from a magneto-optical (MO) disk using the three-dimensional finite-difference time-domain (FDTD) method. The anisotropic FDTD update equations are implemented to calculate the propagation of a coherent monochromatic light in the MO material. An anisotropic absorbing boundary condition based on Berenger's perfectly matched layer (PML) concept is also developed. The Gaussian incident light beam is introduced into FDTD computation region exactly by using equivalent electric and magnetic currents. The scattering pattern of light beam from the MO disk is computed and in part compared with that obtained by using the boundary element method. The scattering patterns by the circular recording bit of different radius are calculated to indicate the optimum radius of the recording bit.

With the introduction of ATM technology, service providers around the world have actively engaged in offering high bandwidth services. Currently, services, such as T1/E1, T3/E3 circuit emulation, are made available to large-volume account users. However, more advanced services, such as multimedia applications, have demanded not just high bandwidth but also flexible rate adaptation with quality-of-service (QoS) guarantee. To support the above service requirements, sophisticated network planning and engineering procedures should be taken. In the past few years, we have conducted various researches on developing the engineering strategies for resource control and management to support multi-rate service offering. We have also looked into the design details of connection control and management for achieving the QoS requirement. We considered the service quality of the underlying transport in regard with the QoS management. In this paper, we will outline those results and give an overview description about the proposed framework.

This paper proposes a method to reduce the context switching time using a register bank to store contexts of working tasks. Hardware cost and performance were measured by modeling the register bank and controller in VHDL. Following results were obtained: (1) The controller can be implemented with a much smaller amount of hardware cost compared to that of the register bank, which is realized by SRAM module. (2) Context switching time can be reduced to less than 50% compared to that by software implementation. (3) Combination of the proposed architecture with our previous work (RTOS implemented in HW) gives us much higher performance of a hard real-time system.

In this paper we present two traffic control approaches, a circuit emulation traffic control (CETC) and an adaptive priority traffic control (APTC) for supporting voice services in ATM networks. Most voice services can be handled as CBR traffic, this causes a lot of wasted bandwidth. Sending voice through VBR (variable bit rate) may be a better alternative, because it allows the network to allocate voice bandwidth on demand. In CETC, the service discipline guarantees the quality of service (QOS) for voice circuits. Through mathematical analysis, we show that CETC features an adequate performance in delay-jitter. Moreover, it is feasible in implementation. We also present an APTC approach which uses a dynamic buffer allocation scheme to adjust the buffer size based on the real traffic need, as well as employs an adaptive priority queuing technique to handle various delay requirements for VBR voice traffic. It provides an adequate QOS for voice circuits in addition to improving the multiplexing gain. Simulation results show that voice traffic get satisfied delay performance using our approaches. It may fulfill the emerging needs of voice service over ATM networks.

A fractal image coding scheme using classified range regions is proposed. Two classes of range regions, shade and nonshade, are defined here, A shade range region is encoded by the average gray level, while a nonshade range region is encoded by IFS parameters. To obtain classified range regions, the two-stage block merging scheme is proposed. Each range region is produced by merging primitive square blocks. Shade range regions are obtained at the first stage, and from the rest of primitive blocks nonshade range regions are obtained at the second stage. Furthermore, for increasing the variety of region shape, the 8-directional block merging scheme is defined by extension of the 4-directional scheme. Also, two similar schemes for encoding region shapes, each corresponding to the 4-directional block merging scheme and the 8-directional block merging scheme, are proposed. From the results of simulation by using a test image, it was demonstrated that the variety of region shape allows large shade range regions to be extracted efficiently, and these large shade range regions are more effective in reduction of total amount of codebits with less increase of degradation of reconstructed image quality than large nonshade range regions. The 8-directional merging and coding scheme and the 4-directional scheme reveal almost the same coding performance, which is improved than that of the quad-tree partitioning scheme. Also, these two schemes achieve almost the same reconstructed image quality.

This paper explores virtual destination (VD)/virtual source (VS)-based available bit rate (ABR) flow control performance, targeting wireless asynchronous transfer mode (WATM) application that can incur long link-delays because of employing radio-medium sharing and/or radio-specific data link control schemes. As this paper reveals, the conventional VD/VS scheme has difficulty in sustaining satisfactory ABR performance, when it is applied to long-delay-causing WATM; it suffers from significant increase in the necessary buffer capacity. To ensure the ABR performance in WATM, this paper proposes a new VD/VS coupling scheme using a feed-forward congestion indication. The proposed scheme controls the allowed cell rate of a source end system in a feed-forward manner by predicting the queue length at the time the WATM-associated-round-trip ahead. Simulation results show that the proposed scheme exhibits excellent ABR performance with a long delay of the divided loop on the radio-link side. It is also verified that the proposed scheme is rather robust against uncertainty and/or time-variation regarding the predetermined radio link delay.

This paper proposes a new wireless multimedia communication system based on hierarchical modulation, which gives unequal transmission reliability corresponding to the sensitivity to the transmission errors. In order to achieve high quality multimedia communication in a band-limited and time-variant fading channel, the proposed scheme changes the modulation scheme according to the contents of information. Numerical analysis shows that the proposed system is an effective high-quality and high-speed multimedia transmission technique in fading channel.

This paper presents a new efficient method for finding an "optimal" bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = α(g1(X1), g2(X2)). We call a bi-decomposition form optimal when the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. This meaning of optimal is adequate especially for the synthesis of LUT (Look-Up Table) networks where the number of function inputs is important for the implementation. In our method, we consider only two bi-decomposition forms; (g1 g2) and (g1 g2). We can easily find all the other types of bi-decomposition forms from the above two decomposition forms. Our method efficiently finds one of the existing optimal bi-decomposition forms based on a branch-and-bound algorithm. Moreover, our method can also decompose incompletely specified functions. Experimental results show that we can construct better networks by using optimal bi-decompositions than by using conventional decompositions.

This paper proposes two types of acceleration parameters for the Durand-Kerner method and its variant, where the values of parameters are determined at each iteration step. Numerical examples are also shown.

In this paper, we consider the applicability of turbo code for future third generation (3G) mobile telecommunication systems. Futhermore, we propose a simple method of estimating the channel variance which is necessary for the MAP (Maximum A Posteriori) decoding algorithm. We compare the performance of turbo code with a known channel variance, conventional variance estimate and variance estimated by our proposed technique. We show that our variance estimation scheme is adequate for 3G WB-CDMA mobile systems without degradation of turbo code performance.

In this paper we have introduced a new method for signature pattern recognition, taking advantage of some image moment transformations combined with fuzzy logic approach. For this purpose first we tried to model the noise embedded in signature patterns inherently and separate it from environmental effects. Based on the first step results, we have performed a mapping into the unit circle using the error least mean square (LMS) error criterion, to get ride of the variations caused by shifting or scaling. Then we derived some orientation invariant moments introduced in former reports and studied their statistical properties in our special input space. Later we defined a fuzzy complex space and also a fuzzy complex similarity measure in this space and constructed a new training algorithm based on fuzzy learning vector quantization (FLVQ) method. A comparison method has also been proposed so that any input pattern could be compared to the learned prototypes through the pre-defined fuzzy similarity measure. Each set of the above image moments were used by the fuzzy classifier separately and the mis-classifications were detected as a measure of error magnitude. The efficiency of the proposed FLVQ model has been numerically shown compared to the conventional FLVQs reported so far. Finally some satisfactory results are derived and also a comparison is made between the above considered image transformations.

Voice activity detection (VAD) is to determine whether a short time speech frame is voice or silence. VAD is useful in reducing the mean speech coding rate by suppressing transmission during silence periods, and is effective in transmitting speech and other data simultaneously. This letter describes a VAD system that uses a neural network. The neural network gets several parameters by analyzing slices of the speech wave form, and outputs only one scalar value related to voice activity. This output is compared to a threshold to determine whether the slice is voice or silence. The mean code transfer rate can be reduced to less than 50% by using the proposed VAD system.

This paper describes a method to represent m output functions using shared multi-terminal binary decision diagrams (SMTBDDs). The SMTBDD(k) consists of multi-terminal binary decision diagrams (MTBDDs), where each MTBDD represents k output functions. An SMTBDD(k) is the generalization of shared binary decision diagrams (SBDDs) and MTBDDs: for k=1, it is an SBDD, and for k=m, it is an MTBDD. The size of a BDD is the total number of nodes. The features of SMTBDD(k)s are: 1) they are often smaller than SBDDs or MTBDDs; and 2) they evaluate k outputs simultaneously. We also propose an algorithm for grouping output functions to reduce the size of SMTBDD(k)s. Experimental results show the compactness of SMTBDD(k)s. An SMTBDDmin denotes the smaller SMTBDD which is either an SMTBDD(2) or an SMTBDD(3) with fewer nodes. The average relative sizes for SBDDs, MTBDDs, and SMTBDDs are 1. 00, 152. 73, and 0. 80, respectively.