Motivated by the fact that the existing FMIPv6 security scheme has several weaknesses in terms of security and efficiency, we propose a security-enhanced fast mobile IPv6 in this letter. Based on the concept of a secret key-based CGA (Cryptographically Generated Address), we show how to establish a new security association between the MN and AR (Access Router) whenever a handover occurs. We also show that the proposed scheme is robust against several types of security attacks feasible with the existing scheme. Our scheme is more efficient in that it requires fewer public key operations.

We present a BPSK coherent optical wireless link in a multiple-beam, multiple-aperture configuration. The data are recovered using the signal obtained by the coherent addition of a set of maximum likelihood optical phase estimates and a select-largest stage. The proposal offers higher performance than the combining methods commonly used in optical wireless systems with diversity transmission and coherent detection.

Existence of backward TE volume modes which are to be identified as Magnetostatic Wave (MSW) in anisotropic single-negative slab with partly negative permeability tensor component have already been revealed by present authors. In this paper, detailed modal analysis has been carried out for this kind of TE volume modes to find out their novel and peculiar properties. From these numerical results, it has been clarified that dispersion curve of the lowest order mode for thicker slab has a frequency of turning point below which both forward and backward waves can be simultaneously observed and also there is a critical slab thickness for each order of TE volume modes to exist.

Since scan testing is not based on the function of the circuit, but rather the structure, it is considered to be both a form of over testing and under testing. Moreover, it is important to test VLSIs using the given function. Since the functional specifications are described explicitly in the FSMs, high test quality is expected by performing logical fault testing and timing fault testing. This paper proposes a fault-dependent test generation method to detect specified fault models completely and to increase defect coverage as much as possible under the test length constraint. We present experimental results for MCNC'91 benchmark circuits to evaluate bridging fault coverage, transition fault coverage, and statistical delay quality level and to show the effectiveness of the proposed test generation method compared with a stuck-at fault-dependent test generation method.

The present study proposes a quasi-static finite-difference time-domain (FDTD) method for dosimetry in humans due to contact current at low frequencies (10 kHz). Our attention focused on wave sources which can reduce computational time. The computational time was found to be reduced using a voltage source of a step function with smooth start. The computational time required for the proposed method was smaller than a quasi-static FDTD method proposed in a previous study. Comparison between our computational results and those in a previous study suggested the effectiveness of our proposal. The difference in in-situ electric field due to different human models was a factor of 2 or so.

In conventional preamble based channel estimation in OFDM/offset QAM (OFDM/OQAM) system, both the even index subcarriers and the odd index subcarriers are with identical value selected from { 1 } respectively to avoid inter-carrier interference (ICI), if and only if channel frequency response in neighbor few subcarriers remain invariable. However, it requires larger coherent bandwidth. In this paper, we propose an effective preamble design with ICI cancellation for channel estimation in OFDM/OQAM system. With this structure, we only utilize even (or odd) index of subcarriers as reference signal to avoid ICI, and then the channel information of remaining subcarriers can be estimated by the interpolation approach. Based on the sampling theorem, the mean square error (MSE) performance of the proposed preamble design is analyzed, where channel estimation performance is same for all subcarriers. Simulation and analytical results demonstrate that the proposed preamble design with ICI cancellation method outperforms the conventional one in term of channel estimation accuracy in OFDM/OQAM system.

This paper presents a numerical approach to the time-domain analysis of N-branch-line couplers. The approach is based on the modified central difference (MCD) method combined with internal boundary treatments, which consist of the time-domain scattering matrix for the three-port junction discontinuity. The behavior of the signal propagation including multiple reflections on the N-branch-line coupler with and without line loss is analyzed and demonstrated in the time domain. Additionally, the S-parameters obtained from Gaussian pulse responses of the N-branch-line directional couplers are shown. The simulated results are in good agreement with those of the commercial simulator.

A CMOS current-mode nth-switchable-root circuit composed of a compact logarithm circuit, a divide-by-n circuit, and a compact exponential circuit is proposed. The n can be selected from 5 values by three switches. Simulation results indicate that the compact nth-switchable-root circuit has a wide input-current range for relative errors less than 3%, low power dissipations below 630 µW, and high bandwidth over 330 MHz.

A method was developed for deriving the approximate global optimum of a nonlinear objective function with multiple local optimums. The objective function is expanded into a linear wave coefficient equation, so the problem of maximizing the objective function is reduced to that of maximizing a quadratic function with respect to the wave coefficients. Because a wave function expressed by the wave coefficients is used in the algorithm for maximizing the quadratic function, the algorithm is equivalent to a full search algorithm, i.e., one that searches in parallel for the global optimum in the whole domain of definition. Therefore, the global optimum is always derived. The method was evaluated for various objective functions, and computer simulation showed that a good approximation of the global optimum for each objective function can always be obtained.

Cooperative communication provides a new way of introducing spatial diversity to wireless systems. In order to increase the spectral efficiency of coded cooperative relaying system, the adaptive modulation technique is presented under Rayleigh fading channel in this paper. The source and relay adapt their modulation schemes based on the channel condition of all three links, i.e. source to relay, source to destination and relay to destination. Furthermore, since the available channel knowledge of the source to relay link is usually non-ideal at the destination in practice, a simplified estimation of this link quality is also given. Simulation demonstrates the effectiveness of the proposed technique in improving the data throughput.

A technique for computing the quotient (⌊ ab/n ⌋) of Euclidean divisions from the difference of two remainders (ab (mod n) - ab (mod n+1)) was proposed by Fischer and Seifert. The technique allows a 2-bit modular multiplication to work on most -bit modular multipliers. However, the cost of the quotient computation rises sharply when computing modular multiplications larger than 2 bits with a recursive approach. This paper addresses the computation cost and improves on previous 2-bit modular multiplication algorithms to return not only the remainder but also the quotient, resulting in an higher performance in the recursive approach, which becomes twice faster in the quadrupling case and four times faster in the octupling case. In addition to Euclidean multiplication, this paper proposes a new 2-bit Montgomery multiplication algorithm to return both of the remainder and the quotient.

This paper presents a single-chip speech dialogue module and its evaluation on a personal robot. This module is implemented on an application processor that was developed primarily for mobile phones to provide a compact size, low power-consumption, and low cost. It performs speech recognition with preprocessing functions such as direction-of-arrival (DOA) estimation, noise cancellation, beamforming with an array of microphones, and echo cancellation. Text-to-speech (TTS) conversion is also equipped with. Evaluation results obtained on a new personal robot, PaPeRo-mini, which is a scale-down version of PaPeRo, demonstrate an 85% correct rate in DOA estimation, and as much as 54% and 30% higher speech recognition rates in noisy environments and during robot utterances, respectively. These results are shown to be comparable to those obtained by PaPeRo.

Femto cell systems have been the one of the key technologies for ubiquitous networks, and some of them are already serviced by manufacturers. Femto base stations are deployed randomly and without pre-planning, so the femto system has a wider variation in topology than cellular networks. Therefore, a specialized resource assignment algorithm is essential for efficient performance of the femto cell. In this paper, we propose a realtime channel assignment algorithm for adapting to the varying environments, including new cell deployment or power switch off. Our algorithm is a form of a sequential graph coloring problem which outperforms other fixed allocation algorithms. Simulation results show realtime assignment has better performance than the fixed allocation when the wireless environment changes faster than the tracking operation time.

The theoretical studies conducted mainly by the author are reviewed on (1) derivation of arbitrary order moment equations and solutions of some equations, (2) scattering by many particles and the effective medium constant of random medium, (3) scattering by a conducting body in random media and (4) spatially partially-coherent wave scattering, with application to satellite communications, artificial material development, and sensing and radar technology. The leading research results are described with many references; and also unsolved subjects in the above four studies are touched.

Recently, a new multi-carrier CDMA (MC-CDMA) system with cyclic-shift orthogonal keying (CSOK) has been proposed and shown to be more spectral and power efficient than conventional MC-CDMA systems. In this paper, a novel extension called the multiplexed CSOK (MCSOK) MC-CDMA system is proposed to further increase the data rate while maintaining a low peak-to-average power ratio (PAPR). First, the data stream is divided into multiple parallel substreams that are mapped into QPSK-CSOK symbols in terms of cyclic shifted Chu sequences. Second, these sequences are repeated, modulated, summed, and placed on IFFT subcarriers, resulting in a constant-modulus multiplexed signal that preserves the desired orthogonality among substreams. The receiver performs frequency-domain equalization and uses efficient demultiplexing, despreading, and demapping schemes to detect the modulation symbols. Furthermore, an alternate MCSOK system configuration with high link quality is also presented. Simulations show that the proposed MCSOK system attains lower PAPR and BER, as compared to conventional MC-CDMA system using Walsh codes. Under a rich multipath environment, the high link quality configuration exhibits excellent performance with both diversity gain and MCSOK modulation gain.

A blind channel estimation algorithm based on the subspace method for single-input multiple-output (SIMO) orthogonal frequency division multiplexing (OFDM) systems is proposed in this letter. With the aid of a repetition index, the conventional algorithm is a special case of our algorithm. Compared with related studies, the proposed algorithm reduces the computational complexity of the SVD operation and is suitable for cyclic-prefix-free systems. In particular, the necessary condition of the proposed signal matrix to be full rank can be satisfied with fewer OFDM blocks. Simulation results demonstrate that the proposed algorithm outperforms conventional methods in normalized mean-square error.

A number of inter-cell interference coordination schemes have been proposed to mitigate the inter-cell interference problem for orthogonal frequency division multiple access (OFDMA) systems and among them, partial frequency reuse is considered one of the most promising approaches. In this paper, we propose an inter-cell interference mitigation scheme for an OFDMA downlink system, which makes use of both partial frequency reuse and soft handover. The basic idea of this hybrid scheme is to dynamically select between a partial frequency reuse scheme and a soft handover scheme to provide better signal quality for cell edge users. Compared with the standard partial frequency reuse scheme, simulation results show that approximately one quarter of cell edge users can get improvements in signal quality as well as link spectral efficiency from using the proposed hybrid scheme. We also observe that by using our approach, there is a significant cell edge throughput gain over the standard partial frequency reuse scheme. Furthermore, based on a well defined data rate fairness criterion, we show that our method achieves higher overall system capacity as compared with the standard partial frequency reuse scheme.

This paper proposes a compact hardware (H/W) implementation for the MISTY1 block cipher, which is one of the ISO/IEC 18033-3 standard encryption algorithms. In designing the compact H/W, we focused on optimizing the implementation of FO/FI/FL functions, which are the main components of MISTY1. For this optimization, we propose three new methods; reducing temporary registers for the FO function, shortening the critical path for the FI function, and merging the FL/FL-1 functions. According to our logic synthesis on a 0.18-µm CMOS standard cell library based on our proposed methods, the gate size is 3.4 Kgates, which is the smallest as far as we know.

Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O()-size public key, where signing and verifying have constant extra costs.

This paper introduces a new computational problem on a two-dimensional vector space, called the vector decomposition problem (VDP), which is mainly defined for designing cryptosystems using pairings on elliptic curves. We first show a relation between the VDP and the computational Diffie-Hellman problem (CDH). Specifically, we present a sufficient condition for the VDP on a two-dimensional vector space to be at least as hard as the CDH on a one-dimensional subspace. We also present a sufficient condition for the VDP with a fixed basis to have a trapdoor. We then give an example of vector spaces which satisfy both sufficient conditions and on which the CDH is assumed to be hard in previous work. In this sense, the intractability of the VDP is a reasonable assumption as that of the CDH.