Kwang-Hyun SHIM Ji-Myong NHO Jong-Tae LIM
In this paper, we present a priority scheduling algorithm at ATM switches with multi-class output buffers in which the service rate of each class buffer is dynamically adjusted. The service rate is computed periodically by a control scheme. We derive the design formulas of the control scheme to ensure that each class buffer occupancy converges to its desired operating point related to QoS requirement. Moreover, through dynamic service rate control in the proposed scheduling algorithm, the available channel capacity can be estimated exactly. It may be used for rate control of ABR traffic and call admission control of the other real-time traffic (CBR, VBR, etc. ).
We propose a new method of progressive transmission of continuous tone images using multi-level error diffusion method. Assuming that the pixels are ordered and the error is diffused to later pixels, multi-level error-diffused images are resolved into a multiple number of bit planes. In an image with 8 bits per pixel, the number of the bit planes that we construct is 9, and the 2-level, 3-level, 5-level,, error-diffused images are produced by a successive use of the bit planes. The original image is finally achieved precisely.
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.
Shigeru ICHINOSE Mizuho IWAIHARA Hiroto YASUURA
Providing various assistances for design modifications on HDL source codes is important for design reuse and quick design cycle in VLSI CAD. Program slicing is a software-engineering technique for analyzing, abstracting, and transforming programs. We show algorithms for extracting/removing behaviors of specified signals in VHDL descriptions. We also describe a VHDL slicing system and show experimental results of efficiently extracting components from VHDL descriptions.
Hiroyuki TOMIYAMA Tohru ISHIHARA Akihiko INOUE Hiroto YASUURA
In many embedded systems, a significant amount of power is consumed for off-chip driving because off-chip capacitances are much larger than on-chip capacitances. This paper proposes instruction scheduling techniques to reduce power consumed for off-chip driving. The techniques minimize the switching activity of a data bus between an on-chip cache and a main memory when instruction cache misses occur. The scheduling problem is formulated and two scheduling algorithms are presented. Experimental results demonstrate the effectiveness and the efficiency of the proposed algorithms.
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.
Toshihiko SHIBAZAKI Teruhiro KINOSHITA
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.
Atsushi SANADA Minoru SANAGI Shigeji NOGI Kuniyoshi YAMANE
Full-wave FD-TD analysis has been carried out for coaxial probes inserted into waveguides. Both single and symmetrically placed paired coaxial probe structures have been discussed and we have revealed the relation between equivalent circuit parameters and structural parameters of the coaxial probes including cases for large diameter and extension length, which is useful for practical waveguide circuit design. The equivalent circuit parameters calculated from the scattering parameters agreed well with corresponding measured data. From the calculated field in a waveguide, field concentration at sharp edges of probe sole or base, which ought to be taken into account for high power application design has been also discussed. Besides, amplitudes of higher order modes in waveguides excited by coaxial probes or pairs of coaxial probes has been calculated so as to estimate the range beyond which higher order modes decay sufficiently. This estimation is necessary for simple and easy design of probe using circuit theory.
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.
Kazunori MATSUMOTO Kazuo HASHIMOTO
Call tracking data contains a calling address, called address, service type, and other useful attributes to predict a customer's calling activity. Call tracking data is becoming a target of data mining for telecommunication carriers. Conventional data-mining programs control the number of association rules found with two types of thresholds (minimum confidence and minimum support), however, often they generate too many association rules because of the wide variety of patterns found in call tracking data. This paper proposes a new method to reduce the number of generated rules. The method proposed tests each generated rule based on Akaike Information Criteria (AIC) without using conventional thresholds. Experiments with artificial call tracking data show the high performance of the proposed method.
Nozomu TOGAWA Takafumi HISAKI Masao YANAGISAWA Tatsuo OHTSUKI
This paper proposes a high-level synthesis system for datapath design of digital processing hardwares. The system consists of four phases: (1) DFG (data-flow graph) generation, (2) scheduling, (3) resource binding, and (4) HDL (hardware description language) generation. In (1), the system does not generate only one best DFG representing a given behavioral description of a hardware, but more than one good DFGs representing it. In (2) and (3), several synthesis tools can be incorporated into the system depending on the required objectives. Thus we can obtain more than one datapath candidates for a behavioral description with their area and performance evaluation. In (4), the best datapath design is selected among those candidates and its hardware description is generated. The experimental results for applying the system to several benchmarks show the effectiveness and efficiency.
Yasuhiro NISHIOKA Osamu MAESHIMA Toru UNO Saburo ADACHI
In this paper, the surface impedance boundary condition (SIBC) for a dispersive lossy medium backed by a perfect conductor is implemented in computation of electromagnetic (EM) scattering using the finite difference time domain (FDTD) method. The dispersion of the surface impedance is incorporated into FDTD update equations by using the piecewise linear recursive convolution (PLRC) approach. The validity of the proposed method is confirmed numerically.
Sungwon LEE Young-Jae SONG Dong-Ho CHO Yong-Bae DHONG Jung-Won YANG
In this paper, we propose and evaluate the performance of Wireless ATM MAC layer protocol to support efficiently various ATM traffics, such as CBR, VBR, ABR and UBR, in wireless ATM network environments for reverse and forward link. The proposed MAC protocol could extend efficiently the service discipline of ATM traffics from wired network to wireless ATM network environments. Thus, available bandwidth, which is remained except the bandwidth for CBR and VBR traffics, could be effectively allocated to ABR and UBR traffics. Especially, in view of reverse link, two-phase scheduling algorithm supports successfully variable characteristics of VBR traffic. And, in view of forward link, 'Wireless Dynamic Weighted Earliest Deadline First' scheduling algorithm minimizes the mean cell delay and required buffer size. Simulation results show that proposed method provides effective performance in wireless ATM environments.
The recently proposed modified PML (MPML) absorbing boundary condition is extended to three dimensions. The performance of the MPML is investigated by FDTD simulation of a typical microstrip line and a rectangular waveguide. The dominant and higher order modes of the microstrip line and the waveguide are excited separately in the computation. In all of the cases of excitation, the reflection properties of the MPML boundaries are examined for the side walls and the end walls, respectively. Various values of the permittivity and permeability of the MPML medium are tested in the computation, and the variation behavior of reflection from the MPML boundaries is examined. The numerical results reveal that by choosing appropriate values of the permittivity and permeability of the MPML, we can realize efficient absorption of both evanescent waves and propagating waves over a wide frequency band.
Dingchao LI Yuji IWAHORI Tatsuya HAYASHI Naohiro ISHII
Reducing communication overhead is a key goal of program optimization for current scalable multiprocessors. A well-known approach to achieving this is to map tasks (indivisible units of computation) to processors so that communication and computation overlap as much as possible. In an earlier work, we developed a look-ahead scheduling heuristic for efficiently reducing communication overhead with the aim of decreasing the completion time of a given parallel program. In this paper, we report on an extension of the algorithm, which fills in the idle time slots created by interprocessor communication without increasing the algorithm's time complexity. The results of experiments emphasize the importance of optimally filling idle time slots in processors.
Shigehiro ANO Toru HASEGAWA Toshihiko KATO Kenji NARITA Kanji HOKAMURA
In ATM Network, the VBR (Variable Bit Rate) service category is used to accommodate TCP/IP traffic. In an international ATM network with large propagation delay, higher TCP throughput can be obtained by use of window scale option. In order to accommodate TCP traffic with window scale option effectively, it is required to select appropriate values of VBR parameters, i. e. SCR (Sustainable Cell Rate) and MBS (Maximum Burst Size), and to evaluate the impact of UPC (Usage Parameter Control) function on TCP throughput. We have studied those technical issues for the conventional TCP, but the results cannot be applied to TCP traffic with the window scale option due to the TCP terminal performance and the large window size. In this paper, we proposed VBR parameter determination method for TCP with the window scale option and evaluated the values in each condition. These results show that the determined MBS is much smaller than the burst length of TCP segments especially using low performance TCP terminals. Furthermore, we also discuss some experimental results of TCP throughput degradation due to UPC function. It shows that the throughput of TCP with large window size is degraded when the SCR and MBS values used in ATM switch are smaller than the determined values.
The fact that bounded interval band orthonormal scaling function shows oversampling property is demonstrated. The truncation error is estimated when scaling function with oversampling property is used to recover signals from their discrete samples.
An enhanced priority reservation algorithm for ATM multicast switches with a one-shot scheduling scheme is proposed. This algorithm is an input reservation method in which priority is selected among input ports considering the number of rejected copy requests and the blocked age of head-of-line (HOL) cells. The operation procedure of the proposed algorithm is described, and the average cell-delay and throughput performance is evaluated by simulation. The simulation results show that the proposed algorithm yields better performance than the conventional algorithms.
Akihiro HORIBE Masahiro BABA Eisuke NIHEI Yasuhiro KOIKE
We have proposed a highly scattering optical transmission (HSOT) polymer for use as a high efficiency light source medium. This polymer contains specified internal microscopic heterogeneous structures for controlling light-transmission properties. An LCD backlighting system having a new light pipe made of this polymer has twice the brightness of the conventional one. A light scattering phenomenon inside the HSOT polymer was quantitatively analyzed by a ray tracing simulation based on the Mie scattering theory and the Monte Carlo method. The illumination of the backlight which is optimized by using the simulation program has enough uniformity of intensity and color because of specified multiple light scattering phenomena inside the HSOT polymer. We propose the new backlighting system having fewer components and twice efficiency of the conventional one.
Kazushi MIMURA Masato OKADA Koji KURATA
An associative memory model with a forgetting process a la Mezard et al. is investigated for a piecewise nonmonotonic output function by the SCSNA proposed by Shiino and Fukai. Similar to the formal monotonic two-state model analyzed by Mezard et al. , the discussed nonmonotonic model is also free from a catastrophic deterioration of memory due to overloading. We theoretically obtain a relationship between the storage capacity and the forgetting rate, and find that there is an optimal value of forgetting rate, at which the storage capacity is maximized for the given nonmonotonicity. The maximal storage capacity and capacity ratio (a ratio of the storage capacity for the conventional correlation learning rule to the maximal storage capacity) increase with nonmonotonicity, whereas the optimal forgetting rate decreases with nonmonotonicity.