A micromirror for an external cavity diode laser is described. The mirror is supported by two sets of parallel torsion bars enabling piston motion as well as rotation. These motions are for realizing continuous wavelength tuning. Adjusting two rotations electrically, the pivot of the mirror rotation can be controlled. The long stroke of the vertical comb is realized by the deep three-dimensional structure prepared by the wafer bending method.

We have fabricated a polymer solid-state microstructure for optical application by two-photon-induced polymerization technique. The photopolymerization resin contains conventional laser-dye and dendrimer. A dendrimer can encapsulate the laser-dyes, limiting cluster formation and intermolecular energy transfer, and promising a high level of optical gain. The effect can be extended to prepare an optically active microstructure using the two-photon-induced polymerization technique. We fabricated a polymeric microcavity, which consisted of < 400 nm-linewidth strips arranged in layer-by-layer structure. The periodic variation in the refractive index gave rise to Bragg reflection. A laser emission was measured in the microcavity under optical excitation. The spectral linewidth was about 0.1 nm above the lasing threshold. We investigate both the material functions in the molecular scale and controlling the device structure for desired applications such as a polymer distributed feedback structure.

Multilayered network interaction among various networks such as IP/MPLS packet networks and optical fiber networks are now achieved using generalized multiprotocol label switching (GMPLS) technology. One unique feature of GMPLS networks is that GMPLS packet-layer label switching paths (LSPs), such as IP/MPLS LSPs, sometimes tunnel through GMPLS lower layer LSPs such as optical fiber/lambda LSPs. One problem that occurs in this situation is protecting an important primary packet LSP by using a protection LSP that is physically separated from the primary LSP. The packet router has difficulty recognizing lower layer LSPs that are totally disjointed from the primary LSP. This is because, in a GMPLS's packet layer, a source router only differentiates one lower layer LSP from another, and does not check the disjointedness of segments through which the lower layer path passes. Sometimes, different lower LSPs pass through the same optical fiber, and a malfunction of one optical fiber sometimes causes many lower layer LSPs to malfunction at the same time. To solve this problem, a shared risk link group (SRLG) is introduced. Network links that belong to the same SRLG share a common physical resource. We apply this SRLG to the proposed hierarchically distributed path computation elements (HDPCEs) and achieve effective disjointed SRLG protection for important primary GMPLS packet paths.

ID-SP-M4M scheme means ID-based series-parallel multisignature schemes for multi-messages. In this paper, we investigate series-parallel multisignature schemes for multi-messages and propose an ID-SP-M4M scheme based on pairings in which signers in the same subgroup sign the same message, and those in different subgroups sign different messages. Our new scheme is an improvement over the series-parallel multisignature schemes introduced by Doi et al.[6]-[8] and subsequent results such as the schemes proposed by Burmester et al.[4] and the original protocols proposed by Tada [20],[21], in which only one message is to be signed. Furthermore, our ID-SP-M4M scheme is secure against forgery signature attack from parallel insiders under the BDH assumption.

We investigate the performance of a code division multiple access (CDMA) system employing local polynomial approximation (LPA) smart antenna under moving user scenario. A closed form for average signal to interference plus noise power ratio (SINR) is derived, where the angular velocity of a target user is invariant during an observation interval. This SINR is independent of user velocity, and consequently it induces the independence of bit error rate (BER) with respect to the user velocity, while the use of conventional smart antenna shows significant degradation in the system performance by moving user.

We propose a Fault-Tolerant Object Group framework that provides group management and fault-tolerance services for consistency maintenance and state transparency as well. Through a virtual home-network simulation, we validate that the FTOG framework supports both of the reliability and the stability of the distributed home-network systems.

In 2004, Tsuji and Shimizu proposed a one-time password authentication protocol, named 2GR (Two-Gene-Relation password authentication protocol). The design goal of the 2GR protocol is to eliminate the stolen-verifier attack on SAS-2 (Simple And Secure password authentication protocol, ver.2) and the theft attack on ROSI (RObust and SImple password authentication protocol). Tsuji and Shimizu claimed that in the 2GR an attacker who has stolen the verifiers from the server cannot impersonate a legitimate user. This paper, however, will point out that the 2GR protocol is still vulnerable to an impersonation attack, in which any attacker can, without stealing the verifiers, masquerade as a legitimate user.

Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making design and verification difficult tasks. In this work, we propose a synchronization verification method for system-level designs described in the SpecC language. Instead of modeling the design with timed FSMs and using a model checker for timed automata (such as UPPAAL or KRONOS), we formulate the timing constraints with equalities/inequalities that can be solved by integer linear programming (ILP) tools. Verification is conducted in two steps. First, similar to other software model checkers, we compute the reachability of an error state in the absence of timing constraints. Then, if a path to an error state exists, its feasibility is checked by using the ILP solver to evaluate the timing constraints along the path. This approach can drastically increase the sizes of the designs that can be verified. Abstraction and abstraction refinement techniques based on the Counterexample-Guided Abstraction Refinement (CEGAR) paradigm are applied.

The rapidly increasing bandwidth requirements of IP traffic mean that networks based on optical technologies in conjunction with IP routing technologies will provide the backbone of the next generation Internet. One of the major issues is how to construct an optical-technology-based backbone network that offers the economical transport of large-scale IP/MPLS services while achieving reliable, robust network. The key to achieving this objective lies in multilayer coordination technologies using Multi-Layer Service Network [MLSN] Architecture, that we previously proposed [2]. One of the important aspects of MLSN architecture is ability to effectively use GMPLS network resources by IP/MPLS service networks. We propose extensions to previously proposed MLSN architecture. The proposed extensions to MLSN architecture are tailored to address "service virtualization and separation" of various service networks over GMPLS backbone. As a part of this extended MLSN architecture, we introduce novel concepts known as Logical Router (LR) and Virtual Router (VR) that would enable border router to be services domain router, so that it can connect multiple service networks such as L2VPN, L3VPN etc., over GMPLS backbone by offering service separation or virtualization. This service separation/isolation greatly enhances the reliability of next generation networks, as any failure on one service should be isolated from others. We evaluate our extended network architecture against requirements for the large scale network targeting at introducing such new technology to cope with vast traffic explosion and challenges in operation and service provision sophistication.

Cooperative diversity represents an effective way of combating multipath fading through inter-terminal cooperation in wireless networks. In this letter, we propose a new participation strategy that increases the chance of cooperation and present the closed-form expression for outage probability. Numerical results demonstrate that new participation strategy improves the outage performance.

In wide-band code division multiple access (WCDMA), orthogonal variable spreading factors (OVSF) codes are assigned to different users to preserve the orthogonality between users' physical channels. In this letter, we present the dual OVSF code, which can transmit the variable data rates by suing two different modulated signals without loss of the orthogonality. The bit error rate (BER) performance under a multi-user environment suffering the additive white Gaussian noise (AWGN) channel and correlations of those codes are evaluated. The results demonstrate that the proposed dual OVSF scheme could provide flexible rates and lower correlation values with a slight increase in complexity.

The Erlang capacity of multi-service multi-access systems supporting several different radio access technologies was analyzed and compared according to two different operation methods: the separate and common operation methods, by simultaneously considering the link capacity limit per sector as well as channel element (CE) limit in a base station (BS). In a numerical example with GSM-like and WCDMA-like sub-systems, it is shown that we can get up to 60% Erlang capacity improvement through the common operation method using a near optimum so-called service-based user assignment scheme when there is no CE limit in BS. Even with the worst-case assignment scheme, we can still get about 15% capacity improvement over the separate operation method. However, a limited number of CEs in BS reduces the capacity gains of multi-service multi-access systems in both the common operation and separate operation. In order to fully extract the Erlang capacity of multi-service multi-access systems, an efficient method is needed in order to select a proper number of CE in BS while minimizing the equipment cost.

A multiple-places reservation discipline is studied in a discrete-time priority queueing system. We obtain the joint distribution of system state, from which the delays of high and low priority packets are derived. Comparison is made with the cases of FIFO, single-place reservation discipline and HOL priority.

Adaptive voltage management (AVM) scheme is proposed for worst-caseless lower voltage SoC design. The AVM scheme detects the temperature accurately by using two oscillators with different temperature characteristics, and sets supply voltage most suitable with a table look-up method corresponding to the process variation. Also, the AVM can supply the stable voltage with a local shift type regulator even at lower voltage. Thereby, this supply-voltage control system considering PVT variations can control the internal voltage corresponding to process and temperature variations and can realize a wide-operating-margin, DFM function for low voltage SoC. The experimental chip is fabricated on a 90 nm CMOS process, and it was confirmed that the proposed architecture controls the voltage accurately and has a wide operating margin at a lower voltage.

Outdoor wireless services quality is greatly tarnished by the existence of coverage blind spots or any areas of inadequate reception. It is thus of interest to eliminate or fill in the blind spots in order to boost the receiving signal strength which ultimately leads to better service quality. The authors propose the use of a simple flat metallic reflector as a device to divert some energy in the service coverage towards the blind spots or any existing areas of inadequate reception. The method of moment is employed in analysing the effectiveness of the authors' proposed technique. Experiments have been carried out to verify calculation results as well as to find out on the proposed technique's viability. It is found that the elimination of blind spots by using a reflector is a viable approach. The received power at the blind spot locations are increased by about 3 dB to 5 dB when the reflector is present.

We have developed a spread-spectrum Phase-Locked Loop (PLL) for serial Advanced Technology Attachment (ATA) applications. We investigated the relation between the output jitter of PLLs in serial ATA applications and ΣΔ modulators in PLLs. On the basis of this study, we developed a spread-spectrum PLL for serial ATA applications and achieved a combination of small jitter and large electromagnetic interference (EMI) peak power reduction. This was achieved using two key components: multi-bit ΣΔ-controlled PLL and voltage-controlled oscillation with cross-coupled load delay cells. Using a 0.15-µm complementary metal-oxide semiconductor process, we fabricated a complete serial ATA transceiver featuring a spread-spectrum clock generator (SSCG). We achieved a spread-spectrum PLL with 10-dB EMI reduction and 8.1 ps random jitter for use in serial ATA applications. All other measured results for SSCG performance were very good and showed that the spread-spectrum generator more than satisfies serial ATA specifications.

Most commercial Web sites dynamically generate their contents through a three-tier server architecture composed of a Web server, an application server, and a database server. In such an architecture, the database server easily becomes a bottleneck to the overall performance. In this paper, we propose WDBAccel, a high-performance database server accelerator that significantly improves the throughput of database processing. WDBAccel eliminates costly, complex query processing needed to obtain query results by reusing the results from previous queries for subsequent queries. This differentiates WDBAccel from other database cache systems, which employ traditional query processing. WDBAccel further improves its performance by fully utilizing main memory as the primary storage. This paper presents the design and implementation of the WDBAccel as well as the results of performance evaluation with a prototype.

Multi-context FPGAs (MC-FPGAs) have multiple memory bits per configuration bit forming configuration planes for fast switching between contexts. The additional memory planes cause a large overhead in area when a number of contexts are used. To overcome the overhead, a fine-grained MC-FPGA architecture using a floating-gate-MOS functional pass gate (FGFP) is presented which merges threshold operation and storage function on a single floating-gate MOS transistor. The test chip is designed using a 0.35 µm CMOS-EPROM technology. The transistor count of the proposed multi-context switch (MC-switch) is reduced to 13% in comparison with SRAM-based one. The total area of the proposed MC-FPGA is reduced to about 56% of that of a conventional SRAM-based MC-FPGA.

It is well known that the diversity gain attained by DCA (Dynamic Channel Allocation) is generally very high over OFDM (Orthogonal Frequency Division Multiplexing)-based broadband networks. This paper introduces a numerical approach for measuring the performance gain afforded by DCA. In the mathematical analysis, the property of order statistics is adopted to derive the upper bound of the expected throughput via the use of DCA. In the simulation, it was possible to achieve a gain of 5 dB by exploiting multi-user and spectral diversities when the number of users is 16 and the total number of subcarriers is 256.

Orthogonal Frequency Division Multiple Access (OFDMA) allows multiple users to make use of the same bandwidth as the single-user OFDM for data transmission and is a promising candidate to be used for future cellular systems. A key issue at hand is the rate-adaptive resource allocation problem. In this paper, we propose two basic subcarrier allocation schemes with low complexities based on the magnitude of the channel frequency responses. The proposed algorithms ensure a fair resource allocation in terms of the number of subcarriers with affordable bit-rates. Through extensive discussions and Monte Carlo simulations, a comprehensive comparison with previously derived subcarrier allocation schemes is performed which depicts the pros and cons of our proposed algorithms.