Tao LIU Chengqian XU Yubo LI Kai LIU
In this letter, three constructions of perfect Gaussian integer sequences are constructed based on cyclic difference sets. Sufficient conditions for constructing perfect Gaussian integer sequences are given. Compared with the constructions given by Chen et al. [12], the proposed constructions relax the restrictions on the parameters of the cyclic difference sets, and new perfect Gaussian integer sequences will be obtained.
Takuya KOMAWAKI Michitarou YABUUCHI Ryo KISHIDA Jun FURUTA Takashi MATSUMOTO Kazutoshi KOBAYASHI
As device sizes are downscaled to nanometer, Random Telegraph Noise (RTN) becomes dominant. It is indispensable to accurately estimate the effect of RTN. We propose an RTN simulation method for analog circuits. It is based on the charge trapping model. The RTN-induced threshold voltage fluctuation are replicated to attach a variable DC voltage source to the gate of a MOSFET by using Verilog-AMS. In recent deca-nanometer processes, high-k (HK) materials are used in gate dielectrics to decrease the leakage current. We must consider the defect distribution characteristics both in HK and interface layer (IL). This RTN model can be applied to the bimodal model which includes characteristics of the HK and IL dielectrics. We confirm that the drain current of MOSFETs temporally fluctuates in circuit-level simulations. The fluctuations of RTN are different in MOSFETs. RTN affects the frequency characteristics of ring oscillators (ROs). The distribution of RTN-induced frequency fluctuations has a long-tail in a HK process. The RTN model applied to the bimodal can replicate a long-tail distribution. Our proposed method can estimate the temporal impact of RTN including multiple transistors.
Yusuke YOSHIDA Kimiyoshi USAMI
This paper describes a design of energy-efficient Standard Cell Memory (SCM) using Silicon-on-Thin-BOX (SOTB). We present automatic place and routing (P&R) methodology for optimal body-bias separation (BBS) for SCM, which enables to apply different body bias voltages to latches and to other peripheral circuits within SCM. Capability of SOTB to effectively reduce leakage by body biasing is fully exploited in BBS. Simulation results demonstrated that our approach allows us to design SCM with 40% smaller energy dissipation at the energy minimum voltage as compared to the conventional design flow. For the process and temperature variations, Adaptive Body Bias (ABB) for SCM with our BBS provided 70% smaller leakage energy than ABB for the conventional SCM, while achieving the same clock frequency.
Natsuki TAKAYAMA Hiroki TAKAHASHI
Partial blur segmentation is one of the most interesting topics in computer vision, and it has practical value. The generation of blur maps is a crucial part of partial blur segmentation because partial blur segmentation involves producing a blur map and applying a segmentation algorithm to the blur map. In this study, we address two important issues in order to improve the discrimination of blur maps: (1) estimating a robust local blur feature to consider variations in the intensity amplitude and (2) a scheme for generating blur maps. We propose the ANGHS (Amplitude-Normalized Gradient Histogram Span) as a local blur feature. ANGHS represents the heavy-tailedness of a gradient distribution, where it is calculated from an image gradient normalized using the intensity amplitude. ANGHS is robust to variations in the intensity amplitude, and it can handle local regions in a more appropriate manner than previously proposed local blur features. Blur maps are affected by local blur features but also by the contents and sizes of local regions, and the assignment of blur feature values to pixels. Thus, multiple-sized grids and the EAI (Edge-Aware Interpolation) are employed in each task to improve the discrimination of blur maps. The discrimination of the generated blur maps is evaluated visually and statistically using numerous partial blur images. Comparisons with the results obtained by state-of-the-art methods demonstrate the high discrimination of the blur maps generated using the proposed method.
Viet-Hang DUONG Manh-Quan BUI Jian-Jiun DING Bach-Tung PHAM Pham The BAO Jia-Ching WANG
In this work, two new proposed NMF models are developed for facial expression recognition. They are called maximum volume constrained nonnegative matrix factorization (MV_NMF) and maximum volume constrained graph nonnegative matrix factorization (MV_GNMF). They achieve sparseness from a larger simplicial cone constraint and the extracted features preserve the topological structure of the original images.
Dung Hoang DUONG Albrecht PETZOLDT Tsuyoshi TAKAGI
Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed at ICICS 2015 a new multivariate encryption scheme called SRP, which offers efficient decryption, a small blow up factor between plaintext and ciphertext and resists all known attacks against multivariate schemes. However, similar to other MPKC schemes, the key sizes of SRP are quite large. In this paper we propose a technique to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.
Xueqin ZHENG Xiaoxiong CHEN Tung-Chin PAN
This paper aims to improve the ability of low voltage ride through (LVRT) of doubly-fed induction generation (DFIG) under the asymmetric grid fault. The traditional rotor of the Crowbar device requires a large reactive support during the period of protection, which causes large fluctuations to the reactive power of the output grid while cut in and off for Crowbar. This case would influence the quality and efficiency of entire power system. In order to solve the fluctuation of reactive power and the stability of the wind power system, this paper proposes the coordinated control of the fuzzy-neural D-STATCOM and the rotor of the Crowbar. The simulation results show that the system has the performance of the rotor current with faster decay and faster dynamic response, high steady-state characteristic during the grid fault, which improve the ability of LVRT of DFIG.
Hojun KIM Yulong SHANG Taejin JUNG
In this paper, we propose a new spatial modulation (SM) scheme based on quaternary quasi-orthogonal sequences (Q-QOSs), referred to as Q-QOS-SM. First, the conventional SM and generalized-SM (GSM) schemes are reinterpreted as a new transmission scheme based on a spatial modulation matrix (SMM), whose column indices are used for the mapping of spatial-information bits unlike the conventional ones. Next, by adopting the SMM comprising the Q-QOSs, the proposed Q-QOS-SM that guarantees twice the number of spatial bits at a transmitter compared with the SM with a constraint of transmit antennas, is designed. From the computer-simulation results, the Q-QOS-SM is shown to achieve a greatly improved throughput compared with the conventional SM and GSM schemes, especially, for a large number of the receive antennas. This finding is mainly because the new scheme offers a much higher minimum Euclidean distance than the other schemes.
Shoichiro YAMASAKI Tomoko K. MATSUSHIMA Shinichiro MIYAZAKI Kotoku OMURA Hirokazu TANAKA
Secret sharing is a method to protect information for security. The information is divided into n shares, and the information is reconstructed from any k shares but no knowledge of it is revealed from k-1 shares. Physical layer security is a method to yield a favorable receive condition to an authorized destination terminal in wireless communications based on multi-antenna transmission. In this study, we propose wireless packet communications protected by the secret sharing based on Reed Solomon coding and the physical layer security based on vector coding, which implements a single-antenna system and a multi-antenna system. Evaluation results show the validity of the proposed scheme.
Sudoku is a pencil puzzle. The aim of the solver is to complete the 9×9 grid by filling in a digit in every cell according to a certain rule. In this study, we regard the process of solving Sudoku as a process of decoding a codeword from a received word, and show the expected decoding error probability for erasure channels obtained by experiments.
Yong Qiang JIA Lu GAN Hong Shu LIAO
Radio signals show characteristics of minute differences, which result from various idiosyncratic hardware properties between different radio emitters. A robust detector based on exponentially weighted distances is proposed to detect the exact reference instants of the burst communication signals. Based on the exact detection of the reference instant, in which the radio emitter finishes the power-up ramp and enters the first symbol of its preamble, the features of the radio fingerprint can be extracted from the transient signal section and the steady-state signal section for radiometric identification. Experiments on real data sets demonstrate that the proposed method not only has a higher accuracy that outperforms correlation-based detection, but also a better robustness against noise. The comparison results of different detectors for radiometric identification indicate that the proposed detector can improve the classification accuracy of radiometric identification.
In this paper, we propose filter-and-forward beamforming (FF-BF) for cognitive two-way relay networks in which secondary users employ an orthogonal frequency-division multiplexing (OFDM) system. Secondary transceivers communicate with each other through multiple relays to obtain BF gain as well as to suppress the interference between the primary and secondary users who share the same spectrum. We consider two FF-BF design methods to optimize the relay filter. The first method enhances the quality of service of the secondary network by maximizing the worst subcarrier signal-to-interference-plus-noise ratio (SINR) subject to transmit power constraints. The second method suppresses the interference from the secondary network to the primary network through the minimization of the relay transmission power subject to subcarrier SINR constraints. Simulation results show that the proposed FF-BF improves system performance in comparison to amplify-and-forward relay BF.
We have demonstrated crosstalk mitigation in single-mode MCFs using optical space coding. Four types of single-mode multicore fiber (MCF) models were evaluated by our scheme with the modified prime code and differential detection. Typically, intercore crosstalk was improved by 7-20 dB in 9-core fibers with an original crosstalk of 10-20 dB.
Fuqiang LI Tongzhuang ZHANG Yong LIU Guoqing WANG
The ignored side effect reflecting in the introduction of mismatching brought by contrast enhancement in representative SIFT based vein recognition model is investigated. To take advantage of contrast enhancement in increasing keypoints generation, hierarchical keypoints selection and mismatching removal strategy is designed to obtain state-of-the-art recognition result.
Maxime CLEMENT Tenda OKIMOTO Katsumi INOUE
Many real world optimization problems involving sets of agents can be modeled as Distributed Constraint Optimization Problems (DCOPs). A DCOP is defined as a set of variables taking values from finite domains, and a set of constraints that yield costs based on the variables' values. Agents are in charge of the variables and must communicate to find a solution minimizing the sum of costs over all constraints. Many applications of DCOPs include multiple criteria. For example, mobile sensor networks must optimize the quality of the measurements and the quality of communication between the agents. This introduces trade-offs between solutions that are compared using the concept of Pareto dominance. Multi-Objective Distributed Constraint Optimization Problems (MO-DCOPs) are used to model such problems where the goal is to find the set of Pareto optimal solutions. This set being exponential in the number of variables, it is important to consider fast approximation algorithms for MO-DCOPs. The bounded multi-objective max-sum (B-MOMS) algorithm is the first and only existing approximation algorithm for MO-DCOPs and is suited for solving a less-constrained problem. In this paper, we propose a novel approximation MO-DCOP algorithm called Distributed Pareto Local Search (DPLS) that uses a local search approach to find an approximation of the set of Pareto optimal solutions. DPLS provides a distributed version of an existing centralized algorithm by complying with the communication limitations and the privacy concerns of multi-agent systems. Experiments on a multi-objective extension of the graph-coloring problem show that DPLS finds significantly better solutions than B-MOMS for problems with medium to high constraint density while requiring a similar runtime.
Masayoshi YOSHIMURA Yoshiyasu TAKAHASHI Hiroshi YAMAZAKI Toshinori HOSOKAWA
High power dissipation can occur by high launch-induced switching activity when the response to a test pattern is captured by flip-flops (FFs) in at-speed scan testing, resulting in excessive IR drop. IR drop may cause significant capture-induced yield loss in the deep submicron era. It is known that test modification methods using X-identification and X-filling are effective to reduce power dissipation in the capture cycle. Conventional low power dissipation oriented X-filling methods consecutively select FFs and assign values to decrease the number of transitions on the FFs. In this paper, we propose a novel low power dissipation oriented X-filling method using SAT Solvers that conducts simultaneous X-filling for some FFs. We also proposed a selection order of FFs based on a correlation coefficient between transitions of FFs and power dissipation. Experimental results show that the proposed method was effective for ISCAS'89 and ITC'99 benchmark circuits compared with justification-probability-based fill.
Yuntao LIAO Takuya KINOSHITA Kazushige KOIWAI Toru YAMAMOTO
In industrial control processes, control performance influences the quality of products and utilization efficiency of energy; hence, the controller is necessarily designed according to user-desired control performance. Ideal control performance requires fast response for transient state and maintaining user-specified control performance for steady state. Hence, an algorithm to tune controller parameters to match the requirements for transient state and steady state is proposed. Considering the partial learning ability of the cerebellar model articulation controller (CMAC) neural network, it is utilized as a “tuner” of controller parameters in this study, since then the controller parameters can be tuned in both transient and steady states. Moreover, the fictitious reference iterative tuning (FRIT) algorithm is combined with CMAC in order to avoid problems, which may be caused by system modeling error and by using only a set of closed-loop data, the desired controller can be calculated in an off-line manner. In addition, the controller selected is a proportional-integral-derivative (PID) controller. Finally, the effectiveness of the proposed method is numerically verified by using some simulation and experimental examples.
Takumi KIMURA Norikazu TAKAHASHI
Nonnegative Matrix Factorization (NMF) with sparseness and smoothness constraints has attracted increasing attention. When these properties are considered, NMF is usually formulated as an optimization problem in which a linear combination of an approximation error term and some regularization terms must be minimized under the constraint that the factor matrices are nonnegative. In this paper, we focus our attention on the error measure based on the Euclidean distance and propose a new iterative method for solving those optimization problems. The proposed method is based on the Hierarchical Alternating Least Squares (HALS) algorithm developed by Cichocki et al. We first present an example to show that the original HALS algorithm can increase the objective value. We then propose a new algorithm called the Gauss-Seidel HALS algorithm that decreases the objective value monotonically. We also prove that it has the global convergence property in the sense of Zangwill. We finally verify the effectiveness of the proposed algorithm through numerical experiments using synthetic and real data.
Toru FUJITA Koji NAKANO Yasuaki ITO Daisuke TAKAFUJI
The main contribution of this paper is to present an efficient GPU implementation of bulk computation of the CKY parsing for a context-free grammar, which determines if a context-free grammar derives each of a lot of input strings. The bulk computation is to execute the same algorithm for a lot of inputs in turn or at the same time. The CKY parsing is to determine if a context-free grammar derives a given string. We show that the bulk computation of the CKY parsing can be implemented in the GPU efficiently using Bitwise Parallel Bulk Computation (BPBC) technique. We also show the rule minimization technique and the dynamic scheduling method for further acceleration of the CKY parsing on the GPU. The experimental results using NVIDIA TITAN X GPU show that our implementation of the bitwise-parallel CKY parsing for strings of length 32 takes 395µs per string with 131072 production rules for 512 non-terminal symbols.