Hiromi KOBAYASHI Yasunari SHIDAMA
The usage of a diagram, which we call a state fence diagram (SFD), for analyzing discrete event systems such as reactive systems, is presented. This diagram is useful for event concurrent response and scenario analysis by using its three description styles.
Ara KHIL Seungryoul MAENG Jung Wan CHO
The problem of non-preemptive scheduling of real-time periodic tasks with specified release times on a uniprocessor system is known as NP-hard problem. In this paper we propose a new non-preemptive scheduling algorithm and a new static scheduling strategy which use the repetitiveness and the predictability of periodic tasks in order to improve schedulabilities of real-time periodic tasks with specified release times. The proposed scheduling algorithm schedules periodic tasks by using the heuristic that precalculates if the scheduling of the selected task leads to the case that a task misses a deadline when tasks are scheduled by the non-preemptive EDF algorithm. If so, it defers the scheduling of the selected task to avoid the precalculated deadline-missing. Otherwise, it schedules the selected task in the same way as the non-preemptive EDF algorithm. Our scheduling algorithm can always find a feasible schedule for the set of periodic tasks with specified release times which is schedulable by the non-preemptive EDF algorithm. Our static sheduling strategy transforms the problem of non-preemptive scheduling for periodic tasks with specified release times into one with same release times for all tasks. It suggests dividing the given problem into two subproblems, making a non-preemptive scheduling algorithm to find two feasible subschedules for the two subproblems in the forward or backward scheduling within specific time intervals, and then combining the two feasible subschedules into a complete feasible schedule for the given problem. We present the release times as a function of periods for the efficient problem division. Finally, we show improvements of schedulabilities of our scheduling algorithm and scheduling strategy by simulation results.
Martin BOUDA Yoshiaki NAKANO Kunio TADA
Extremely compact multi-mode interference (MMI) devices using central wide-angle coupling of input and output waveguides are proposed. It is shown that MMI can be used to change the propagation direction of light without the need for corner mirrors or bent waveguides. The concept can also be used for very compact power splitters which are even smaller than conventional MMI power splitters. Coupling between waveguides at wide angles is discussed and a number of regularities are found. The results can be useful for the design of more compact integrated circuits by a reduction of the number of bent waveguides which usually take up the largest part of the area of a photonic integrated circuit.
Mahmoud OMID Yoshio KAMI Masashi HAYAKAWA
This paper presents a theory based on combined differential- and common-mode propagation for crosstalk and transient analysis of pairs of asymmetric coupled interconnects with arbitrary time-invariant linear termination circuits. Time-domain solutions are obtained by an exact numerical inversion of Laplace transform (NILT). Two example circuits (coupled coplanar stripline and microstrip structures) are studied to examine the accuracy and efficiency of the present method.
Takehiro MORIOKA Kazuhiro HIRASAWA
The reduction of coupling between two wire antennas operating at different frequencies on an infinite ground plane is considered. An impedance loaded slot is introduced between the two antennas. A coupling coefficient and a transmission coefficient are used to evaluate the coupling behavior. It is found that by an appropriate choice of the slot length, location and load impedance the coupling coefficient can be reduced significantly. The problem is analyzed by the method of moments. Port parameters are used to relate a feed port, load ports on the two wire antennas and a load port on the slot. In so doing, a large amount of computation time is saved in calculating the antenna characteristics for various loads on the slot.
Tsutomu TASHIRO Takasuke HASHIMOTO Fumihiko SATO Yoshihiro HAYASHI Toru TATSUMI
A 7-mask self-aligned SiGe base bipolar transistor has been newly developed. This transistor offers several advancements to a super self-aligned selectively grown SiGe base (SSSB) transistor which has a selectively grown SiGe-base layer formed by a cold-wall ultra high vacuum (UHV)/CVD system. The advancements are as follows: (1) a BPSG-filled arbitrarywidth trench isolation on a SOI is formed by a high-uniformity CMP with a hydro-chuck for reducing the number of isolation fabrication steps, (2) polysilicon-plug emitter and collector electrodes are made simultaneously using an in-situ phosphorusdoped polysilicon film to decrease the distance between emitter and collector electrodes and also to reduce the fabrication steps of the elecrodes, (3) a n+-buried collector layer is made by a high-energy phosphorus ion-implantation technique to eliminate collector epitaxial growth, and (4) a germanium profile in the neutral base region is optimized to increase the fT value without increasing leakage current at the base-cellector junction. In the developed transistor, a high performance of 80-GHz fT and mask-steps reduction are simultaneously achieved.
Kao-Chih SYAO Augusto L. Gutierrez-AITKEN Kyounghoon YANG Xiangkun ZHANG George I. HADDAD Pallab K. BHATTACHARYA
The characteristics of high-performance InP-based monolithically integrated single and multiple channel photoreceivers with an InGaAs p-i-n photodiode and InAlAs/InGaAs HBTs, realized by one-step molecular beam epitaxy, are described. The monolithically integrated photoreceiver includes an integrated spiral inductor following the p-i-n diode at the input of the transimpedance amplifier to enhance the circuit response at high frequencies. Crosstalk of the multi-channel photoreceiver arrays is greatly reduced by applying both a metal ground shield and dual bias. The maximum measured -3 dB bandwidth of a single-channel integrated p-i-n/HBT photoreceiver is 19.5 GHz and the minimum crosstalk of the photoreceiver arrays, with an individual channel bandwidth of 11.5 GHz, is 36 dB. At these performance levels, these OEICs represent the state-of-the-art in multichannel integrated photoreceiver arrays.
A.A.M.(Toine) STARING Meint K. SMIT
Wavelength Division Multiplexing (WDM) technology provides many options to the design of flexible alloptical networks. To exploit these options to their full potential, Photonic Integrated Circuits (PICs) for wavelength routing and switching will be indispensable. One of the basic building blocks of such PICs is the planar phased-array (PHASAR) wavelength demultiplexer. The monolithic integration of PHASARs with photodetectors, amplifiers, and other waveguide-based (passive) components is discussed.
This paper compares signal classification performance of multilayer neural networks (MLNNs) and linear filters (LFs). The MLNNs are useful for arbitrary waveform signal classification. On the other hand, LFS are useful for the signals, which are specified with frequency components. In this paper, both methods are compared based on frequency selective performance. The signals to be classified contain several frequency components. Furthermore, effects of the number of the signal samples are investigated. In this case, the frequency information may be lost to some extent. This makes the classification problems difficult. From practical viewpoint, computational complexity is also limited to the same level in both methods.IIR and FIR filters are compared. FIR filters with a direct form can save computations, which is independent of the filter order. IIR filters, on the other hand, cannot provide good signal classification deu to their phase distortion, and require a large amount of computations due to their recursive structure. When the number of the input samples is strictly limited, the signal vectors are widely distributed in the multi-dimensional signal space. In this case, signal classification by the LF method cannot provide a good performance. Because, they are designed to extract the frequency components. On the other hand, the MLNN method can form class regions in the signal vector space with high degree of freedom.
Koji TERADA Seimi SASAKI Kazuhiro TANAKA Tsuyoshi YAMAMOTO Tadashi IKEUCHI Kazunori MIURA Mitsuhiro YANO
This letter describes our DFB-LD module for use in WDM optical access networks. We realized an isolator-free DFB-LD module with a thermo-electric cooler in aim of stabilizing the emission wavelength for WDM systems. Silicon waferboard technology was employed to achieve simple assembly and small size of the module. This small size contributed to low TEC power. Our fabricated module demonstrated low-noise and stable emission wavelength characteristics under 156 Mbit/s pseudo random modulation.
Tohru IKEGUCHI Kazuyuki AIHARA
In this paper, we propose a new strategy of estimating correlation dimensions in combination with the method of surrogate data, which is a kind of statistical control usually introduced to avoid spurious estimates of nonlinear statistics, such as fractal dimensions, Lyapunov exponents and so on. In the case of analyzing time series with the method of surrogate data, it is desirable to decide values of estimated nonlinear statistics of the original data and surrogate data sets as exactly as possible. However, when dimensional analysis is applied to possible attractors reconstructed from real time series, it is very dangerous to decide a single value as the estimated dimensions and desirable to analyze its scaling property for avoiding spurious estimates. In order to solve this defficulty, a dimension estimator algorithm and the method of surrogate data are combined by introducing Monte Carlo hypothesis testing. In order to show effectiveness of the new strategy, firstly artificial time series are analyzed, such as the Henon map with additive noise, filtered random numbers and filtered random numbers transformed by a static monotonic nonlinearity, and then experimental time series are also examined, such as wolfer's sunspot numbers and the fluctuations in a farinfrared laser data.
Hiroshi YANO Sosaku SAWADA Kentaro DOGUCHI Takashi KATO Goro SASAKI
A two-dimensional receiver OEIC array having an address selector for highly parallel interprocessor networks has been realized. The receiver OEIC array consists of two-dimensionally arranged 1616 (256) optical receiver cells with switching transistors, address selectors (decoders), and a comparator. Each optical receiver comprises a pin PD and a transimpedance-type HBT amplifier. The HBT has an InP passivation structure to suppress the emitter-size effect, which results in the improvement of current gains, especially at low collector current densities. The receiver OEIC array was fabricated on a 3-inch diameter InP substrate with pin/HBT integration technology. Due to the function of address selection, only one cell is activated and the other cells are mute, so the receiver OEIC array shows low crosstalk and low power consumption characteristics. The array also shows a 266-Mb/s data transmission capability. This receiver OEIC array is a most complex InP-based OEIC ever reported. The realization of the two-dimensional receiver OEIC array promises the future interprocessor networks with highly parallel optical interconnections.
Byungho KIM Boseob KWON Hyunsoo YOON Jung Wan CHO
Multipath interconnection networks can support higher bandwidth than those of nonblocking networks by passing multiple packets to the same output simultaneously and these packets are buffered in the output buffer. The delay-throughput performance of the output buffer in multipath networks is closely related to output traffic distribution, packet arrival process at each output link connected to a given output buffer. The output traffic distributions are different according to the various input traffic patterns. Focusing on nonuniform output traffic distributions, this paper develops a new, general analytic model of the output buffer in multipath networks, which enables us to investigate the delay-throughput performance of the output buffer under various input traffic patterns. This paper also introduces Multipath Crossbar network as a representative multipath network which is the base architecture of our analysis. It is shown that the output buffer performances such as packet loss probability and delay improve as nonuniformity of the output traffic distribution becomes larger.
Akimasa YOSHIDA Ken'ichi KOSHIZUKA Wataru OGATA Hironori KASAHARA
This paper proposes a data-localization scheduling scheme inside a processor-cluster for multigrain parallel processing, which hierarchically exploits parallelism among coarsegrain tasks like loops, medium-grain tasks like loop iterations and near-fine-grain tasks like statements. The proposed scheme assigns near-fine-grain or medium-grain tasks inside coarse-grain tasks onto processors inside a processor-cluster so that maximum parallelism can be exploited and inter-processor data transfer can be minimum after data-localization for coarse-grain tasks across processor-clusters. Performance evaluation on a multiprocessor system OSCAR shows that multigrain parallel processing with the proposed data-localization scheduling can reduce execution time for application programs by 10% compared with multigrain parallel processing without data-localization.
InHwan KIM Takayuki NAKACHI Nozomu HAMADA
In the adaptive lattice estimation process, it is well known that the convergence speed of the successive stage is affected by the estimation errors of reflection coefficients in its preceding stages. In this paper, we propose block estimation methods of two-dimensional (2-D) adaptive lattice filter. The convergence speed of the proposed algorithm is significantly enhanced by improving the adaptive performance of preceding stages. Furthermore, this process can be simply realized. The modeling of 2-D AR field and texture image are demonstrated through computer simulations.
Mitsuru KAWAMOTO Kiyotoshi MATSUOKA Masahiro OYA
This paper proposes a new method for recovering the original signals from their linear mixtures observed by the same number of sensors. It is performed by identifying the linear transform from the sources to the sensors, only using the sensor signals. The only assumption of the source signals is basically the fact that they are statistically mutually independent. In order to perform the 'blind' identification, some time-correlational information in the observed signals are utilized. The most important feature of the method is that the full information of available time-correlation data (second-order statistics) is evaluated, as opposed to the conventional methods. To this end, an information-theoretic cost function is introduced, and the unknown linear transform is found by minimizing it. The propsed method gives a more stable solution than the conventional methods.
MPO optical backplane connectors using multi-fiber push-on plugs (MPO plugs) have been developed. MPO optical backplane connector is a connector connecting a printed board to a backplane using MPO plug. MPO plug is held in the housing with self-retentive mechanism. To get same optical performances as standard MPO connector, precision in dimension and mechanism for appropriate connecting-disconnecting sequence are necessary. We have developed a new backplane housing and printed board housing based on previously reported MU connector. The optical performance is similar to that of MPO connectors.
Saed SAMADI Akinori NISHIHARA Nobuo FUJII
It is shown that two-dimensional linear phase FIR digital filters with various shapes of frequency response can be designed and realized as modular array structures free of multiplier coefficients. The design can be performed by judicious selection of two low order linear phase transfer functions to be used at each module as kernel filters. Regular interconnection of the modules in L rows and K columns conditioned with boundary coefficients 1, 0 and 1/2 results in higher order digital filters. The kernels should be chosen appropriately to, first, generate the desired shape of frequency response characteristic and, second, lend themselves to multiplierless realization. When these two requirements are satisfied, the frequency response can be refined to possess narrower transition bands by adding additional rows and columns. General properties of the frequency response of the array are investigated resulting in Theorems that serve as valuable tools towards appropriate selection of the kernels. Several design examples are given. The array structures enjoy several favorable features. Specifically, regularity and lack of multiplier coefficients makes it suitable for high-speed systolic VLSI implementation. Computational complexity of the structure is also studied.
Barbara M. CHAPMAN Piyush MEHROTRA Hans P. ZIMA
Highly parallel scalable multiprocessing systems (HMPs) are powerful tools for solving large-scale scientific and engineering problems. However, these machines are difficult to program since algorithms must exploit locality in order to achieve high performance. Vienna Fortran was the first fully specified data-parallel language for HMPs that provided features for the specification of data distribution and alignment at a high level of abstraction. In this paper we outline the major elements of Vienna Fortran and compare it to High Performance Fortran (HPF), a de-facto standard in this area. A significant weakness of HPF is its lack of support for many advanced applications, which require irregular data distributions and dynamic load balancing. We introduce HPF +, an extension of HPF based on Vienna Fortran, that provides the required functionality.
Qing-An ZENG Kaiji MUKUMOTO Akira FUKUDA
In this paper, we propose a handoff scheme with two-level priority for the reservation of handoff request calls in mobile cellular radio systems. We assume two types of mobile subscribers with different distributions of moving speed, that is, users with low average moving speed (e.g., pedestrians) and high average moving speed (e.g., people in moving cars). A fixed number of channels in each cell are reserved exclusively for handoff request calls. Out of these number of channels, some are reserved exclusively for the high speed handoff request calls. The remaining channels are shared by both the originating and handoff request calls. In the proposed scheme, both kinds of handoff request calls make their own queues. The system is modeled by a three-dimensional Markov chain. We apply the Successive Over-Relaxation (SOR) method to obtain the equilibrium state probabilities. Blocking probabilities of calls, forced termination probabilities and average queue length of handoff calls of each type are evaluated. We can make the forced termination probabilities of handoff request calls smaller than the blocking probability of originating calls. Moreover, we can make the forced termination probability of high speed handoff request calls smaller than that of the low speed ones. Necessary queue size for the two kinds of handoff request calls are also estimated.