By means of the three-dimensional (3D) finite-difference time domain (FDTD) method, we have investigated in detail the optical properties of a two-dimensional photonic crystal (PC) surface-emitting laser having a square-lattice structure. The 3D-FDTD calculation is carried out for the finite size PC slab structure. The device is based on band-edge resonance, and plural band edges are present at the corresponding band edge point. For these band edges, we calculate the mode profile in the PC slab, far field pattern (FFP) and polarization mode of the surface-emitted component, and photon lifetime. FFPs are shown to be influenced by the finiteness of the structure. Quality (Q) factor, which is a dimensionless quantity representing photon lifetime, is introduced. The out-plane radiation loss in the direction normal to the PC plane greatly influences the total Q factor of resonant mode and is closely related with the band structure. As a result, Q factors clearly differ among these band edges. These results suggest that these band edges include resonant modes that are easy to lase and resonant modes that are difficult to lase.

This paper deals with optimizing end-to-end window control algorithms that achieve proportional fairness in the long run, and also investigating their steady state and transient or short-term fairness. An abstracted stochastic model of a bottlenecked connection is employed and the window control is designed to minimize the buffer queue variance while keeping the mean queue level at a target value, taking the round-trip delay into account. An optimal minimum variance window control algorithm and its generalized version are derived with the major aim of reducing the window size fluctuations. A relation between the generalized version and the (p, 1) proportionally fair algorithm is investigated. Also we derive the stability limits of the generalized minimum variance window control algorithm which can be useful during network design. The effects of both the target queue length and a weighting parameter on the steady state and short-term fairness, as measured by Jain's fairness and short-term fairness indices, calculated over short time intervals, are investigated by simulation. The generalized algorithm has better fairness properties as compared to existing algorithms such as that employed in TCP Vegas.

We demonstrate a simple BER monitoring method for WDM signals. Newly developed 32-channel wavelength selector based on thermo-optic switch and AWG is used. The BER of each channel is estimated from opened eye-diagrams obtained by asynchronous sampling. Good BER monitoring performance is confirmed.

We propose a novel optical signal processing using an optically pumped vertical-cavity surface-emitting laser (VCSEL) with an external light input. The mode transition between a fundamental and a 1st-high-order transverse mode is induced by an external light injection. Since a single mode fiber (SMF) spatially selects a fundamental transverse mode as an output signal, we are able to realize a nonlinear transfer function, which will be useful in future photonic networks. The mode transition characteristic of a 1.55 µm optically pumped two-mode VCSEL has been simulated by using a two-mode rate equation, which includes the effects of spatial hole burning and spectral hole burning as gain saturation coefficients. We focus on the detuning effect in the injection locking. When the wavelength of an input light with a fundamental mode is slightly longer than that of a VCSEL operating in a 1st-high-order transverse mode, the transverse mode of the VCSEL is switched to a fundamental mode at a critical input power level. This gives us an ideal transfer function for 2R (reamplification and reshaping) regeneration. Also, the proposed scheme may enable polarization insensitive signal processing, which is a unique feature in surface emitting lasers.

In this paper, test time reduction for IDDQ testing is discussed. Although IDDQ testing is known to be effective to detect faults in CMOS circuit, test time of IDDQ testing is larger than that of logic testing since supply current is measured after a circuit is in its quiescent state. It is shown by simulation that test time of IDDQ test mostly depends on switching current. A procedure to modify test vectors and a procedure to arrange test vectors are presented for reducing the test time of IDDQ testing. A test sequence is modified such that switching current quickly disappears. The procedure utilizes a unit delay model to estimate the time of the last transition of logic value from L to H in a circuit. Experimental results for benchmark circuits show the effectiveness of the procedure.

In this paper, we analyze behaviors of bridging faults in CMOS synchronous sequential circuits based on transient analysis. From analysis results, we expose dynamic and analog behaviors of the circuit caused by the bridging faults, which are oscillation, asynchronous sequential behavior, IDDT failure and IDDQ failure as well as logic error. In order to detect this kind of fault, we show that not only IDDQ testing but also IDDT testing and logic testing which guarantees correct state transitions are required.

When a feedback bridging fault occurs in a combinational circuit and it is activated, logical oscillation may occur in the circuit. In this paper, some electrical conditions are proposed to identify whether a feedback bridging fault occurs logical oscillation. Also, it is proposed how to estimate the oscillation frequency. They are based on piece linearlized models and do not require circuit simulation of large size of circuits. They are evaluated by some experiments. In the experiments, all of the feedback bridging faults occurring logical oscillation are identified. Also, oscillation frequencies larger than the ones obtained by SPICE simulation are derived by the proposed estimation method in the experiments. It promises us that the methods will be used for identifying such bridging faults and estimating the oscillation frequencies.

We develop a non-concurrent single-failure occurring model, a restoration scheme based on adaptively-decided sub-lightpath rerouting algorithm is then proposed, which aims to achieve better service guaranty with less network status information.

The formation of single monolayer of liquid crystalline molecules, 4-n-pentyl-4-cyanobiphenyl (5CB), deposited by the evaporation method in the air, was confirmed with the surface potential measurement. The surface potential increased with the time of evaporation, and the 3- or 4-minute evaporation at a source temperature of 110 gave the saturated potential, indicating the formation of single monolayer. Single monolayer formation was also supported by the comparison of the UV-visible absorption for evaporated film with LB monolayer. Positive potentials were built at the surface, indicating that CN group faces the substrate.

The deposition conditions of Y0.9Ba1.9La0.2Cu3Oy (La-YBCO) and (LaAlO3)0.3-(SrAl0.5Ta0.5O3)0.7 (LSAT) thin films were studied with the aim of fabricating ramp-edge Josephson junctions on a superconducting ground plane. These films were deposited by a magnetron sputtering method and utilized as a base electrode and an insulating layer under the electrode, respectively. YBa2Cu3Oy thick films grown by liquid phase epitaxy (LPE-YBCO) were used for a ground plane. Insertion of a SrTiO3 buffer layer between LSAT and LPE-YBCO significantly improved the flatness of the film surface. La-YBCO films with a flat surface and Tc (zero) of 87K were reproducibly obtained by DC sputtering. We have fabricated ramp-edge Josephson junctions using these films. Resistively and capacitively shunted junction (RCSJ)-like characteristics were observed in them. An Ic spread of 10.2% (at 4.2K, average Ic = 0.5 mA) was obtained for a 1000-junction series-array.

A computationally efficient time delay and Doppler estimation algorithm is proposed for active sonar with a Linear Frequency Modulated (LFM) signal. To reduce the computational burden of the conventional estimation algorithm, an algebraic equation is used which represents the relationship between the time delay and the Doppler in the cross-ambiguity function (CAF) of the LFM signal. The algebraic equation is derived based on the Fast Maximum Likelihood (FML) algorithm. The use of this algebraic relation enables the time delay and Doppler to be estimated with two 1-D searches instead of the conventional 2-D search.

This paper proposes a new decision feedback decoding scheme for Alamouti-based space-time block coding (STBC) transmission over time-selective fading channels. In wireless channels, time-selective fading effects arise mainly due to Doppler shift and carrier frequency offset. Modelling the time-selective fading channels as the first-order Gauss-Markov processes, we use recursive algorithms such as Kalman filtering, LMS and RLS algorithms for channel tracking. The proposed scheme consists of the symbol decoding stage and channel tracking algorithms. Computer simulations confirm that the proposed scheme shows the better performance and robustness to time-selectivity.

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction of a minimum spanning tree, and pruning unnecessary links and processes. Competitiveness is 2(1-1/l), where l is the number of leaves of optimal solution.

Vector quantization (VQ) features a very heavy encoding process. In previous work, an efficient encoding algorithm using mean pyramid has been developed. To improve it further, a fast search algorithm is proposed in this letter. Specifically speaking, four major modifications are made. First, to rearrange the original codebook directly along the sorted real sums to reduce the search scope and then update the lower and upper bound dynamically. Second, to use sum instead of the mean that includes roundoff error to thoroughly avoid a possible mismatched winner. Third, to construct a sum pyramid using 2-pixel-merging other than 4-pixel-merging way to generate more in-between levels. Fourth, to introduce the Cauchy-Schwarz inequality to bridge Euclidean and Manhattan distance together so that the difference check between 2 vectors can be pre-conducted only by much lighter Manhattan distance computation. Experimental results show that the proposed algorithm is more search-efficient.

This letter presents a new concatenated code and a new criterion for the new concatenated code in fast Rayleigh fading channel. The new concatenated code consists of the cascade of a new space-time trellis code (STTC) as an inner code and a new convolutional code as an outer code. The new criterion maximizes the minimum free distance for the new convolutional code and both the minimum trace and the average trace of distance matrix for the new STTC. The new concatenated code improves the frame error rate (FER) performance significantly with low complexity. The new STTC and convolutional code are designed so as to satisfy the new criterion for 4-state 4 phase shift keying (PSK). The results of the suggested concatenated code are obtained using two transmit antennas, and shown to be significantly superior to the new and existing STTCs. As the number of receive antennas increases, the performance of the new concatenated code significantly improves, for instance, reaches FER = 10-3 at signal-to-noise ratio (SNR) = 5.2 dB for four receive antennas. Note that the proposed concatenated code also improves significant FER performance by using only one receive antenna for high SNR.

In this paper, we consider a problem of global stabilization of a class of nonlinear systems which are approximately feedback linearizable. We propose a control law with the gain-scaling factor and analytically show the robust aspect of approximate feedback linearization in a more general framework.

In this paper, the average bit error probability of uplink and downlink Multicarrier Code Division Multiple Access (MC-CDMA) system using coherent Maximal-Ratio Combining (MRC) and Equal Gain Combining (EGC) receivers is evaluated for frequency selective Nakagami fading channels. The analysis assumes that different subcarriers experience independent fading channels, but not necessary identically distributed. The analysis is based on Gaussian approximation of the multiple access interference. Generalized bit error probability (BEP) expressions for both uplink and downlink with MRC and EGC receivers were derived. The analytical results are supported with simulation results. The effect of fading parameters, number of users, and number of subcarriers were presented. The BEP performance of the EGC receiver in the uplink is highly influenced by the fading parameter compared with the MRC receiver. The EGC receiver outperforms the MRC receiver in the downlink, but the MRC receiver gives almost the same performance as the EGC in the uplink.

This letter presents a novel two-dimensional (2-D) defected ground array (DGA) for planar circuits, which has horizontal and vertical periodicities of defect structure. The defect unit cell of DGA is composed of a Sierpinski carpet structure to improve the effective inductance. Measurements show that the proposed DGA provides steeper cutoff characteristics, lower cutoff frequency, and higher slow-wave factors than the conventional periodic defected ground structure in the same occupied surface.

This paper proposes an efficient fair queuing algorithm, called Medium Starting Potential Fair Queuing (MSPFQ), which has O(1) complexity for the virtual time computation while it has delay and fairness properties similar to Starting-Potential Fair Queueing (SPFQ). The key idea of MSPFQ algorithm is that it recalibrates the system virtual time to the medium value of the minimum possible virtual start times of HOL packets in each backlogged session. We show that MSPFQ belongs to the class of Rate-Proportional Server (RPS). In addition, we analytically prove that our algorithm has good delay and fairness properties.

This paper discusses research into the capacity dimensioning of Virtual Private Network (VPN) access links for elastic traffic, such as the Web or ftp. Assuming that the core-VPN network is provisioned with a sufficiently large capacity, managing the capacity of the VPN access link comes to sharing the bandwidth for the elastic traffic of the two bottlenecks, the ingress and egress access links. In the case of a single bottleneck with a limited capacity for access links, the processor-sharing model provides a simple formula for mean transfer time, but here, the value may be less than the actual transfer time because multiple flow may compete the bandwidth of both ingress and egress links. In contrast, max-min fair sharing provides an accurate sharing model which is similar to the TCP, but it is difficult to obtain a closed form for performance statistics. We propose a closed form approximation for a max-min fair sharing model, within a specific but realistic topology, through an investigation into the difference between the max-min and the processor sharing model. Using approximation, we calculate the capacity dimensioning of VPN access links.