Chih-ping LIN Motoaki SANO Matsuo SEKINE
The millimeter wave (MMW) radar has good compromise characteristics of both microwave radar and optical sensors. It has better angular and range resolving abilities than microwave radar, and a longer penetrating range than optical sensors. We used the MMW radar to detect targets located in the sea and among sea ice clutter based on fractals, wavelets, and neural networks. The wavelets were used as feature extractors to decompose the MMW radar images and to extract the feature vectors from approximation signals at different resolution levels. Unsupervised neural classifiers with parallel computational architecture were used to classify sea ice, sea water and targets based on the competitive learning algorithm. The fractal dimensions could provide a quantitative description of the roughness of the radar image. Using these techniques, we can detect targets quickly and clearly discriminate between sea ice, sea water, and targets.
In logic programming or functional programming languages, data objects, such as terms and lists, are immutable. In a basic implementation of such language, updating one element of an aggregate (contiguous data structure, such as an array) involves making a new copy of the whole aggregate. However, such copying can be expensive, and can be avoided by using a destructive update. We introduce the concept of a wrapper which enables destructive operation on an immutable object. Based on this concept, we designed the reversible functor as a solution to the aggregate update problem. We implemented the reversible functor in the existing SB-Prolog system and carried out several benchmarks. These benchmark results show its effectiveness. When using a large functor and updating it many times, the performance is improved dramatically by implementing the reversible functor. It incurs some overhead at runtime, but the amount is small and acceptable.
Junji TAKAYAMA Yasuo OHTSUBO Kazunari FURUGEN Ryutaro FUJISHIMA Makoto IWAMOTO Hirofumi HORIKOSHI Ichiro ARITA
This paper analyzed the connection points of Main Distribution Frames (MDF), which are installed between outside plants and inside plants (service nodes). This paper also proposes a connecting system for forthcoming FITL (Fiber In The Loop) networks. NTT has developed the Subscriber Line Cross-Connecting Module (LXM) for the FITL network and will continue to introduce LXMs and deploy optic subscriber networks in big cities throughout Japan.
Kwang-Su SEONG Chong-Min KYUNG
In this paper, we propose a clustering based linear ordering algorithm which consists of global ordering and local ordering. In the global ordering, the algorithm forms clusters from n given vertices and orders the clusters. In the local ordering, the elements in each cluster are linearly ordered. The linear order, thus produced, is used to obtain optimal κ-way partitioning based on scaled cost objective function. When the number of cluster is one, the proposed algorithm is exactly the same as MELO [2]. But the proposed algorithm has more global partitioning information than MELO by clustering. Experiment with 11 benchmark circuits for κ-way (2 κ 10) partitioning shows that the proposed algorithm yields an average of 10.6% improvement over MELO [2] for the κ-way scaled cost partitioning.
New interference cancellation technique using time division reference signal is proposed for optical synchronous code-division multiple-access (CDMA) systems with modified prime sequence codes. In the proposed system one user in each group is not allowed to access the network at each time, and this unallowable user's channel is used as a reference signal for other users in the same group at the time. The performance of the proposed system using an avalanche photodiode (APD) is analyzed where the Gaussian approximation of the APD output is employed and the effects of APD noise, thermal noise, and interference for the receiver are included. The proposed cancellation techniqus is shown to be effective to improve the bit error probability performance and to alleviate the error floor when the number of users and the received optical power are not appreciably small.
Isamu WAKAKI Takayuki ISHIGURO Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
This paper deals with performance evaluation of CDMA based on DS/SS/GMSK signaling with the differential detection over multipath Rayleigh fading channels. To demodulate DS/SS/GMSK signals, we consider differential detection, which does not need a carrier recovery. The bit-error-rate performance is evaluated in the presence of thermal noise and multipleaccess interferences under the multipath Rayleigh fading environment. To improve the performance, we also consider adoption of a RAKE receiver.
In this paper, the bit error rate (BER) considering tracking performance is evaluated, by theoretical analysis and computer simulation, for a bi-orthogonal system using a synchronizing pseudo-noise (PN) sequence and co-channel interference cancellers. A system that improves on Tachikawa's system is proposed. It is found that the optimum ratio of the information signal energy to the synchronizing signal energy varies with Eb/No, and the canceller is better for small L than for large L (L = length of the sequence). Moreover, it is found that the BER considering synchronization performance improvse as the equivalent noise bandwidth Bn decreases.
Hiraku OKADA Masato SAITO Takeshi SATO Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
The one of the problems in the satellite packet communication system is the existence of a long time delay, which may cause an improper packet access control resulting in a great deal of degradation of the system performance. In this paper, we clarify the effect of long time delay on the performance of CDMA ALOHA systems and then propose a new access control protocol, called Modified Channel Load Sensing Protocol (MCLSP), for the CDMA ALOHA systems. As a result, we show that a significant improvement in the throughput performance was obtained with MCLSP even in the presence of a long time delay.
Hack-Yoon KIM Futoshi ASANO Yoiti SUZUKI Toshio SONE
In this paper, a new spectral subtraction technique with two microphone inputs is proposed. In conventional spectral subtraction using a single microphone, the averaged noise spectrum is subtracted from the observed short-time input spectrum. This results in reduction of mean value of noise spectrum only, the component varying around the mean value remaining intact. In the method proposed in this paper, the short-time noise spectrum excluding the speech component is estimated by introducing the blocking matrix used in the Griffiths-Jim-type adaptive beamformer with two microphone inputs, combined with the spectral compensation technique. By subtracting the estimated short-time noise spectrum from the input spectrum, not only the mean value of the noise spectrum but also the component varying around the mean value can be reduced. This method can be interpreted as a partial construction of the adaptive beamformer where only the amplitude of the short-time noise spectrum is estimated, while the adaptive beamformer is equivalent to the estimator of the complex short-time noise spectrum. By limiting the estimation to the amplitude spectrum, the proposed system achieves better performance than the adaptive beamformer in the case when the number of sound sources exceeds the number of microphones.
Memory Sharing Processor Array (MSPA) architecture has been developed as an effective array processing architecture for both reduced data storages and increased processor cell utilization efficiency [1]. In this paper, the MSPA design methodology is extended to the VLSI synthesis of a serial input processor array (Pa). Then, a new bit-serial input multiplier and a new data serial input matrix multiplier are derived from the new PA. These multipliers are superior to the conventional multipliers by their smaller number of logic-gate count.
Recently, various efficient algorithms for solving combinatorial optimization problems using BDD-based set manipulation techniques have been developed. Minato proposed O-suppressed BDDs (ZBDDs) which is suitable for set manipulation, and it is utilized for various search problems. In terms of practical limits of space, however, there are still many search problems which are solved much better by using conventional branch-and-bound techniques than by using BDDs or ZBDDs, while the ability of conventional branch-and-bound approaches is limited by computation time. In this paper, an extension of APPLY operation, named APPRUNE (APply + PRUNE) operation, is proposed, which performs APPLY operation (ZBDD construction) and pruning simultaneously in order to reduce the required space for intermediate ZBDDs. As a prototype, a specific algorithm of APPRUNE operation is shown by assuming that the given condition for pruning is a threshold function, although it is expected that APPRUNE operation will be more effective if more sophisticated condition are considered. To reduce size of ZBDDs in intermediate steps, this paper also pay attention to the number of cared variables. As an application, an exact-minimization algorithm for generalized Reed-Muller expressions (GRMs) is implemented. From experimental results, it is shown that time and memory usage improved 8.8 and 3.4 times, respectively, in the best case using APPRUNE operation. Results on generating GRMs of exact-minimum number of not only product terms but also literals is also shown.
Koichi TANNO Okihiko ISHIZUKA Zheng TANG
This paper describes an N-type and a P-type MOS cascode circuit based on the square-law characteristics of an MOS transistor in saturation region. The transconductance parameter ratios of an upper and a lower MOS transistor are set to be 1: n2 for the N-type MOS cascode circuit and n2: 1 for the P-type MOS cascode circuit. The N and P-type MOS cascode circuits are divided to four types by the difference of connections of input terminals. We consider the input-output relations of each type circuit. The second-order effects of the circuit such as channel length modulation effect, mobility reduction effect and device mismatch are analyzed. As applications, an analog voltage adder and a VT level shifter using MOS cascode circuits are presented. All of the proposed circuits are very simple and consist of only the N and P-type MOS cascode circuits. The proposed circuits aer confirmed by SPICE simulation with MOSIS 1.2µm CMOS process parameters.
In this paper stochastic aradient adaptive filters using the Sign or Sign-Sign Algorithm are analyzed based upon general assumptions on the reference signal, additive noise and particularly jointly distributed tap errors. A set of difference equations for calculating the convergence process of the mean and covariance of the tap errors is derived with integrals involving characteristic function and its derivative of the tap error distribution. Examples of echo canceller convergence with jointly Gaussian distributed tap errors show an excellent agreement between the empirical results and the theory.
Md. Kamrul HASAN Takashi YAHAGI
This paper is devoted to a new design method for infinite impulse response approximate inverse system of a nonminimum phase system. The design is carried out such that the convolution of the nonminimum phase polynomial and its approximate inverse system can be represented by an approximately linear phase all-pass filter. A method for estimating the time delay and order of an approximate inverse system is also presented. Using infinite impulse response approximate inverse systems better accuracy is achieved with reduced computational complexity. Numerical examples are included to show the effectiveness of the proposed method.
Satoru IGAWA Akio OGIHARA Akira SHINTANI Shinobu TAKAMATSU
We propose a method to fuse auditory information and visual information for accurate speech recognition. This method fuses two kinds of information by using Iinear combination after calculating two kinds of probabilities by HMM for each word. In addition, we use full-frame color image as visual information in order to improve the accuracy of the proposed speech recognition system. We have performed experiments comparing the proposed method with the method using either auditory information or visual information, and confirmed the validity of the proposed method.
Yasuhiko ARAKAWA Masao NISHIOKA Hajime NAKAYAMA Masaki KITAMURA
We discuss fabrication of InGaAs quantum dot structures using the self-assembling growth technique with the Stranski-Krastanow growth mode in MOCVD, including optical ploperties of the nano-structures. The formation process of the quantum dot islands was clarified by observing the samples grown under various conditions with an atomic force microscope. A trial for self-alignment of the quantum dots was also investigated. On the basis of these results, as the first step toward the ultimate semiconductor lasers in which both electrons and photons are fully quantized, a vertical microcavity InGaAs/GaAs quantum dot laser was demonstrated. Finally a perspective of the quantum dot lasers is discussed, including the bottleneck issues and the impact of the quantum dot structures for reducing threshold current in wide bandgap lasers such as GaN lasers.
Hironori OKII Takashi UOZUMI Koichi ONO Yasunori FUJISAWA
This paper describes a new region segmentation method which is detectable carcinoma regions from hematoxylin and eosin (HE)-stained breast tumor images using collective behaviors of artificial organisms. In this model, the movement characteristics of artificial organisms are controlled by the gene, and the adaptive behavior of artificial organisms in the environment, carcinoma regions or not, is evaluated by the texture features.
Michiharu MAEDA Hiromi MIYAJIMA Sadayuki MURASHIMA
This paper describes an adaptive neural vector quantization algorithm with a deleting approach of weight (reference) vectors. We call the algorithm an adaptive learning and self-deleting algorithm. At the beginning, we introduce an improved topological neighborhood and an adaptive vector quantization algorithm with little depending on initial values of weight vectors. Then we present the adaptive learning and self-deleting algorithm. The algorithm is represented as the following descriptions: At first, many weight vectors are prepared, and the algorithm is processed with Kohonen's self-organizing feature map. Next, weight vectors are deleted sequentially to the fixed number of them, and the algorithm processed with competitive learning. At the end, we discuss algorithms with neighborhood relations compared with the proposed one. The proposed algorithm is also good in the case of a poor initialization of weight vectors. Experimental results are given to show the effectiveness of the proposed algorithm.
Takayuki NAKACHI Katsumi YAMASHITA Nozomu HAMADA
We present an extended quarter-plane lattice model for generating two-dimensional (2-D) autoregressive fields. This work is a generalization of the extended lattice filter of diagonal form (ELDF) developed by Ertuzun et al. The proposed model represents a wider class of 2-D AR fields than conventional lattice models. Several examples are presented to demonstrate the applicability of the proposed model. Furthermore, the proposed structure is compared with other conventional lattice filters based on the computation of their entropy values.
Masahiro YAMAUCHI Shinji TANIMOTO Toshimasa WATANABE
A minimal siphon (or alternatively a structural deadlock) of a Petri net is defined as a minimal set S of places such that existence of any edge from a transition t to a place of S implies that there is an edge from some place of S to t. The subject of the paper is to find a minimal siphon containing a given set of specified places of a general Petri net.