Hisashi MOHRI Ritsuko MATSUMOTO Yuichi KAJI
This study is to investigate new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to predistribute cryptographic keys in sensor nodes before they are deployed. A focal point in this solution is the choice of keys that are assigned to a sensor node. Eschenauer et al. considered to choose keys randomly, and Chan et al. also followed the random choice approach. We consider in this paper a new approach in which keys are assigned according to a basic algebraic geometry. The performance of the proposed scheme is investigated analytically.
Junichiro SUZUKI Yoshikazu SHOJI Hiroyoshi YAMADA Yoshio YAMAGUCHI Masahiro TANABE
The multistage Wiener filter (MWF) outperforms the full rank Wiener filter in low sample support environments. However, the MWF adaptive process should be stopped at an optimum stage to get the best performance. There are two methods to stop the MWF adaptive process. One method is to calculate until the final full-stage, and the second method is to terminate at r-stage less than full-stage. The computational load is smaller in the latter method, however, a performance degradation is caused by an additional or subtractive stage calculation. Therefore, it is very important for the r-stage calculation to stop an adaptive process at the optimum stage. In this paper, we propose a simple method based on a cross-correlation coefficient to stop the MWF adaptive process. Because its coefficient is calculated by the MWF forward recursion, the optimum stage is determined automatically and additional calculations are avoided. The performance was evaluated by simulation examples, demonstrating the superiority of the proposed method.
Hong-Wei SUN Kwok-Yan LAM Dieter GOLLMANN Siu-Leung CHUNG Jian-Bin LI Jia-Guang SUN
In this paper, we present an efficient fingerprint classification algorithm which is an essential component in many critical security application systems e.g. systems in the e-government and e-finance domains. Fingerprint identification is one of the most important security requirements in homeland security systems such as personnel screening and anti-money laundering. The problem of fingerprint identification involves searching (matching) the fingerprint of a person against each of the fingerprints of all registered persons. To enhance performance and reliability, a common approach is to reduce the search space by firstly classifying the fingerprints and then performing the search in the respective class. Jain et al. proposed a fingerprint classification algorithm based on a two-stage classifier, which uses a K-nearest neighbor classifier in its first stage. The fingerprint classification algorithm is based on the fingercode representation which is an encoding of fingerprints that has been demonstrated to be an effective fingerprint biometric scheme because of its ability to capture both local and global details in a fingerprint image. We enhance this approach by improving the efficiency of the K-nearest neighbor classifier for fingercode-based fingerprint classification. Our research firstly investigates the various fast search algorithms in vector quantization (VQ) and the potential application in fingerprint classification, and then proposes two efficient algorithms based on the pyramid-based search algorithms in VQ. Experimental results on DB1 of FVC 2004 demonstrate that our algorithms can outperform the full search algorithm and the original pyramid-based search algorithms in terms of computational efficiency without sacrificing accuracy.
Keisuke ISHIBASHI Tatsuya MORI Ryoichi KAWAHARA Yutaka HIROKAWA Atsushi KOBAYASHI Kimihiro YAMAMOTO Hitoaki SAKAMOTO Shoichiro ASANO
We propose an algorithm for finding heavy hitters in terms of cardinality (the number of distinct items in a set) in massive traffic data using a small amount of memory. Examples of such cardinality heavy-hitters are hosts that send large numbers of flows, or hosts that communicate with large numbers of other hosts. Finding these hosts is crucial to the provision of good communication quality because they significantly affect the communications of other hosts via either malicious activities such as worm scans, spam distribution, or botnet control or normal activities such as being a member of a flash crowd or performing peer-to-peer (P2P) communication. To precisely determine the cardinality of a host we need tables of previously seen items for each host (e.g., flow tables for every host) and this may infeasible for a high-speed environment with a massive amount of traffic. In this paper, we use a cardinality estimation algorithm that does not require these tables but needs only a little information called the cardinality summary. This is made possible by relaxing the goal from exact counting to estimation of cardinality. In addition, we propose an algorithm that does not need to maintain the cardinality summary for each host, but only for partitioned addresses of a host. As a result, the required number of tables can be significantly decreased. We evaluated our algorithm using actual backbone traffic data to find the heavy-hitters in the number of flows and estimate the number of these flows. We found that while the accuracy degraded when estimating for hosts with few flows, the algorithm could accurately find the top-100 hosts in terms of the number of flows using a limited-sized memory. In addition, we found that the number of tables required to achieve a pre-defined accuracy increased logarithmically with respect to the total number of hosts, which indicates that our method is applicable for large traffic data for a very large number of hosts. We also introduce an application of our algorithm to anomaly detection. With actual traffic data, our method could successfully detect a sudden network scan.
Lung-Jen LEE Wang-Dauh TSENG Rung-Bin LIN
In this paper, we present a multiple capture approach to reducing the peak power as well as average power consumption during testing. The basic idea behind is to divide a scan chain into two sub-scan chains, and only one sub-scan chain will be enabled at a time during the scan shift or capture operations. We develop a pattern insertion technique to efficiently deal with the capture violation problem during the capture cycle. In order to alleviate the timing cost due to the insertion of redundant patterns, a scan chain partitioning method incorporated with test pattern reordering is developed to reduce the testing time. Experimental results for large ISCAS'89 benchmark circuits show that the proposed approach can efficiently reduce peak and average power with little timing overhead.
Chia-Ling WEI Lu-Yao WU Hsiu-Hui YANG Chien-Hung TSAI Bin-Da LIU Soon-Jyh CHANG
For battery-powered electronic products, one way to extend battery life is to use a versatile step-up/step-down DC-DC converter. A new versatile step-up/step-down switched-capacitor-based converter structure is proposed, and its efficiency is analyzed. In the step-down case, the efficiency is the same as, or even better than the efficiency of linear regulators.
Boonsarn PITAKDUMRONGKIJA Kazuhiko FUKAWA Hiroshi SUZUKI
This paper proposes a new minimum BER (MBER) criterion precoding method that is robust to imperfect channel state information (CSI) for MIMO-OFDM mobile communications. The proposed MBER precoding aims to minimize BER of the maximum likelihood detection (MLD), on the condition that the transmitter can obtain only imperfect CSI owing to channel estimation and quantization errors of the feedback CSI. The proposed scheme controls its precoding parameters under a transmit power constraint by minimizing an upper bound of BER which is derived from the pairwise error probability and averaged with respect to the CSI error. In contrast with a conventional power allocation MBER precoding method that is also robust to the CSI error, the proposed scheme does not make any assumption on the precoding parameters so as to reduce complexity. Thus, it is expected to outperform the conventional scheme at the cost of higher complexity. Computer simulations demonstrate that the proposed precoding method outperforms a conventional nonrobust MBER precoder and the conventional robust power allocation MBER precoding method when the amount of the CSI error is not considerable.
In this letter, the effect of distorted constellation shapes of 16-ary modulation due to the power saturation channel is analyzed. In particular, error bounds for 16-QAM and 16-APSK with distorted constellations are derived, and optimal operating points in terms of Es/N0 are presented. The result can be used to accurately predict the performance of these modulation schemes with a given level of the constellation distortion, as well as to determine the amount of input power to the saturation channel which minimizes the probability of modulation symbol error.
Imane DAOU Eisuke KUDOH Fumiyuki ADACHI
In virtual cellular network (VCN), proposed for high-speed mobile communications, the signal transmitted from a mobile terminal is received by some wireless ports distributed in each virtual cell and relayed to the central port that acts as a gateway to the core network. In this paper, we apply the multi-route MHMRC diversity in order to decrease the transmit power and increase the multi-hop link capacity. The transmit power, the interference power and the link capacity are evaluated for DS-CDMA multi-hop VCN by computer simulation. The multi-route MHMRC diversity can be applied to not only DS-CDMA but also other access schemes (i.e. MC-CDMA, OFDM, etc.).
Yusung KIM Kilnam CHON Lisong XU
We propose an Adjustable Parallel TCP (AP-TCP) which is a new scheme to control the aggregate throughput of parallel TCP flows. The AP-TCP can adjust the aggregate throughput to be any desired level irrespective of the parallel size (the number of parallel TCP flows). To adjust the aggregate throughput, we modify the increment factor of each parallel TCP flow to K2/N2 where N is the number of parallel TCP flows and K is a value equivalent to any desired level for the aggregate throughput. Once K is given, the AP-TCP attempts to have K times more bandwidth than a single TCP flow when they are competing on the same network path. Another feature of the AP-TCP is its self-adjustment scheme. There is no central coordination or control overhead for parallel TCP flows. We analyze the model of the AP-TCP theoretically and evaluate it by using NS-2 simulation.
Chang-Kyung SEONG Seung-Woo LEE Woo-Young CHOI
We propose a new Clock and Data Recovery (CDR) circuit for burst-mode applications. It can recover clock signals after two data transitions and endure long sequence of consecutive identical digits. Two Digital Phase Aligners (DPAs), triggered by rising or falling edges of input data, recover clock signals, which are then combined by a phase interpolator. This configuration reduces the RMS jitters of the recovered clock by 30% and doubles the maximum run length compared to a previously reported DPA CDR. A prototype chip is demonstrated with 0.18-µm CMOS technology. Measurement results show that the chip operates without any bit error for 1.25-Gb/s 231-1 PRBS with 200-ppm frequency offset and recovers clock and data after two clock cycles.
Naoya MOCHIKI Tetsuji OGAWA Tetsunori KOBAYASHI
We propose a new type of direction-of-arrival estimation method for robot audition that is free from strict head related transfer function estimation. The proposed method is based on statistical pattern recognition that employs a ratio of power spectrum amplitudes occurring for a microphone pair as a feature vector. It does not require any phase information explicitly, which is frequently used in conventional techniques, because the phase information is unreliable for the case in which strong reflections and diffractions occur around the microphones. The feature vectors we adopted can treat these influences naturally. The effectiveness of the proposed method was shown from direction-of-arrival estimation tests for 19 kinds of directions: 92.4% of errors were reduced compared with the conventional phase-based method.
We consider a class of nonlinear time delay systems with time-varying delays, and achieve a time delay independent sufficient condition for the global asymptotic stability. The sufficient condition is proved by constructing a continued fraction that represents the lower and upper bound variations of the system trajectory along the current of time, and showing that the continued fraction converges to the equilibrium point of the system. The simulation results show the validity of the sufficient condition, and illustrate that the sufficient condition is a close approximation to the unknown necessary and sufficient condition for the global asymptotic stability.
Hiroshi NISHIMOTO Toshihiko NISHIMURA Takeo OHGANE Yasutaka OGAWA
The MIMO system can meet the growing demand for higher capacity in wireless communication fields. So far, the authors have reported that, based on channel measurements, uncoded performance of narrowband MIMO spatial multiplexing in indoor line-of-sight (LOS) environments generally outperforms that in non-LOS (NLOS) ones under the same transmit power condition. In space-frequency coded MIMO-OFDM spatial multiplexing, however, we cannot expect high space-frequency diversity gain in LOS environments because of high fading correlations and low frequency selectivity of channels so that the performance may degrade unlike uncoded cases. In this letter, we present the practical performance of coded MIMO-OFDM spatial multiplexing based on indoor channel measurements. The results show that an LOS environment tends to provide lower space-frequency diversity effect whereas the MIMO-OFDM spatial multiplexing performance is still better in the environment compared with an NLOS environment.
Chung-Liang CHANG Jyh-Ching JUANG
In air navigation, the rotation of aircraft results in the discontinuous tracking of GNSS signals. As the platform rotates, the GNSS signals are subject to blanking effects. To solve this problem, a ring-type antenna array is used to prevent signal discontinuity and a hypothesis-test based detection scheme is developed so that the correct antenna combination can be formed to provide uninterrupted reception of GNSS signals in the presence of blanking, noise, and interferences. A fixed threshold detection scheme is first developed by assuming that the statistics of the noise are known. It is shown that the scheme is capable of differentiating signal from noise at each antenna element. To account for the interference effect, a multiple hypothesis test scheme, together with an adaptive selection rule, is further developed. Through this detection and selection process, it is shown, through simulations, that the desired GNSS signals can be extracted and successfully tracked in the presence of blanking and co-channel interference.
In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.
In this paper, we propose a reduced-complexity radial basis function (RBF)-assisted decision-feedback equalizer (DFE)-based turbo equalization (TEQ) scheme using a novel extended fuzzy c-means (FCM) algorithm, which not only is comparable in performance to the Jacobian RBF DFE-based TEQ but also is low-complexity. Previous TEQ research has shown that the Jacobian RBF DFE TEQ considerably reduces the computational complexity with similar performance, when compared to the logarithmic maximum a posteriori (Log-MAP) TEQ. In this study, the proposed reduced-complexity RBF DFE TEQ further greatly reduces the computational complexity and is capable of attaining a similar performance in contrast to the Jacobian RBF DFE TEQ in the context of both binary phase-shift keying (BPSK) modulation and 4 quadrature amplitude modulation (QAM). With this proposal, the materialization of the RBF-assisted TEQ scheme becomes more feasible.
Code acquisition performance in the Direct-Sequence Code-Division Multiple-Access (DS/CDMA) communication system is strongly related to the quality of the communication systems. The performance is assessed by (i) code acquisition time; (ii) precision; and (iii) complexity for implementation. This paper applies the method of maximum likelihood (ML) to estimation of propagation delay in DS/CDMA communications, and proposes a low-complexity method for code acquisition. First, a DS/CDMA system model and properties of outputs with a passive matched-filter receiver are reviewed, and a statistical problem in code acquisition is mentioned. Second, an error-controllable code acquisition method based on the maximum likelihood is discussed. Third, a low-complexity ML code acquisition method is proposed. It is shown that the code acquisition time with the low-complexity method is about 1.5 times longer than that with the original ML method, e.g. 13 data periods under 4.96 dB.
A dispersion diagram is useful in interpreting the characteristics of a periodic structure. In particular, the fast-wave region, where the wave is radiating, and the slow-wave region, where the wave is guided, can be determined from the dispersion diagram. An electronically-controlled composite right/left-handed (CRLH) transmission line (TL) was previously proposed and utilized as a leaky-wave (LW) antenna operating in the fast-wave region. However, since a guided-wave application operates in the slow-wave region, it is meaningful to study slow-wave effects of the proposed TL. In this paper, the dispersion diagram is used to investigate the slow-wave factor (SWF), which is necessary to understand the fast/slow-wave operations. Furthermore, the frequency characteristics are measured to find the cut-off frequencies in the LH and RH regions. Based on experimental results, it is observed at a fixed frequency, 2.6-GHz, that the phase of a proposed 6-cell structure can be changed by up to 280 in the LH slow-wave region.
Muhammad ZUBAIR Muhammad A.S. CHOUDHRY Aqdas NAVEED Ijaz Mansoor QURESHI
The computation involved in multiuser detection (MUD) for multicarrier CDMA (MC-CDMA) based on maximum likelihood (ML) principle grows exponentially with the number of users. Particle swarm optimization (PSO) with soft decisions has been proposed to mitigate this problem. The computational complexity of PSO, is comparable with genetic algorithm (GA), but is much less than the optimal ML detector and yet its performance is much better than GA.