Tongjiang YAN Huadong LIU Yuhua SUN
In this paper, we modify the Legendre-Sidelnikov sequence which was defined by M. Su and A. Winterhof and consider its exact autocorrelation values. This new sequence is balanced for any p,q and proved to possess low autocorrelation values in most cases.
Junko TAKAHASHI Toshinori FUKUNAGA Kazumaro AOKI Hitoshi FUJI
This paper proposes a new accurate evaluation method for examining the resistance of cryptographic implementations against access-driven cache attacks (CAs). We show that a mathematical correlation method between the sets of measured access time and the ideal data, which depend on the guessed key, can be utilized to evaluate quantitatively the correct key in access-driven CAs. We show the effectiveness of the proposed method using the access time measured in noisy environments. We also estimate the number of key candidates based on mathematical proof while considering memory allocation. Furthermore, based on the proposed method, we analyze quantitatively how the correlation values change with the number of plaintexts for a successful attack.
Sun-Mi PARK Ku-Young CHANG Dowon HONG Changho SEO
In several important applications, we often encounter with the computation of a Toeplitz matrix vector product (TMVP). In this work, we propose a k-way splitting method for a TMVP over any field F, which is a generalization of that over GF(2) presented by Hasan and Negre. Furthermore, as an application of the TMVP method over F, we present the first subquadratic space complexity multiplier over any finite field GF(pn) defined by an irreducible trinomial.
Naohisa HASHIMOTO Shin KATO Sadayuki TSUGAWA
Energy conservation is one of the hot topics within the domain of traffic problems. It is well known that shortening the distance between vehicles reduces the aerodynamic drag of the lagging (or following) vehicle and leads to energy savings, which benefits the drivers. Recently, systems have been developed in which trucks or vehicles travel in a platoon with reduced headway from the preceding vehicle by using automated driving or driver assistance systems. The objective of the present study is to investigate how human factors, such as driving style, a driver's condition, or a driver's personal characteristics, influence the decision of a driver to close the gap with a preceding vehicle and obtain the benefit of aerodynamic drag reduction. We developed a realistic experimental paradigm for investigating the relationship between distance and several factors including the driver's personal characteristics and the size of preceding vehicle. Our experimental setup made use of real vehicles on a test track, as opposed to a vehicle simulator. We examined behavior of subjects that drove the following vehicle as well as subjects that sat in the passenger seat in the following vehicle. The experimental results demonstrate that all subjects attempted to reduce the distance to the preceding vehicle in order to gain the benefit. Based on the experimental and questionnaire results, we conclude that there are relationships between the category of subjects and subject's following distances.
Hyunki LIM Jaesung LEE Dae-Won KIM
We propose a new multi-label feature selection method that does not require the multi-label problem to be transformed into a single-label problem. Using quadratic programming, the proposed multi-label feature selection algorithm provides markedly better learning performance than conventional methods.
Yasuyuki NOGAMI Kazuki TADA Satoshi UEHARA
Let p be an odd characteristic and m be the degree of a primitive polynomial f(x) over the prime field Fp. Let ω be its zero, that is a primitive element in F*pm, the sequence S={si}, si=Tr(ωi) for i=0,1,2,… becomes a non-binary maximum length sequence, where Tr(·) is the trace function over Fp. On this fact, this paper proposes to binarize the sequence by using Legendre symbol. It will be a class of geometric sequences but its properties such as the period, autocorrelation, and linear complexity have not been discussed. Then, this paper shows that the generated binary sequence (geometric sequence by Legendre symbol) has the period n=2(pm-1)/(p-1) and a typical periodic autocorrelation. Moreover, it is experimentally observed that its linear complexity becomes the maximum, that is the period n. Among such experimental observations, especially in the case of m=2, it is shown that the maximum linear complexity is theoretically proven. After that, this paper also demonstrates these properties with a small example.
Akihiro SUDA Hideki TAKASE Kazuyoshi TAKAGI Naofumi TAKAGI
We propose a synthesis method of nested loops into parallelized circuits by integrating the polyhedral optimization, which is a state-of-the-art technique in the field of software, into high-level synthesis. Our method constructs circuits equipped with multiple processing elements (PEs), using information generated by the polyhedral optimizing compiler. Since multiple PEs cannot concurrently access the off-chip RAM, a method for constructing on-chip buffers is also proposed. Our buffering method reduces the off-chip RAM access conflicts and further enables burst accesses and data reuses. In our experimental result, the buffered circuits generated by our method are 8.2 times on average and 26.5 times at maximum faster than the sequential non-buffered ones, when each of the parallelized circuits is configured with eight PEs.
Jun TAYA Kazuki KOJIMA Tomonori MUKUDA Akihiro NAKASHIMA Yuki SAGAWA Tokiyoshi MATSUDA Mutsumi KIMURA
We propose a temperature sensor employing a ring oscillator composed of poly-Si thin-film transistors (TFTs). Particularly in this research, we compare temperature sensors using TFTs with lightly-doped drain structure (LDD TFTs) and TFTs with offset drain structure (offset TFTs). First, temperature dependences of transistor characteristics are compared between the LDD and offset TFTs. It is confirmed that the offset TFTs have larger temperature dependence of the on current. Next, temperature dependences of oscillation frequencies are compared between ring oscillators using the LDD and offset TFTs. It is clarified that the ring oscillator using the offset TFTs is suitable to detect the temperature. We think that this kind of temperature sensor is available as a digital device.
Tsubasa TASHIRO Kentaro NISHIMORI Tsutomu MITSUI Nobuyasu TAKEMURA
We have proposed an intruder detection method by using multiple-input multiple-output (MIMO) channels. Although the channel capacity for MIMO transmission is severely degraded in time-variant channels, we can take advantage of this feature in MIMO sensor applications. For MIMO sensors, the accurate estimation of channel state information (CSI) is essential. Moreover, the transceiver should be simplified from the viewpoint of saving power. Narrowband signals such as minimum shift keying (MSK) and offset quaternary phase shift keying signals are effective and are used in sensor network systems. However, because the timing and carrier offsets between the transmitter and receiver are relatively large compared to the symbol rate, accurate CSI estimation is impossible given the severe constraints imposed by the timing and carrier offsets. To solve this issue, a signal synchronization method for the CSI estimation using a narrowband MSK signal has been proposed. In this paper, we propose a new CSI estimation method for arbitrary amplitude and phase modulation schemes for the MIMO sensor. The key point of the proposed method is that control signals (unique words) are mapped so as not to pass through the origin of the complex I/Q plane. The estimation accuracy of the proposed method is evaluated via a computer simulation. Moreover, the basic performance by the proposed CSI estimation method is verified when considering intruder detection by MIMO sensor.
Akihiro TOMITA Xiaoqing WEN Yasuo SATO Seiji KAJIHARA Kohei MIYASE Stefan HOLST Patrick GIRARD Mohammad TEHRANIPOOR Laung-Terng WANG
The applicability of at-speed scan-based logic built-in self-test (BIST) is being severely challenged by excessive capture power that may cause erroneous test responses even for good circuits. Different from conventional low-power BIST, this paper is the first to explicitly focus on achieving capture power safety with a novel and practical scheme, called capture-power-safe logic BIST (CPS-LBIST). The basic idea is to identify all possibly-erroneous test responses caused by excessive capture power and use the well-known approach of masking (bit-masking, slice-masking,vector-masking) to block them from reaching the multiple-input signature register(MISR). Experiments with large benchmark circuits and a large industrial circuit demonstrate that CPS-LBIST can achieve capture power safety with negligible impact on test quality and circuit overhead.
The goal of dimension reduction is to represent high-dimensional data in a lower-dimensional subspace, while intrinsic properties of the original data are kept as much as possible. An important challenge in unsupervised dimension reduction is the choice of tuning parameters, because no supervised information is available and thus parameter selection tends to be subjective and heuristic. In this paper, we propose an information-theoretic approach to unsupervised dimension reduction that allows objective tuning parameter selection. We employ quadratic mutual information (QMI) as our information measure, which is known to be less sensitive to outliers than ordinary mutual information, and QMI is estimated analytically by a least-squares method in a computationally efficient way. Then, we provide an eigenvector-based efficient implementation for performing unsupervised dimension reduction based on the QMI estimator. The usefulness of the proposed method is demonstrated through experiments.
Mingmin YAN Hiroki TAMURA Koichi TANNO
The aim of this study is to present electrooculogram signals that can be used for human computer interface efficiently. Establishing an efficient alternative channel for communication without overt speech and hand movements is important to increase the quality of life for patients suffering from Amyotrophic Lateral Sclerosis or other illnesses that prevent correct limb and facial muscular responses. In this paper, we introduce the gaze estimation system of electrooculogram signals. Using this system, the electrooculogram signals can be recorded when the patients focused on each direct. All these recorded signals could be analyzed using math-method and the mathematical model will be set up. Gaze estimation can be recognized using electrooculogram signals follow these models.
Xuyun NIE Albrecht PETZOLDT Johannes BUCHMANN Fagen LI
The Piece in Hand method is a security enhancement technique for Multivariate Public Key Cryptosystems (MPKCs). Since 2004, many types of this method have been proposed. In this paper, we consider the 2-layer nonlinear Piece in Hand method as proposed by Tsuji et al. in 2009. The key point of this method is to introduce an invertible quadratic polynomial map on the plaintext variables to add perturbation to the original MPKC. An additional quadratic map allows the owner of the secret key to remove this perturbation from the system. By our analysis, we find that the security of the enhanced scheme depends mainly on the structure of the quadratic polynomials of this auxiliary map. The two examples proposed by Tsuji et al. for this map can not resist the Linearization Equations attack. Given a valid ciphertext, we can easily get a public key which is equivalent to that of the underlying MPKC. If there exists an algorithm that can recover the plaintext corresponding to a valid ciphertext of the underlying MPKC, we can construct an algorithm that can recover the plaintext corresponding to a valid ciphertext of the enhanced MPKC.
Smartphones have become vital devices in the current on-the-go Thai culture. Typically, virtual keyboards serve as tools for text input on smartphones. Due to the limited screen area and the large number of Thai characters, the size of each button on the keyboard is quite small. This leads to character mistyping and low typing speed. In this paper, we present a typical framework of a Thai Input Method on smartphones which includes four processes; Character Candidate Generation, Word Candidate Generation, Word Candidate Display, and Model Update. This framework not only works with Thai, it works with other letter-based languages as well. We also review virtual keyboards and techniques currently used and available for Thai text input.
Renato VAERNEWYCK Xin YIN Jochen VERBRUGGHE Guy TORFS Xing-Zhi QIU Efstratios KEHAYAS Johan BAUWELINCK
An integrated 2×28Gb/s dual-channel duobinary driver IC is presented. Each channel has integrated coding blocks, transforming a non-return-to-zero input signal into a 3-level electrical duobinary signal to achieve an optical duobinary modulation. To the best of our knowledge this is the fastest modulator driver including on-chip duobinary encoding and precoding. Moreover, it only consumes 652mW per channel at a differential output swing of 6Vpp.
Beong-Ha LIM Gun-Su KIM Dong-Ho LEE Heung-Sik TAE Seok-Hyun LEE
This paper proposes a new address method to reduce the address power consumption in an AC plasma panel display (AC-PDP). We apply an overlap scan method, in which the scan pulse overlaps with those of the previous scan time and the next scan time. The overlap scan method decreases the address voltage and consequently reduces the address power consumption. However, the drawback of this method is the narrow address voltage margin. This occurs because the maximum address voltage decreases much more than the minimum address voltage does. In order to increase the address voltage margin, we apply a two-step address voltage waveform, in the overlap scan method. In this case, the maximum address voltage increases; however, the minimum address voltage is almost the same. This leads to a wide address voltage margin. Moreover, the two-step address voltage waveform reduces the address power consumption, because the address voltage rises and falls in two steps using an energy recovery capacitor. Consequently, the experimental results show that the new address method reduces the address power consumption by 19.6,Wh (58%) when compared with the conventional method.
The recently suggested regular-type triangular quadrature amplitude modulation (TQAM) provides considerable power gain over square quadrature amplitude modulation (SQAM) at the expense of a slight increase in detection complexity. However, the power gain of the TQAM is limited due to the constraint that signal points should be regularly located at the vertexes of contiguous equilateral triangles. In this paper, we investigate two irregular (optimum and suboptimum) TQAMs where signal points are irregularly distributed while preserving the equilateral triangular lattice, and calculate achievable power gains of the proposed constellations. We also address optimum and suboptimum bit stream mapping methods and suggest a simple and optimum detection method for the constellations to be meaningful in practical implementation, and present analytical and simulation results. The proposed constellations can provide the asymptotic power gains of 0.825dB and 0.245dB over SQAM and regular TQAM, respectively.
Jun SHIBAYAMA Takuto OIKAWA Tomoyuki HIRANO Junji YAMAUCHI Hisamatsu NAKANO
The body-of-revolution finite-difference time-domain method (BOR-FDTD) based on the locally one-dimensional (LOD) scheme is extended to a frequency-dependent version for the analysis of the Drude and Drude-Lorentz models. The formulation is simplified with a fundamental scheme, in which the number of arithmetic operations is reduced by 40% in the right-hand sides of the resultant equations. Efficiency improvement of the LOD-BOR-FDTD is discussed through the analysis of a plasmonic rod waveguide and a plasmonic grating.
Qiuyan WANG Dongdai LIN Xuan GUANG
In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.
Rongchun LI Yong DOU Jie ZHOU Chen CHEN
The parallel interference cancellation (PIC) multiple input multiple output (MIMO) detection algorithm has bit error ratio (BER) performance comparable to the maximum likelihood (ML) algorithm but with complexity close to the simple linear detection algorithm such as zero forcing (ZF), minimum mean squared error (MMSE), and successive interference cancellation (SIC), etc. However, the throughput of PIC MIMO detector on central processing unit (CPU) cannot meet the requirement of wireless protocols. In order to reach the throughput required by the standards, the graphics processing unit (GPU) is exploited in this paper as the modem processor to accelerate the processing procedure of PIC MIMO detector. The parallelism of PIC algorithm is analyzed and the two-stage PIC detection is carefully developed to efficiently match the multi-core architecture. Several optimization methods are employed to enhance the throughput, such as the memory optimization and asynchronous data transfer. The experiment shows that our MIMO detector has excellent BER performance and the peak throughput is 337.84 Mega bits per second (Mbps), about 7x to 16x faster than that of CPU implementation with SSE2 optimization methods. The implemented MIMO detector has better computing throughput than recent GPU-based implementations.