Kota ASAKA Atsushi KANDA Akira OHKI Takeshi KUROSAKI Ryoko YOSHIMURA Hiroaki SANJOH Toshio ITO Makoto NAKAMURA Mikio YONEYAMA
By using impedance (Z) matching circuits in a low-cost transistor outline (TO) CAN package for a 10 Gb/s transmitter, we achieve a cost-effective and small bidirectional optical subassembly (BOSA) with excellent optical transmission waveforms and a > 40% mask margin over a wide temperature range (-10 to 85). We describe a design for Z matching circuits and simulation results, and discuss the advantage of the cost-effective compensation technique.
Hae-Chang JEONG Kyung-Whan YEOM
In this paper, a systematic design of X-band (9–10 GHz) 40 W pulse-driven GaN HEMT power amplifier is presented. The design includes device evaluation, verification of designed matching circuits, and measurements of the designed power amplifier. Firstly, the optimum input and output impedances for the selected GaN HEMT chip from TriQuint Semiconductor Inc. are evaluated using load-pull measurement. The selected GaN HEMT shows extremely low optimum impedances, which are obtained using a pre-match load-pull method due to the limitation of the tuning impedance range of conventional impedance tuners. We propose a novel extraction of the optimum impedances with general pre-match circuits. The extracted optimum impedances are found to be close to those computed, using the large signal model supplied from TriQuint Semiconductor. Using the optimum impedances, the matching circuits of the power amplifier are designed employing the combined impedance transformer type based on EM co-simulation. The fabricated power amplifier has a size of 1517.8 mm2, an efficiency above 45%, power gain of 7.7–9.9 dB and output power of 47–44.8 dBm at 9–10 GHz with pulse width of 10 µsec and duty of 10%.
In this paper, a high performance current latch sense amplifier (CLSA) with vertical MOSFET is proposed, and its performances are investigated. The proposed CLSA with the vertical MOSFET realizes a 11% faster sensing time with about 3% smaller current consumption relative to the conventional CLSA with the planar MOSFET. Moreover, the proposed CLSA with the vertical MOSFET achieves an 1.11 dB increased voltage gain G(f) relative to the conventional CLSA with the planar MOSFET. Furthermore, the proposed CLSA realizes up to about 1.7% larger yield than the conventional CLSA, and its circuit area is 42% smaller than the conventional CLSA.
Seon-Man HWANG Yi-Jung JUNG Hyuk-Min KWON Jae-Hyung JANG Ho-Young KWAK Sung-Kyu KWON Seung-Yong SUNG Jong-Kwan SHIN Yi-Sun CHUNG Da-Soon LEE Hi-Deok LEE
In this paper, we suggest a novel pnp BJT structure to improve the matching characteristics of the bipolar junction transistor (BJT) which is fabricated using standard CMOS process. In the case of electrical characteristics, the collector current density Jc of the proposed structure (T2) is a little greater than the conventional structure (T1), which contributes to the greater current gain β of the proposed structure than the conventional structure. Although the matching characteristics of the collector current density of the proposed structure is almost similar to the conventional structure, that of the current gain of the proposed structure is better than the conventional structure about 14.81% due to the better matching characteristics of the base current density of the proposed structure about 59.34%. Therefore, the proposed BJT structure is desirable for high performance analog/digital mixed signal application.
Zhu LI Yoichi TOMIOKA Hitoshi KITAZAWA
Detailed tracking is required for many vision applications. A visual feature-based constraint underlies most conventional motion estimation methods. For example, optical flow methods assume that the brightness of each pixel is constant in two consecutive frames. However, it is difficult to realize accurate extraction and tracking using only visual feature information, because viewpoint changes and inconsistent illumination cause the visual features of some regions of objects to appear different in consecutive frames. A structure-based constraint of objects is also necessary for tracking. In the proposed method, both visual feature matching and structure matching are formulated as a linear assignment problem and then integrated.
Young Seung LEE Seung Keun PARK
The problem of a finite monopole antenna driven by a coaxial cable is revisited. On the basis of a variable bound approach, the radiated field around a monopole antenna can be represented in terms of the discrete modal summation. This theoretical model allows us to avoid the difficulties experienced when dealing with integral equations having different wavenumber spectra and ensures a solution in a convergent series form so that it is numerically efficient. The behaviors of the input admittance and the current distribution to characterize the monopole antenna are shown for different coaxial-antenna geometries and also compared with other existing results.
Fused Blocked Pattern Matching is a kind of approximate matching based on Blocked Pattern Matching, and can be used in identification of fused peptides in tumor genomes. In this paper, we propose a new algorithm for fused blocked pattern matching. We give a comparison between Julio's solution and ours, which shows our algorithm is more efficient.
Jinfeng GAO Bilan ZHU Masaki NAKAGAWA
The paper describes how a robust and compact on-line handwritten Japanese text recognizer was developed by compressing each component of an integrated text recognition system including a SVM classifier to evaluate segmentation points, an on-line and off-line combined character recognizer, a linguistic context processor, and a geometric context evaluation module to deploy it on hand-held devices. Selecting an elastic-matching based on-line recognizer and compressing MQDF2 via a combination of LDA, vector quantization and data type transformation, have contributed to building a remarkably small yet robust recognizer. The compact text recognizer covering 7,097 character classes just requires about 15 MB memory to keep 93.11% accuracy on horizontal text lines extracted from the TUAT Kondate database. Compared with the original full-scale Japanese text recognizer, the memory size is reduced from 64.1 MB to 14.9 MB while the accuracy loss is only 0.5% from 93.6% to 93.11%. The method is scalable so even systems of less than 11 MB or less than 6 MB still remain 92.80% or 90.02% accuracy, respectively.
In this paper, we propose an improved face clustering method using a weighted graph-based approach. We combine two parameters as the weight of a graph to improve clustering performance. One is average similarity, which is calculated with two constraints of geometric and symmetric properties, and the other is a newly proposed parameter called the orientation matching ratio, which is calculated from orientation analysis for matched keypoints in the face region. According to the results of face clustering for several datasets, the proposed method shows improved results compared to the previous method.
Song-Hyon KIM Inchul SONG Kyong-Ha LEE Yoon-Joon LEE
Subgraph matching is a fundamental operation for querying graph-structured data. Due to potential errors and noises in real-world graph data, exact subgraph matching is sometimes inappropriate in practice. In this paper we consider an approximate subgraph matching model that allows missing edges. Based on this model, approximate subgraph matching finds all occurrences of a given query graph in a database graph, allowing missing edges. A straightforward approach is to first generate query subgraphs of a given query graph by deleting edges and then perform exact subgraph matching for each query subgraph. In this paper we propose a sharing-based approach to approximate subgraph matching, called SASUM. Our method is based on the fact that query subgraphs are highly overlapped. Due to this overlapping nature of query subgraphs, the matches of a query subgraph can be computed from the matches of a smaller query subgraph, which results in reducing the number of query subgraphs that require expensive exact subgraph matching. Our method uses a lattice framework to identify sharing opportunities between query subgraphs. To further reduce the number of graphs that need exact subgraph matching, SASUM generates small base graphs that are shared by query subgraphs and chooses the minimum number of base graphs whose matches are used to derive the matching results of all query subgraphs. A comprehensive set of experiments shows that our approach outperforms the state-of-the-art approach by orders of magnitude in terms of query execution time.
Cheng CHENG Bilan ZHU Masaki NAKAGAWA
This paper presents an approach based on character recognition to searching for keywords in on-line handwritten Japanese text. It employs an on-line character classifier and an off-line classifier or a combined classifier, which produce recognition candidates, and it searches for keywords in the lattice of candidates. It integrates scores to individually recognize characters and their geometric context. We use quadratic discriminant function(QDF) or support vector machines(SVM) models to evaluate the geometric features of individual characters and the relationships between characters. This paper also presents an approach based on feature matching that employs on-line or off-line features. We evaluate three recognition-based methods, two feature-matching-based methods, as well as ideal cases of the latter and concluded that the approach based on character recognition outperformed that based on feature matching.
Yusuf Nur WIJAYANTO Hiroshi MURATA Yasuyuki OKAMURA
Quasi-phase-matching (QPM) electro-optic modulators using gap-embedded patch-antennas were proposed for improving wireless microwave-optical signal conversion. The proposed QPM devices can receive wireless microwave signals and convert them to optical signals directly. The QPM structures enable us to have twice antenna elements in the fixed device length. The device operations with improved conversion efficiency of 10 dB were experimentally demonstrated at a wireless signal frequency of 26 GHz. The proposed QPM devices were also tested to a wireless-over-fiber link.
Manabu INUMA Akira OTSUKA Hideki IMAI
The security of biometric authentication systems against impersonation attack is usually evaluated by the false accept rate, FAR. The false accept rate FAR is a metric for zero-effort impersonation attack assuming that the attacker attempts to impersonate a user by presenting his own biometric sample to the system. However, when the attacker has some information about algorithms in the biometric authentication system, he might be able to find a “strange” sample (called a wolf) which shows high similarity to many templates and attempt to impersonate a user by presenting a wolf. Une, Otsuka, Imai [22],[23] formulated such a stronger impersonation attack (called it wolf attack), defined a new security metric (called wolf attack probability, WAP), and showed that WAP is extremely higher than FAR in a fingerprint-minutiae matching algorithm proposed by Ratha et al. [19] and in a finger-vein-patterns matching algorithm proposed by Miura et al. [15]. Previously, we constructed secure matching algorithms based on a feature-dependent threshold approach [8] and showed that if the score distribution is perfectly estimated for each input feature data, then the proposed algorithms can lower WAP to a small value almost the same as FAR. In this paper, in addition to reintroducing the results of our previous work [8], we show that the proposed matching algorithm can keep the false reject rate (FRR) low enough without degrading security, if the score distribution is normal for each feature data.
Fast string matching is essential for deep packet inspection (DPI). Traditional string matchers cannot keep up with the continuous increases in data rates due to their natural speed limits. We add a multi-byte processing prefilter to the traditional string matcher to detect target patterns on a multiple character basis. The proposed winnowing prefilter significantly reduces the number of identity blocks, thereby reducing the memory requirements.
Naohiro KOHMU Hiroshi MURATA Yasuyuki OKAMURA
We propose new electro-optic modulators using a double antenna-coupled electrode structure for radio-over-fiber systems. The proposed modulators are composed of a pair of patch antennas and a standing-wave resonant electrode. By utilizing a pair of patch antennas on SiO2 substrates and a coupled-microstrip line resonant electrode on a LiNbO3 substrate with a symmetric configuration, high-efficiency optical modulation is obtainable for 24 optical waveguides at the same time. The proposed modulators were designed at 58 GHz and their basic operations were demonstrated successfully with an improvement of 9 dB compared to a single antenna-coupled electrode device on a LiNbO3 substrate in our previous work.
This paper presents analysis and design of passive RC polyphase filters (RCPFs) in tutorial style. Single-phase model of a single-stage RCPF is derived, and then, multi-stage RCPFs are analyzed and obtained some restrictions for realizable poles and zeros locations of RCPFs. Exact design methods of RCPFs with equal ripple type, and Butterworth type responses are explained for transfer function design and element value design along with some design examples.
Takuho MITSUNAGA Yoshifumi MANABE Tatsuaki OKAMOTO
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match protocol based on plaintext equality tests. However, the time complexity of the plaintext equality tests is large, although the mix-and-match protocol can securely calculate any logical circuits. The proposed protocols reduce the number of times the plaintext equality tests is used by replacing them with the Boneh-Goh-Nissim encryption, which enables calculation of 2-DNF of encrypted data.
Juncheol PARK Dohoon KIM Hyo Joon EOM Sangbong JEON
The electrostatic characteristics of broadside-coupled striplines in a shield are investigated with the mode-matching method. The Fourier series is employed to describe electrostatic potential distributions. Numerical results are shown for coupled transmission line cell applications.
Quan MIAO Guijin WANG Xinggang LIN
This paper proposes a novel method for object tracking by combining local feature and global template-based methods. The proposed algorithm consists of two stages from coarse to fine. The first stage applies on-line classifiers to match the corresponding keypoints between the input frame and the reference frame. Thus a rough motion parameter can be estimated using RANSAC. The second stage employs kernel-based global representation in successive frames to refine the motion parameter. In addition, we use the kernel weight obtained during the second stage to guide the on-line learning process of the keypoints' description. Experimental results demonstrate the effectiveness of the proposed technique.
Keisuke DOHI Yuichiro SHIBATA Kiyoshi OGURI Takafumi FUJIMOTO
In this paper, we propose and discuss efficient GPU implementation techniques of absorbing boundary conditions (ABCs) for a 3D finite-difference time-domain (FDTD) electromagnetic field simulation for antenna design. In view of architectural nature of GPUs, the idea of a periodic boundary condition is introduced to implementation of perfect matched layers (PMLs) as well as a transformation technique of PML equations for partial boundaries. We also present efficient implementation method of a non-uniform grid. The evaluation results with a typical simulation model reveal that our proposed technique almost double the simulation performance and eventually achieve the 55.8% of the peak memory bandwidth of a target GPU.