Montri PHOTHISONOTHAI Masahiro NAKAGAWA
In this study, we propose a method of classifying a spontaneous electroencephalogram (EEG) approach to a brain-computer interface. Ten subjects, aged 21-32 years, volunteered to imagine left- and right-hand movements. An independent component analysis based on a fixed-point algorithm is used to eliminate the activities found in the EEG signals. We use a fractal dimension value to reveal the embedded potential responses in the human brain. The different fractal dimension values between the relaxing and imaging periods are computed. Featured data is classified by a three-layer feed-forward neural network based on a simple backpropagation algorithm. Two conventional methods, namely, the use of the autoregressive (AR) model and the band power estimation (BPE) as features, and the linear discriminant analysis (LDA) as a classifier, are selected for comparison in this study. Experimental results show that the proposed method is more effective than the conventional methods.
Shinichi FURUKAWA Wataru SATOU Takashi HINATA Nao SHIMIZU
In this paper, a fiber with two inhomogeneous sector holes around the core is proposed, and propagation characteristics of polarization maintaining region and single-polarization region are numerically analyzed by circular Fourier expansion method. In each case of the single-polarization region and the polarization maintaining region, a fiber is designed so as to satisfy the zero total dispersion at wavelength of 1.55 µm. Then, the single-polarization bandwidth for the single-polarization region and the modal birefringence for the polarization maintaining region are examined as the specific characteristics in each region. In addition, the power concentrating into the core region and distributions of Poynting vector is also discussed.
Jaeyoon LEE Dongweon YOON Sang Kyu PARK
Recently, we provided closed-form expressions involving two-dimensional (2-D) joint Gaussian Q-function for the symbol error rate (SER) and bit error rate (BER) of an arbitrary 2-D signal with I/Q unbalances over an additive white Gaussian noise (AWGN) channel [1]. In this letter, we extend the expressions to Nakagami-m fading channels. Using Craig representation of the 2-D joint Gaussian Q-function, we derive an exact and general expression for the error probabilities of arbitrary 2-D signaling with I/Q phase and amplitude unbalances over Nakagami-m fading channels.
Junichi MARUYAMA Go HASEGAWA Masayuki MURATA
In this paper, we propose new methods which detect tampered-TCP connections at edge routers and protect well-behaved TCP connections from tampered-TCP connections, which results in fairness among TCP connections. The proposed methods monitor the TCP packets at an edge router and estimate the window size or the throughput for each TCP connection. By using estimation results, the proposed methods assess whether each TCP connection is tampered or not and drop packets intentionally if necessary to improve the fairness amongst TCP connections. From the results of simulation experiments, we confirm that the proposed methods can accurately identify tampered-TCP connections and regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to about 1.
Chen-Chien HSU Tsung-Chi LU Heng-Chou CHEN
In this paper, an evolutionary approach is proposed to obtain a discrete-time state-space interval model for uncertain continuous-time systems having interval uncertainties. Based on a worst-case analysis, the problem to derive the discrete interval model is first formulated as multiple mono-objective optimization problems for matrix-value functions associated with the discrete system matrices, and subsequently optimized via a proposed genetic algorithm (GA) to obtain the lower and upper bounds of the entries in the system matrices. To show the effectiveness of the proposed approach, roots clustering of the characteristic equation of the obtained discrete interval model is illustrated for comparison with those obtained via existing methods.
JunHak LEE Takahiko HORIUCHI Shoji TOMINAGA
The reduction of a structural pattern at specific gray levels or at the special condition of image data has mainly been discussed in digital halftone methods. This problem is more severe in some flat panel displays because their black levels typically are brighter than other displays blocks. The authors proposed an advanced confined error diffusion (ACED) algorithm which was a well-organized halftone algorithm for flat panel devices. In this paper, we extend the ACED algorithm to the multi-level systems, which are capable of displaying more than 2 levels. Our extension has two merits for the hardware implementation. First, it can be processed in real time using the look-up table based method. The second one is the flexibility of selecting the used gray level. This paper discusses the performance of the proposed algorithms with experimental results for natural test images.
In this article, we discuss the security of double-block-length (DBL) hash functions against the free-start collision attack. We focus on the DBL hash functions composed of compression functions of the form F(x) = (f(x), f(p(x))), where f is a smaller compression function and p is a permutation. We first show, in the random oracle model, that a significantly good upper bound can be obtained on the success probability of the free-start collision attack with sufficient conditions on p and the set of initial values. We also show that a similar upper bound can be obtained in the ideal cipher model if f is composed of a block cipher.
Kazuhiro SUZUKI Dongvu TONIEN Kaoru KUROSAWA Koji TOYOTA
In this paper, we study multi-collision probability. For a hash function H :D R with |R|=n, it has been believed that we can find an s-collision by hashing Q=n(s-1)/s times. We first show that this probability is at most 1/s! for any s, which is very small for large s (for example, s=n(s-1)/s). Thus the above folklore is wrong for large s. We next show that if s is small, so that we can assume Q-s ≈ Q, then this probability is at least 1/s!-1/2(s!)2, which is very high for small s (for example, s is a constant). Thus the above folklore is true for small s. Moreover, we show that by hashing (s!)1/sQ+s-1 (≤ n) times, an s-collision is found with probability approximately 0.5 for any n and s such that (s!/n)1/s ≈ 0. Note that if s=2, it coincides with the usual birthday paradox. Hence it is a generalization of the birthday paradox to multi-collisions.
Shih-Bin JHONG Min-Hang WENG Sean WU Cheng-Yuan HUNG Maw-Shung LEE
A novel low insertion-loss and wideband microstrip bandpass filter has been designed and tested. The basic configuration of this novel dual-mode filter is a square ring resonator with direct-connected orthogonal feed lines, and dual-perturbation elements are introduced within the resonator at symmetrical location. The effects of the size of the perturbation element are studied. A new filter having wider bandwidth and transmission zeros are presented. The proposed filter responses are in good agreement with the simulations and experiments.
This letter deals with blind multiuser detection based on the multi-channel linearly constrained constant modulus algorithm (MLCCMA) for asynchronous code division multiple access (CDMA) systems over frequency-selective Rayleigh fading channels. In conjunction with the decision-feedback generalized sidelobe canceller (DFGSC), we present an efficient approach to combat multiple access interference and intersymbol interference. Computer simulations confirm that the proposed MLCCMA-based DFGSC can significantly speed up convergence and improve the output performance.
Visual tracking is required by many vision applications such as human-computer interfaces and human-robot interactions. However, in daily living spaces where such applications are assumed to be used, stable tracking is often difficult because there are many objects which can cause the visual occlusion. While conventional tracking techniques can handle, to some extent, partial and short-term occlusion, they fail when presented with complete occlusion over long periods. They also cannot handle the case that an occluder such as a box and a bag contains and carries the tracking target inside itself, that is, the case that the target invisibly moves while being contained by the occluder. In this paper, to handle this occlusion problem, we propose a method for visual tracking by a particle filter, which switches tracking targets autonomously. In our method, if occlusion occurs during tracking, a model of the occluder is dynamically created and the tracking target is switched to this model. Thus, our method enables the tracker to indirectly track the "invisible target" by switching its target to the occluder effectively. Experimental results show the effectiveness of our method.
Nguyen Hoang HAI Yoshinori NAMIHIRA Feroza BEGUM Shubi F. KAIJAGE Tatsuya KINJO S.M. Abdur RAZZAK Nianyu ZOU
In this paper, we propose and demonstrate a novel type of PCF that has two cladding layers with Ge rods at the center core. We numerically show that it is possible to design a single mode PCF with large effective area greater than 200 µm2 over the whole wavelength above 1.2 µm. The proposed large mode area PCF (LMA-PCF) exhibits a high negative dispersion coefficient from -186 to -158 [ps/(nm-km)] in all wavelengths ranging from 1.2 µm to 1.8 µm. Effective single mode operation of LMA-PCF is confimed for the entire band of interest.
Yusuke NAITO Kazuo OHTA Noboru KUNIHIRO
In this paper, we discuss the collision search for hash functions, mainly in terms of their advanced message modification. The advanced message modification is a collision search tool based on Wang et al.'s attacks. Two advanced message modifications have previously been proposed: cancel modification for MD4 and MD5, and propagation modification for SHA-0. In this paper, we propose a new concept of advanced message modification, submarine modification. As a concrete example combining the ideas underlying these modifications, we apply submarine modification to the collision search for SHA-0. As a result, we show that this can reduce the collision search attack complexity from 239 to 236 SHA-0 compression operations.
Suckchel YANG Dongwoo KANG Young NAMGOONG Yoan SHIN
We propose a simple asynchronous UWB (Ultra Wide Band) position location algorithm with low complexity, power consumption and processing delay. In the proposed algorithm, only a single RTTX (Round-Trip Transmission) of UWB pulses is utilized based on the ToA (Time of Arrival) principle. Hence, the proposed algorithm decreases power consumption and processing delay as compared to the basic ToA based on triple RTTXs. Moreover, unlike the TDoA (Time Difference of Arrival) algorithm, the proposed algorithm can perform the position location with low complexity since it does not require strict synchronization between multiple beacons. Simulation results using IEEE 802.15.4a UWB channel models reveal that the proposed algorithm achieves closely comparable position location performance of the basic ToA and TDoA algorithms.
Ik Rae JEONG Jeong Ok KWON Dong Hoon LEE
Several ID-based key distribution schemes can be used to realize secure broadcasting systems. Unfortunately, none of the proposed schemes provide both security against long-term key reveal attacks and security against session state reveal attacks. In this letter, we suggest an ID-based key distribution scheme secure against long-term key reveal attacks and session state reveal attacks.
Yu SASAKI Lei WANG Noboru KUNIHIRO Kazuo OHTA
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differences is the most important part of collision attacks against hash functions. So far, many researchers have tried to analyze Wang et al.'s method and proposed improved collision attacks. Although several researches proposed improved attacks, all improved results so far were based on the same message differences proposed by Wang et al. In this paper, we propose new message differences for collision attacks on MD4 and MD5. Our message differences of MD4 can generate a collision with complexity of less than two MD4 computations, which is faster than the original Wang et al.'s attack, and moreover, than the all previous attacks. This is the first result that improves the complexity of collision attack by using different message differences from Wang et al.'s. Regarding MD5, so far, no other message difference from Wang et al.'s is known. Therefore, study for constructing method of other message differences on MD5 should be interesting. Our message differences of MD5 generates a collision with complexity of 242 MD5 computations, which is slower than the latest best attack. However, since our attack needs only 1 bit difference, it has some advantages in terms of message freedom of collision messages.
The performance of multiuser MIMO downlink systems with block diagonalization (BD) relies on the channel state information (CSI) at the transmitter to a great extent. For time division duplex TDD systems, the transmitter estimates the CSI while receiving data at current time slot and then uses the CSI to transmit at the next time slot. When the wireless channel is time-varying, the CSI for transmission is imperfect due to the time delay between the estimation of the channel and the transmission of the data and severely degrades the system performance. In this paper, we propose a linear method to suppress the interferences among users and data streams caused by imperfect CSI at transmitter. The transmitter first sends pilot signals through a linear spatial precoding matrix so as to make possible that the receiver can estimate CSI of other users, and then the receiver exploits a linear prefilter to suppress the interference. The numerical results show that the proposed schemes achieve obvious performance enhancement in comparison to the BD scheme with imperfect CSI at the transmitter.
Munehiro MATSUURA Tsutomu SASAO
A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD_for_CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD_for_CFs. An algorithm to reduce the widths of BDD_for_CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental results for radix converters, adders, a multiplier, and lists of English words show that this method is useful for the synthesis of LUT cascades. An implementation of English words list by LUT cascades and an auxiliary memory is also shown.
Shinobu NAGAYAMA Tsutomu SASAO Jon T. BUTLER
Numerical function generators (NFGs) realize arithmetic functions, such as ex,sin(πx), and , in hardware. They are used in applications where high-speed is essential, such as in digital signal or graphics applications. We introduce the edge-valued binary decision diagram (EVBDD) as a means of reducing the delay and memory requirements in NFGs. We also introduce a recursive segmentation algorithm, which divides the domain of the function to be realized into segments, where the given function is realized as a polynomial. This design reduces the size of the multiplier needed and thus reduces delay. It is also shown that an adder can be replaced by a set of 2-input AND gates, further reducing delay. We compare our results to NFGs designed with multi-terminal BDDs (MTBDDs). We show that EVBDDs yield a design that has, on the average, only 39% of the memory and 58% of the delay of NFGs designed using MTBDDs.
Seungyoung PARK Yeonwoo LEE Sangboh YUN
The time division duplex cellular system can support various downlink and uplink traffic ratios by setting the downlink and uplink transmission periods appropriately. However, it causes severe co-channel interference problem when some cells are active in the downlink while the others are in the uplink [2]. To mitigate this problem, a resource allocation scheme combined with sectorization is proposed for orthogonal frequency division multiple access. Simulations demonstrate that the proposed scheme improves both spectral efficiency and outage performance compared to the conventional allocation schemes.