Satoshi IWAMOTO Yasuhiko ARAKAWA
We discuss photonic crystals (PhCs) with advanced micro/nano-structres which are semiconductor quantum dots (QDs) and micro electro-mechanical systems (MEMS) for the purpose of realizing novel classes of PhC devices in future photonic network system. After brief introduction on advantages to implement QDs and MEMS with PhCs, we discuss optical characterization of PhC microcavity containing self-assembled InAs QDs. Modification of emission spectrum of a QD ensemble due to the resonant cavity modes is demonstrated. We also point out the feasibility of low-threshold PhC lasers with QD active media in numerical analysis. A very low threshold current of 10 µA is numerically obtained for lasing action in the multi dimensional distributed feedback mode by using realistic material parameters. Then, the basic concept for MEMS-controlled PhC slab devices is described. We show numerical results that demonstrate some of interesting functions such as the intensity modulation and the tuning of resonant frequency of cavity mode. Finally, a preliminary experiment of MEMS-based switching operation in a PhC line-defect waveguide is demonstrated.
Takeru INOUE Noriyuki TAKAHASHI Toshiaki MIYAZAKI
The exciting goals of ubiquitous computing and communication services can only be achieved if we can increase the efficiency with which the location of mobile terminals can be managed; current mobile infrastructures are not efficient since they treat all mobile terminals uniformly despite that fact that many mobiles often move together (i.e. passengers on the same train or a group of cars on a road). This paper presents a hierarchical location management scheme that handles such grouped mobiles collectively and so reduces the overhead costs of location management. In our scheme, mobiles that move together for long enough form a mobile network and make a hierarchy in the wireless access network. The scheme also adjusts the number of mobile networks to keep communication overhead low. We apply the scheme to Mobile IPv6 and evaluate the resulting performance improvement. Simulation results confirm that our hierarchical approach can greatly reduce the overhead costs of location management, and that it is very practical since it can flexibly develop suitable mobile networks.
Ann-Chen CHANG Chiao-Chan HUANG Zhi-Feng HUANG
Two simple frequency offset estimators based on projection approaches for multicarrier code-division multiple access systems are proposed, without using specific training sequences. It is not only can estimate and correct frequency offset, but also has less computational load. Several computer simulations are provided for illustrating the effectiveness of the blind estimate approaches.
Takahiro INOUE Eizo ICHIHARA Toshitaka YAMAKAWA Akio TSUNEDA
A simple CMOS Vth-adjustment method for a common-source floating-gate MOSFET(FG-MOSFET) is proposed. The apparent threshold voltage Vtha of an FG-MOSFET can be defined by a reference voltage Vref and/or a reference current Iref being almost irrelevant to the pre-stored charge on the floating gate.
Takaki YOSHIDA Masafumi WATARI
As semiconductor manufacturing technology advances, power dissipation and noise in scan testing have become critical problems. Our studies on practical LSI manufacturing show that power supply voltage drop causes testing problems during shift operations in scan testing. In this paper, we present a new testing method named MD-SCAN (Multi-Duty SCAN) which solves power supply voltage drop problems, as well as its experimental results applied to practical LSI chips.
Antonio NOGUEIRA Paulo SALVADOR Rui VALADAS Antonio PACHECO
Measuring and modeling network traffic is of key importance for the traffic engineering of IP networks, due to the growing diversity of multimedia applications and the need to efficiently support QoS differentiation in the network. Several recent measurements have shown that Internet traffic may incorporate long-range dependence and self-similar characteristics, which can have significant impact on network performance. Self-similar traffic shows variability over many time scales, and this behavior must be taken into account for accurate prediction of network performance. In this paper, we propose a new parameter fitting procedure for a superposition of Markov Modulated Poisson Processes (MMPPs), which is able to capture self-similarity over a range of time scales. The fitting procedure matches the complete distribution of the arrival process at each time scale of interest. We evaluate the procedure by comparing the Hurst parameter, the probability mass function at each time scale, and the queuing behavior (as assessed by the loss probability and average waiting time), corresponding to measured traffic traces and to traces synthesized according to the proposed model. We consider three measured traffic traces, all exhibiting self-similar behavior: the well-known pOct Bellcore trace, a trace of aggregated IP WAN traffic, and a trace corresponding to the popular file sharing application Kazaa. Our results show that the proposed fitting procedure is able to match closely the distribution over the time scales present in data, leading to an accurate prediction of the queuing behavior.
A novel modified midtread quantizer is proposed for number-controlled oscillator frequency quantization in digital phase-locked loops (DPLLs). We show that DPLLs employing the proposed quantizer provide significantly improved cycle slip performance compared to those employing conventional midtread or midrise quantizers, especially when the number of quantization bits is small and the magnitude of input signal frequency normalized by the quantization interval is less than 0.5.
Hitomi TAMURA Kenji KAWAHARA Yuji OIE
As the Internet grows, various types of traffic, such as voice, video and data, are transmitted. Therefore, the Internet should provide the Quality of Service (QoS) required by each type of traffic as well as end-to-end connectivity, and routing decisions should be based on the utilization of links/routers and/or the application types of traffic. This kind of routing is called Traffic Engineering (TE), and its objective is to improve such performance factors as flow loss probability for users and the utilization of links for networks, simultaneously. Some studies claim that the Multi-Protocol Label Switching (MPLS) technique can easily implement TE. So far, some experimental results show that TE is effective on a MPLS network; however, its performance has not been theoretically and quantitatively analyzed. Thus, in this paper, we will investigate the basic and preliminary performance of MPLS networks with TE by analyzing flow loss probability and Smoothness index of link utilization in the queueing system.
In this paper, we propose a preemptive test scheduling technique (a test can be interrupted and later resumed) for core-based systems with the objective to minimize the test application time. We make use of reconfigurable core test wrappers in order to increase the flexibility in the scheduling process. The advantage with such a wrapper is that it is not limited to a single TAM (test access mechanism) bandwidth (wrapper chain configuration) at each core. We model the scheduling problem as a Bin-packing problem, and we discuss the transformation: number of TAM wires (wrapper-chains) versus test time in combination with preemption, as well as the possibilities and the limitations to achieve an optimal solution in respect to test application time. We have implemented the proposed preemptive test scheduling algorithm, and we have through experiments demonstrated its efficiency.
Hideaki YOSHIFUJI Kazunori MIYAZAWA Masahide NAKAMURA Yuji SEKIYA Hiroshi ESAKI Jun MURAI
IPv6 is realized as the next generation internet platform, succeeding the current IPv4 internet environment. Linux, one of the major operating systems, has supported IPv6 since 1996, however, the quality of the protocol stack has not been good enough for professional operation. In this paper, we show our IPv6 stack implementation design regarding the neighbor management in Neighbor Discovery Protocol (NDP), the routing table management and the packet processing using XFRM architecture. The implementation is designed based on the Serialized Data State Processing, which aims at simpler object management so as to achieve stable, flexible and extensible IPv6 stack. According to the TAHI IPv6 Protocol Conformance Test Suite, we can show our implementation achieves enough implementation quality.
Yung-Lyul LEE Hyun JO Ki-Hun HAN
Two fast quarter-pixel motion estimation algorithms using the integer motion vector (MV) already obtained by any fast motion estimation algorithm are proposed, which perform MV search only in half-pixel and quarter-pixel unit. The proposed algorithms search MV about 4-9 times as fast as the full search in quarter-pixel unit, while the PSNR is slightly degraded.
Viterbi search engine in speech recognition consumes many computation time and hardware resource for finding maximum likelihood in HMM (Hidden Markov Model). We propose a fast Viterbi search engine using IHMM (Inverse Hidden Markov Model). A benefit of this method is that we can remove redundant computation of path matrix. The power consumption and the computational time are reduced by 68.6% at the 72.9% increase in terms of the number of gates.
Takasuke TSUJI Akihiro SHIMIZU
Software applications for the transfer of money or personal information are increasingly common on the Internet. These applications require user authentication for confirming legitimate users. One-time password authentication methods risk a stolen-verifier problem or other steal attacks because the authentication on the Internet server stores the user's verifiers and secret keys. The SAS-2 (Simple And Secure password authentication protocol, ver.2) and the ROSI (RObust and SImple password authentication protocol) are secure password authentication protocols. However, we have found attacks on SAS-2 and ROSI. Here, we propose a new method which eliminates such problems without increasing the processing load and can perform high security level same as S/Key systems without resetting the verifier.
Ryuji WAKIKAWA Susumu KOSHIBA Thierry ERNST Julien CHARBON Keisuke UEHARA Jun MURAI
In this paper, we discuss the performance of a basic scheme to support network mobility. Network mobility arises when an entire network segment, such as a network inside a vehicle, changes its topological location and thus its access point to the fixed backbone network. Mechanisms to support network mobility are necessary to maintain sessions. The approach followed by the IETF (NEMO Basic Support) and us (B-ORC) is to establish a bi-directional tunnel between the mobile network and the Internet. As we show, this bi-directional tunnel is a performance bottleneck and leads to single points of failure. In order to address the issues of the existing mobile network architecture, we propose enhanced operations of the basic mobile network protocol to achieve reliability and efficiency: (1) multiple bi-directional tunnels between the mobile network and the Internet, and (2) policy-based routing. The proposed operations could be realized by extending the existing architecture and protocol. The performance of various multihoming configurations is evaluated based on the implementation of our own basic scheme. The evaluation criteria are delay, throughput and latency. The results are encouraging and show we can achieve a better throughput.
Shinya MIYAJIMA Masahide KASHIWAGI
Interval arithmetic is able to be applied when we include the ranges of various functions. When we include them applying the interval arithmetic, the serious problem that the widths of the range inclusions increase extremely exists. In range inclusion of polynomials particularly, Horner's method and Alefeld's method are well known as the conventional methods which mitigates this problem. The purpose of this paper is to propose the new methods which are able to mitigate this problem more efficiently than the conventional methods. And in this paper, we show and compare the efficiencies of the new methods by some numerical examples.
Koichi ITO Hiroshi NAKAJIMA Koji KOBAYASHI Takafumi AOKI Tatsuo HIGUCHI
This paper presents an algorithm for fingerprint matching using the Phase-Only Correlation (POC) function. One of the most difficult problems in human identification by fingerprints has been that the matching performance is significantly influenced by fingertip surface condition, which may vary depending on environmental or personal causes. This paper proposes a new fingerprint matching algorithm using phase spectra of fingerprint images. The proposed algorithm is highly robust against fingerprint image degradation due to inadequate fingertip conditions. A set of experiments is carried out using fingerprint images captured by a pressure sensitive fingerprint sensor. The proposed algorithm exhibits efficient identification performance even for difficult fingerprint images that could not be identified by the conventional matching algorithms.
Miguel FRANKLIN DE CASTRO Lela MERGHEM Dominique GAITI Abdallah M'HAMED
The new Internet has to provide the Quality of Services to converged multimedia services, in which each one may choose its own requirements. Managing such a dynamic network is not an easy task. A more intelligent and adaptive behavior is required from network management. We argue that agents are able to realize this task by dynamically adapting management mechanisms to the current network conditions. This article presents a Behavioral Multi-Agent-based model for QoS-enabled Internet. Based on this behavioral approach, we analyze network management mechanisms (or "elementary behaviors") in terms of performance and applicability profile. We use simulation to observe services performances when submitted to diverse QoS management elementary behaviors.
Satoshi UEMURA Miki HASEYAMA Hideo KITAJIMA
This letter presents a significant property of the mapping parameters that play a central role to represent a given signal in Fractal Interpolation Functions (FIF). Thanks to our theoretical analysis, it is derived that the mapping parameters required to represent a given signal are also applicable to represent the upsampled signal of a given one. Furthermore, the upsampled signal obtained by using the property represents the self-affine property more distinctly than the given signal. Experiments show the validity and usefulness of the significant property.
Masanobu HIROSE Takayuki ISHIZONE Koji KOMIYAMA
We have shown that a photonic sensor can be used as an electric-field probe for planar near-field measurements of X-band antennas. Because an antenna on the photonic sensor is small (about 0.1 λ) compared to the wavelength, the photonic sensor can directly measure the amplitude and the phase of the electric field close (about 0.3 λ) to the apertures of antennas without disturbing the electric field to be measured. Therefore we can obtain the antenna pattern by transforming the measured electric field without probe compensation. To verify the merits of the photonic sensor, we have evaluated the antenna patterns of a standard gain horn antenna and a microstrip array antenna at 9.41 GHz. Comparing the results obtained using the photonic sensor with those obtained using the conventional open-ended waveguide probe and other methods, we have shown that the antenna patterns agree with each other within 1 dB over wide ranges of directivity.
In this letter, we propose an enhanced time-based registration method and analyze the performance numerically. In the analysis, we assume Poisson call arrival distribution and exponential cell resident time. The performance of the enhanced time-based registration method is compared with the performance of the original time-based registration method. In the comparisons, we see that in a certain range of parameters, the enhanced time-based registration method has better performance.