Younkyu CHUNG Kevin M.K.H. LEONG Tatsuo ITOH
The first implementations of X-band AlGaN/GaN HEMT single-ended frequency doublers are presented in this paper. Two types of fundamental frequency signal reflector schemes have been demonstrated for the frequency doubler application. Open-circuited quarter-wavelength microstrip line at the fundamental frequency is utilized for the reflector in a conventional way. In the other architecture a printed antenna is employed as a radiator as well as a novel fundamental frequency reflector. A microstrip rectangular patch antenna operating at the second harmonic frequency of the doubler was designed and integrated with AlGaN/GaN HEMT based on active integrated antenna design concept. Using AlGaN/GaN HEMT with 1 mm gate periphery, two 4 to 8 GHz frequency doublers were designed by the described design methodologies, fabricated, and tested. For the conventional frequency doubler, a conversion gain of 0.6 dB and with an output power of 15 dBm was observed. A conversion gain of 5 dB and an output power of 25 dBm with embedded antenna gain were achieved at a drain voltage of 12 V for the doubler integrated with the patch antenna.
Sebastien NUTTINCK Edward GEBARA Baskar BANERJEE Sunitha VENKATARAMAN Joy LASKAR Herbert M. HARRIS
We report in this paper, the performance of AlGaN/GaN HFETs in the context of high power, low noise and high temperature operations, along with a comparison of their characteristics with other conventional technologies. Finally, a single stage modulator driver for long haul optical communications is presented as an example of application of the GaN-based devices high power handling capabilities.
Sebastien NUTTINCK Edward GEBARA Stephane PINEL Joy LASKAR
We report the investigation of major dispersion mechanisms such as self-heating, trapping, current collapse, and floating-body effects present in AlGaN/GaN HFETs. These effects are analyzed using DC/Pulsed IV, load-pull, low-frequency noise systems, and a cryogenic probe station. This study leads to a better understanding of the device physics, which is critical for accurate large-signal modeling and device optimization.
Mahrokh G. SHAYESTEH Mohammad B. MENHAJ Babak G. NOBARY
Multiple access interference and near-far effect cause the performance of the conventional single user detector in DS/CDMA systems to degrade. Due to high complexity of the optimum multiuser detector, suboptimal multiuser detectors with less complexity and reasonable performance have received considerable attention. In this paper we apply the classic and a new modified genetic algorithm for multiuser detection of DS/CDMA signals. It is shown that the classic genetic algorithm (GA) reaches an error floor at high signal to noise ratios (SNR) while the performance of proposed modified GA is much better than the classic one and is comparable to the optimum detector with much less complexity. The results hold true for AWGN and fading channels. We also describe another GA called as meta GA to find the optimum parameters of the modified GA. We compare the performance of proposed method with the other detectors used in CDMA.
Hing Cheung SO Estella Man Kit SHIU
Mobile location can be achieved by using the time-of-arrival (TOA) and angle-of-arrival (AOA) measurements. In this Letter, we analyze the location accuracy of an TOA-AOA hybrid algorithm with a single base station in the line-of-sight scenario. The performance of the algorithm is contrasted with the Cramer-Rao lower bound and Federal Communications Commission Emergency 911 requirements.
A new approach to correcting the array amplitude failure by a combination of B-spline techniques and genetic algorithms is proposed. Some array elements indicate the control knots for a B-spline curve by their nominal positions and amplitudes; others distribute the excitation amplitudes according to the sampling points on the curve. The inherent smoothness of the B-spline curves reduce the effect of excessive coupling between adjacent elements. Genetic algorithms are used to search for a quasi-optimized B-spline curve to produce the ultimate amplitude distribution for correcting the array failure. To demonstrate the method's effectiveness, simulation results for correcting failures with three- and four-element failures are presented.
This paper addresses the routing and wavelength assignment (RWA) problem in a wavelength routed all optical network. One of the main issues is the assignment of the limited number of wavelengths over each physical fiber connection so that high aggregate capacity can be achieved. In a typical mesh topology, this problem has been shown to be NP-hard. In this paper, we propose a new heuristic based algorithm building upon one of the best known wavelength assignment algorithms proposed by Zhang and Acampora. The salient feature of the proposed algorithm is to consider the inherent multihop nature of the underlying mesh topology. We demonstrate that the proposed algorithm reduces the complexity by an order of magnitude, while at the same time achieving significantly lower blocking probability.
Takashi YAMAGUCHI Ken-ichi BABA Masayuki MURATA Ken-ichi KITAYAMA
In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced by its architecture and a packet scheduling algorithm. We compare the performances of these two packet switches by applying different packet scheduling algorithms. Through simulation experiments, we show that each architecture has a parameter region for achieving better performance. For the shared buffer type switch, we found that void space introduces unacceptable performance degradation when the traffic load is high. Accordingly, we propose a void space reduction method. Our simulation results show that our proposed method enables to the shared buffer type switch to outperform the output buffer type switch even under high traffic load conditions.
Atsushi KUSUNOKI Mitsuru TANAKA
This paper presents the design consideration of a polarization-transformation transmission filter, which is composed of a multilayered chiral slab. The optimal material parameters and thickness of each layer of the slab can be determined by using a genetic algorithm (GA). Substituting the constitutive relations for a chiral medium into Maxwell's equations, the electromagnetic field in the medium is obtained. A chain-matrix formulation is used to derive the relationship between the components of the incident, the reflected, and the transmitted electric fields. The cross- and co-polarized powers carried by the transmitted and reflected waves are represented in terms of their electric field components. The procedure proposed for the design of a polarization-transformation filter is divided into two stages. An ordinary filter without polarization-transformation and a polarization-transformation filter for the transmitted wave are designed with a multilayered non-chiral slab and a multilayered chiral slab at the first and the second stages, respectively. According to the specifications of the filters, two functionals are defined with the transmitted and reflected powers. Thus the optimal design of a polarization-transformation filter with the multilayered chiral slab is reduced to an optimization problem where the material parameters and thickness of each chiral layer are found by maximizing the functionals. Applying the GA to the maximization of the functionals, one can obtain the optimal material parameters and thicknesses of the multilayered chiral slab. Numerical results are presented to confirm the effectiveness of the two-stage design procedure. For three types of multilayered chiral slabs, optimal values of refractive indices, thicknesses, and chiral admittances are obtained. It is seen from the numerical results that the proposed procedure is very effective in the optimal design of polarization-transformation filters for the transmitted wave.
Mun-Ho JEONG Yoshinori KUNO Nobutaka SHIMADA Yoshiaki SHIRAI
We present a method for recognition of two-hand gestures. Two-hand gestures include fine-grain descriptions of hands under a complicated background, and have complex dynamic behaviors. Hence, assuming that two-hand gestures are an interacting process of two hands whose shapes and motions are described by switching linear dynamics, we propose a coupled switching linear dynamic model to capture interactions between both hands. The parameters of the model are learned via EM algorithm using approximate computations. Recognition is performed by selection of the model with maximum likelihood out of a few learned models during tracking. We confirmed the effectiveness of the proposed model in tracking and recognition of two-hand gestures through some experiments.
In this paper, a spatio-temporal error concealment method of transmission errors for improving visual quality over the wireless channel is proposed, which makes use of geometric information extracted from the surrounding blocks. The geometric information is an isophote that is curves of constant intensity of image. To improve visual quality during video communication, the proposed method smoothly connects the isophotes disconnected due to transmission error using a genetic algorithm (GA) with an isophote constraint. In the proposed method, the error concealment problem is modeled as an optimization problem, which in our case, is solved by a cost function with isophotes constraint that is minimized using a GA. Experimental results shows more visually realistic than other error concealment methods.
Recently, several promising multiobjective evolutionary algorithms such as PESA, NSGA-II, and SPEA2 have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm whose performance is comparable to or better than those promising algorithms. In the new algorithm proposed here, an age concept is introduced and utilized to make the efficiency of the offspring generation high. The performance of the proposed algorithm is superior to those of the promising algorithms mentioned above for several test functions. In this paper, the proposed algorithm will be explained only in two dimensional parameter and objective space to show manifestly the meaning of an age concept.
Nam-Chul HUH Byeong Man KIM Jong Wan KIM Seung Ryul MAENG
Many fuzzy traffic controllers adjust the extension time of the green phase with the fuzzy input variables, arrival and queue. However, in our experiments, we found that the two input variables are not sufficient for an intersection where traffic flow rates change and thus, in this paper, traffic volume is used as an additional variable. Traffic volume is defined as the number of vehicles entering an intersection every second. In designing a fuzzy traffic controller, an ad-hoc approach is usually used to find membership functions and fuzzy control rules showing good performance. That is, initial ones are generated by human operators and modified many times based on the results of simulation. To partially overcome the limitations of the ad-hoc approach, we use genetic algorithms to automatically determine the membership functions for terms of each fuzzy variable when fuzzy control rules are given by hand. The experimental results indicate that a fuzzy logic controller with volume variable outperforms conventional ones with no volume variable in terms of the average delay and the average velocity. Also, the controller shows better performance when membership functions generated by a genetic algorithms instead of ones generated by hand are used.
Hao CHI Qingji ZENG Huandong ZHAO Jiangtao LUO Zhizhong ZHANG
The conservative mode and the greedy mode scheduling algorithms for OBS switch with shared buffer are presented and discussed. Their performance is evaluated by computer simulations, as well as that of the greedy mode with void-filling algorithm. Simulation results show that the conservative mode and the greedy mode have different characteristics under different input load. The greedy mode and the conservative mode are more applicable in a real system than that with void-filling, owing to their lower computational complexity and FIFO characteristic. Finally, a composite algorithm integrated by the conservative mode and the greedy mode is proposed, which is adapted to the input load with the help of an input load monitor. The simulation results reveal that it has favorable performance under different load.
Probabilistic inference by means of a massive probabilistic model usually has exponential-order computational complexity. For such massive probabilistic model, loopy belief propagation was proposed as a scheme to obtain the approximate inference. It is known that the generalized loopy belief propagation is constructed by using a cluster variation method. However, it is difficult to calculate the correlation in every pair of nodes which are not connected directly to each other by means of the generalized loopy belief propagation. In the present paper, we propose a general scheme for calculating an approximate correlation in every pair of nodes in a probabilistic model for probabilistic inference. The general scheme is formulated by combining a cluster variation method with a linear response theory.
Shuichi ICHIKAWA Hidemitsu SAITO Lerdtanaseangtham UDORN Kouji KONISHI
Many application programs can be modeled as a subgraph isomorphism problem. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospective solution for such problems. This paper examines various accelerator designs for subgraph isomorphism problems based on Ullmann's algorithm and Konishi's algorithm. These designs are quantitatively evaluated from two points of view: logic scale and execution time. Our study revealed that Ullmann's design is faster but larger in logic scale. Partially sequential versions of Ullmann's algorithm can be more cost-effective than Ullmann's original design. The hardware of Konishi's algorithm is smaller in logic scale, operates at a higher frequency, and is more cost-effective.
Qi-Ping CAO Zheng TANG Rong-Long WANG Xu-Gang WANG
This paper describes a new learning method for Multiple-Value Logic (MVL) networks using the local search method. It is a "non-back-propagation" learning method which constructs a layered MVL network based on canonical realization of MVL functions, defines an error measure between the actual output value and teacher's value and updates a randomly selected parameter of the MVL network if and only if the updating results in a decrease of the error measure. The learning capability of the MVL network is confirmed by simulations on a large number of 2-variable 4-valued problems and 2-variable 16-valued problems. The simulation results show that the method performs satisfactorily and exhibits good properties for those relatively small problems.
An adaptive blind signal separation filter is proposed using a risk-sensitive criterion framework. This criterion adopts an exponential type function. Hence, the proposed criterion varies the consideration weight of an adaptation quantity depending on errors in the estimates: the adaptation is accelerated when the estimation error is large, and unnecessary acceleration of the adaptation does not occur close to convergence. In addition, since the algorithm derivation process relates to an H filtering, the derived algorithm has robustness to perturbations or estimation errors. Hence, this method converges faster than conventional least squares methods. Such effectiveness of the new algorithm is demonstrated by simulation.
Takaaki HORI Yoshiaki NODA Shoichi MATSUNAGA
This paper presents an improved phoneme-history-dependent (PHD) search algorithm. This method is an optimum algorithm under the assumption that the starting time of a recognized word depends on only a few preceding phonemes (phoneme history). The computational cost and the number of recognition errors can be reduced if the phoneme-history-dependent search uses re-selection of the preceding word and an appropriate length of phoneme histories. These improvements increase the speed of decoding and help to ensure that the resulting word graph has the correct word sequence. In a 65k-word domain-independent Japanese read-speech dictation task and 1000-word spontaneous-speech airline-ticket-reservation task, the improved PHD search was 1.2-1.8 times faster than a traditional word-dependent search under the condition of equal word accuracy. The improved search reduced the number of errors by a maximum of 21% under the condition of equal processing time. The results also show that our search can generate more compact and accurate word graphs than those of the original PHD search method. In addition, we investigated the optimum length of the phoneme history in the search.
Hiroyuki TAKIZAWA Taira NAKAJIMA Kentaro SANO Hiroaki KOBAYASHI Tadao NAKAMURA
The equidistortion principle[1] has recently been proposed as a basic principle for design of an optimal vector quantization (VQ) codebook. The equidistortion principle adjusts all codebook vectors such that they have the same contribution to quantization error. This paper introduces a novel VQ codebook design algorithm based on the equidistortion principle. The proposed algorithm is a variant of the law-of-the-jungle algorithm (LOJ), which duplicates useful codebook vectors and removes useless vectors. Due to the LOJ mechanism, the proposed algorithm can establish the equidistortion condition without wasting learning steps. This is significantly effective in preventing performance degradation caused when initial states of codebook vectors are improper to find an optimal codebook. Therefore, even in the case of improper initialization, the proposed algorithm can achieve minimization of quantization error based on the equidistortion principle. Performance of the proposed algorithm is discussed through experimental results.