Toshiharu HORIUCHI Mitsunori MIZUMACHI Satoshi NAKAMURA
This paper proposes a simple method for estimation and compensation of signal direction, to deal with relative change of sound source location caused by the movements of a microphone array and a sound source. This method introduces a delay filter that has shifted and sampled sinc functions. This paper presents a concept for the joint optimization of arrival time differences and of the coordinate system of a mobile microphone array. We use the LMS algorithm to derive this method by maintaining a certain relationship between the directions of the microphone array and the sound source directions. This method directly estimates the relative directions of the microphone array to the sound source directions by minimizing the relative differences of arrival time among the observed signals, not by estimating the time difference of arrival (TDOA) between two observed signals. This method also compensates the time delay of the observed signals simultaneously, and it has a feature to maintain that the output signals are in phase. Simulation results support effectiveness of the method.
Some conventional beamformers require the direction of the desired signal. The performance of such beamformers can substantially be degraded even in the presence of small error on the directional information. In this letter, we propose a prefilter-type beamforming scheme robust to directional error by employing a simple compensator. The performance of the proposed scheme is verified by computer simulation.
Chih-Yang HSU Chien-Nan Jimmy LIU Jing-Yang JOU
For large circuits, vector compaction techniques could provide a faster solution for power estimation with reasonable accuracy. Because traditional sampling approach will incur useless transitions between every sampled pattern pairs after they are concatenated into a single sequence for simulation, we proposed a vector compaction method with grouping and single-sequence consecutive sampling technique to solve this problem. However, it is very possible that we cannot find a perfect consecutive sequence without any undesired transitions. In such cases, the compaction ratio of the sequence length may not be improved too much. In this paper, we propose an efficient approach to relax the limitation a little bit such that multiple consecutive sequences are allowed. We also propose an algorithm to reduce the number of sequences instead of setting the number as one to find better solutions for vector compaction problem. As demonstrated in the experimental results, the average compaction ratio and speedup can be significantly improved by using this new approach.
Charoenchai BOWORNTUMMARAT Lunchakorn WUTTISITTIKULKIJ Sak SEGKHOONTHOD
In this paper, we consider the problem of multicast routing and wavelength assignment (MC-RWA) in multi-fiber all-optical WDM networks. Two main network design system comprehensively investigated here are mesh and multi-ring designs. Given the multicast traffic demands, we present new ILP formulations to solve the MC-RWA problem with an objective to determine the minimal number of fibers needed to support the multicast requests. Unlike previous studies, our ILP formulations are not only capable of finding the optimal multicast routing and wavelength assignment pattern to the light-trees, but also finding the optimal light-tree structures simultaneously. Since broadcast and unicast communications are special cases of multicast communications, our ILP models are actually the generalized RWA mathematical models of optical WDM networks. In addition to proposing the ILP models, this paper takes two main issues affecting the network capacity requirement into account, that is, the splitting degree level of optical splitters and techniques of wavelength assignment to the light-trees. Three multicast wavelength assignment techniques studied in this paper are Light-Tree (LT), Virtual Light-Tree (VLT) and Partial Virtual Light-Tree (PVLT) techniques. Due to the NP-completeness of the MC-RWA problem, the ILP formulations can reasonably cope with small and moderate networks. To work with large networks, this paper presents alternative MC-RWA ILP-based heuristic algorithms for the PVLT and LT networks and develops lower bound techniques to characterize the performance of our algorithms. Using existing large backbone networks, numerical results are reported to analyze such aspects as multiple fiber systems, the benefits of using optical splitters and wavelength converters, and the capacity difference between the mesh and multi-ring designs. Finally, this paper provides an analysis of the influence of network connectivity on the network implementation under the constraints of mesh and multi-ring design schemes.
Chun-Li LIN Hsiang-An WEN Tzonelih HWANG Hung-Min SUN
We will propose a key-agreement-type three-party password-authenticated key exchange protocol. The proposed protocol is quite efficient and, among the same type of protocols, is the first to be formally proven to be secure. A three-party formal model for security proof is proposed based on [25] and [26]. We construct a simulator in this model to show that our proposed protocol is secure under reasonable and well-defined cryptographic primitives.
Kenichi YOSHIDA Kazuyuki TAKAGI Kazuhiko OZEKI
This paper is concerned with improving noise-robustness of a multi-SNR multi-band speaker identification system by introducing automatic adjustment of subband likelihood recombination weights. The adjustment is performed on the basis of subband power calculated from the noise observed just before the speech starts in the input signal. To evaluate the noise-robustness of this system, text-independent speaker identification experiments were conducted on speech data corrupted with noises recorded in five environments: "bus," "car," "office," "lobby," and "restaurant". It was found that the present method reduces the identification error by 15.9% compared with the multi-SNR multi-band method with equal recombination weights at 0 dB SNR. The performance of the present method was compared with a clean fullband method in which a speaker model training is performed on clean speech data, and spectral subtraction is applied to the input signal in the speaker identification stage. When the clean fullband method without spectral subtraction is taken as a baseline, the multi-SNR multi-band method with automatic adjustment of recombination weights attained 56.8% error reduction on average, while the average error reduction rate of the clean fullband method with spectral subtraction was 11.4% at 0 dB SNR.
Jong-Seok LEE Hajoon LEE Jae-Young KIM Dongkyung NAM Cheol Hoon PARK
Feedforward neural networks have been successfully developed and applied in many areas because of their universal approximation capability. However, there still remains the problem of determining a suitable network structure for the given task. In this paper, we propose a novel self-organizing neural network which automatically adjusts its structure according to the task. Utilizing both the constructive and the pruning procedures, the proposed algorithm finds a near-optimal network which is compact and shows good generalization performance. One of its important features is reliability, which means the randomness of neural networks is effectively reduced. The resultant networks can have suitable numbers of hidden neurons and hidden layers according to the complexity of the given task. The simulation results for the well-known function regression problems show that our method successfully organizes near-optimal networks.
Dongkyung NAM Hajoon LEE Sangbong PARK Lae-Jeong PARK Cheol Hoon PARK
Nonminimum phase systems are difficult to be controlled with a conventional PID-type controller because of their inherent characteristics of undershooting. A neuro-controller combined with a PID-type controller has been shown to improve the control performance of the nonminimum phase systems while maintaining stability. In this paper, we apply a multiobjective evolutionary optimization method for training the neuro-controller to reduce the undershooting of the nonminimum phase system. The computer simulation shows that the proposed multiobjective approach is very effective and suitable because it can minimize the control error as well as reduce undershooting and chattering. This method can be applied to many industrial nonminimum phase problems with ease.
Takashi MORIE Kenichi MURAKOSHI Makoto NAGATA Atsushi IWATA
This paper presents circuit techniques using pulse-width and pulse-phase modulation (PWM/PPM) approaches for VLSI implementation of nonlinear dynamical systems. The proposed circuits implement discrete-time continuous-state dynamics by means of analog processing in a time domain, and also approximately implement continuous-time dynamics. Arbitrary nonlinear transformation functions are generated by the process in which a PPM signal samples a voltage or current source whose waveform in the time domain has the same shape as the desired transformation function. Because a shared arbitrary nonlinear voltage or current waveform generator can be constructed by digital circuits and D/A converters, high flexibility and real-time controllability are achieved. By using one of these new techniques, we have designed and fabricated a CMOS chaos circuit with arbitrary 1-D maps using a 0.6 µm CMOS process, and demonstrate from the experimental results that the new chaos circuit successfully generated various chaos with 7.5-7.8 bit precision by using logistic, tent and chaotic-neuron maps.
Kouta MATSUMOTO Osamu HASHIMOTO Kouji WADA
In this paper, the amplitude coefficient in each mode of leakage waves is calculated by using the amplitude level of the electric field about these unwanted waves under Ministry of Economy, Trade and Industry (METI) definition for measuring the leakage waves irradiated from door portion at the time of microwave oven manufacture, and the percentage of each mode included in leakage waves is also calculated by using finite difference time domain (FDTD) method. Furthermore, shielding effectiveness (SE) of choke structure for suppressing the leakage waves is calculated using combined waves composed of higher order modes as each percentages. As a result, the percentage of each mode included in the leakage waves is examined quantitatively. The approximation analysis for the SE of the choke structure can also be carried out. Therefore, efficient method for evaluating the door structure of the oven at the time of manufacture has been established without the use of the memory in the calculation.
Masahiko HIRATSUKA Shigeru IKEDA Takafumi AOKI Tatsuo HIGUCHI
An experimental model of a redox microarray, which provides a foundation for constructing future massively parallel molecular computers, is proposed. The operation of a redox microarray is confirmed, using an experimental setup based on an array of microelectrodes with analog integrated circuits.
This paper presents a new template matching method based on marker-controlled watershed segmentation (TMCWS). It is applied to recognize numbers on special metal plates in production lines where traditional image recognition methods do not work well. TMCWS is a shape based matching method that uses different pattern images and their corresponding marker images as probes to explore a gradient space of an unknown image to determine which pattern best matches a target object in it. Different from other matching algorithms, TMCWS firstly creates a marker image for each pattern, and then takes both the pattern image and its corresponding marker image as a template window and shifts this window across a gradient space pixel by pixel to do a search. At each position, the marker image is used to try to extract the contour of the target object with the help of marker-controlled watershed segmentation, and the pattern image is employed to evaluate the extracted shape in each trial. All of the pattern images and their corresponding marker images are tried and the pattern that best matches the target object is the recognition result. TMCWS contains shape extraction procedures and it is a high-level template matching method. Experiments are performed with this method on nearly 400 images of metal plates and the test results show its effectiveness in recognizing numbers in noisy images.
Min Gyo CHUNG Jisook PARK Jiyoun DONG
Much of the work on faces in computer vision has been focused on face recognition or facial expression analysis, but has not been directly related with face direction detection. In this paper, we propose a vision-based approach to detect a face direction from a single monocular view of a face by using a facial feature called facial triangle, which is formed by two eyebrows and the lower lip. Specifically, the proposed method introduces simple formulas to detect face rotation, horizontally and vertically, using the facial triangle. It makes no assumption about the structure of the face and produces an accurate estimate of face direction.
Masataka IMAO Katsutoshi TSUKAMOTO Shozo KOMAKI
In the road-to-vehicle communication (RVC) on intelligent transport systems (ITS), the frequent occurrence of shadowing caused by other vehicles deteriorates wireless transmission quality because of a small sized zone. However, a diffraction wave generated at the edge of vehicle can be utilized in applying adaptive modulation method with decreased modulation level. Therefore, it can be expected to keep communication only with a diffraction wave under shadowing. Hence this paper proposes an application of adaptive modulation for RVC system. This paper first reveals its improved effect in shadowing duration by computer simulation considering practical traffic flow, radio reflection and diffraction, and then shows that applying adaptive modulation can increase throughput performance largely.
Yeonwoo LEE Steve MCLAUGHLIN Emad AL-SUSA
In this letter, we address the problem of how to measure the link quality in terms of signal-to-interference ratio (SIR) in rapidly time varying channels which are due to fast variation of the interference or the bursty nature of the traffic. We propose a new SIR estimation approach for the TD-CDMA system, that is based on a pre-selection tentative decision device which discards and selects the estimated symbol on the basis of MAP ratio. The simulation results show that the proposed SIR estimator works and is superior to other known estimators in rapidly time varying channels.
Kazunori UCHIDA Hidetoshi NOSE Hiroshi MAEDA Toshiaki MATSUNAGA
This paper is concerned with the application of ray tracing method (RTM) to field analysis in bended and branched tunnels. On the line of sight, direct wave from a source and reflected waves at the tunnel walls are dominant compared with diffracted waves, but off the line of sight, diffraction can not be ignored especially beyond an abrupt bending. As a result, a detailed attention should be focused on the RTM analysis when dealing with propagation in the region off the line of sight. In this paper, we take into account of the diffraction rays which are originally reflection rays, next diffracted at a bending edge, and again converted to reflection rays. It is shown that numerical results are in good agreement with the experimental data.
Takahiro MATSUDA Akira NAGATA Miki YAMAMOTO
The window flow control based end-to-end TCP congestion control may cause unfair resource allocation among multiple TCP connections with different RTTs (round trip times) at a bottleneck link. In this paper, in order to improve this unfairness, we propose the active ECN which is an ECN based active queue mechanism (AQM). A bottleneck router with the proposed mechanism marks TCP segments with a probability which depends on the RTT of each connection. By enabling the TCP senders to reduce their transmission rate when their packets are marked, the proposed mechanism can realize the same transmission rate among TCP connections with different RTTs. Furthermore, the active ECN can directly mark ACKs from TCP receivers, while the conventional ECN marks TCP segments coming from the TCP senders. As a result, the queue length distribution at the bottleneck link gets stabilized, because the sender can quickly react to the marking according to variation of the queue length.
Hiroyuki YOKOYAMA Hajime NAKAMURA Shinichi NOMOTO
This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.
There have been numerous studies on the enhancement of the noisy speech signal. In this paper, We propose a new speech enhancement method, that is, a DFF (Dissonant Frequency Filtering) scheme combined with NR (noise reduction) algorithm. The simulation results indicate that the proposed method provides a significant gain in perceptual quality compared with the conventional method. Therefore if the proposed enhancement scheme is used as a pre-filter, the output speech quality would be enhanced perceptually.
Kwee-Bo SIM Ji-Yoon KIM Dong-Wook LEE
When we try to solve Multiobjective Optimization Problems (MOPs) using an evolutionary algorithm, the Pareto Genetic Algorithm (Pareto GA) introduced by Goldberg in 1989 has now become a sort of standard. After the first introduction, this approach was further developed and lead to many applications. All of these approaches are based on Pareto ranking and use the fitness sharing function to maintain diversity. On the other hand in the early 50's another scheme was presented by Nash. This approach introduced the notion of Nash Equilibrium and aimed at solving optimization problems having multiobjective functions that are originated from Game Theory and Economics. Since the concept of Nash Equilibrium as a solution of these problems was introduced, game theorists have attempted to formalize aspects of the equilibrium solution. The Nash Genetic Algorithm (Nash GA), which is introduced by Sefrioui, is the idea to bring together genetic algorithms and Nash strategy. The aim of this algorithm is to find the Nash Equilibrium of MOPs through the genetic process. Another central achievement of evolutionary game theory is the introduction of a method by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith in 1982. In this paper, we propose Game theory based Co-Evolutionary Algorithm (GCEA) and try to find the ESS as a solution of MOPs. By applying newly designed co-evolutionary algorithm to several MOPs, the first we will confirm that evolutionary game can be embodied by co-evolutionary algorithm and this co-evolutionary algorithm can find ESSs as a solutions of MOPs. The second, we show optimization performance of GCEA by applying this model to several test MOPs and comparing with the solutions of previously introduced evolutionary optimization algorithms.