The handoff in Mobile IP networks causes packet sequence disruption during a packet forwarding procedure and may result in performance degradation in higher layer protocols. We investigate the impact of handoff in the Mobile IPv6 networks, where an optimized routing with the smooth handoff is adopted. The impact on the packet sequence is measured by an 'unstable time period (UTP)' and a 'silence time period (STP).' The UTP explains the time duration of out-of-sequence packets while the STP reflects the blackout duration of a mobile node after the initiation of handoff procedure. With the analysis on the UTP and STP, the total transient time period (denoted as handoff time period or HTP) after the handoff initiation can be estimated. In our previous work, focusing on the UTP, the packet flow sequence under the smooth handoff is analyzed for the Mobile IPv4 networks. The proposed queuing-based analysis is extended in this work for the Mobile IPv6 networks. That is, several modifications are made to conform to Mobile IPv6 and at the same time the queuing analysis itself is improved to better model the handoff procedure. The numerical results show that the queuing delay for the handoff packets (affected by background traffic) and the involved link (or route) capacities affect the estimated UTP, STP, and HTP. In addition, two schemes such as priority queuing and buffered packet forwarding are introduced to reduce the transient period and the improvements are analyzed for comparison.

The multimedia applications have recently generated much interest in wireless network infrastructure with supporting the quality-of-service (QoS) communications. In this paper, we propose a lantern-tree-based QoS on-demand multicast protocol for wireless ad hoc networks. Our proposed scheme offers a bandwidth routing protocol for QoS support in a multihop mobile network, where the MAC sub-layer adopts the CDMA-over-TDMA channel model. The QoS on-demand multicast protocol determines the end-to-end bandwidth calculation and bandwidth allocation from a source to a group of destinations. In this paper, we identify a lantern-tree for developing the QoS multicast protocol to satisfy certain bandwidth requirement, while the lantern-tree is served as the multicast-tree. Our lantern-tree-based scheme offers a higher success rate to construct the QoS multicast tree due to using the lantern-tree. The lantern-tree is a tree whose sub-path is constituted by the lantern-path, where the lantern-path is a kind of multi-path structure. This obviously improves the success rate by means of multi-path routing. In particular, our proposed scheme can be easily applied to most existing on-demand multicast protocols. Performance analysis results demonstrate the achievements of our proposed protocol.

One of the key issues in the next generation Internet is end-to-end Quality of Service (QoS) provisioning for real-time applications. The Differentiated Services (DiffServ) architecture offers a scalable alternative to provide QoS in the Internet. However, within this architecture, an efficient scheduling mechanism is still needed to ensure such QoS guarantees. In this paper, scheduling mechanism for supporting QoS differentiation among multiple traffic classes in IP differentiated services networks is studied. A scheduling algorithm called Multiclass Efficient Packet Fair Queueing (MEPFQ) is proposed that enables fair bandwidth sharing while supporting better bounds on end-to-end network delay for QoS-sensitive applications such as voice over IP (VoIP) within the DiffServ framework. The mechanism allows to create service classes and assign proportional weights to such classes efficiently according to their resource requirements. Besides, MEPFQ tries to ensure that packets from low priority class will not be starved even under extreme congestion cases. The results from the simulation studies show that the mechanism is able to ensure both the required end-to-end network delay bounds and bandwidth fairness for QoS-sensitive applications based on the specified service weights under various traffic and network conditions. Another important aspect of the MEPFQ algorithm is that the scheme has lower implementation complexity, along with scalability to accommodate the growing traffic flows at the core routers of high-speed Internet backbone.

This paper proposes a new correction technique for a linear amplification with nonlinear components (LINC) transmitter. The technique, which is based on the minimum mean squared error (MMSE) criterion, estimates the gain and phase imbalance between the two amplifier branches. With information on the estimation, the imbalance is offset by controlling the amplitude and phase of the input signal that is fed into one of the two amplifiers. Computer simulations with a DS-CDMA system demonstrate that this method can compensate for the imbalance and sufficiently suppress the out-of-band distortion spectrum.

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.

This paper discusses performance issues for a sensor network. It describes the unique features of the sensor network and discusses studies on its protocols. Performance measures for the sensor network are investigated and studies related to them are surveyed. As an example of performance measures, this paper analyzes a sensor network's availability, which is the probability that all the sensor nodes are working without any of them having run out of energy. An explicit formula for the sensor network availability is derived, and the optimal placement of sensor nodes is investigated.

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 matrix inequality condition has been considered as the main condition for the stability of RHC. But it is difficult to apply the matrix inequality condition for guaranteeing the stability of any physical system because of the high gain problem brought about the high value of the final state weighting matrix. Therefore, in this study, a new stability condition for RHC is proposed and it extends the range of the final state weighting matrix guaranteeing the stability of RHC in comparison with the case of the matrix inequality condition. The proposed stability condition is based not only on a final state weighting matrix but also on a horizon size and guarantees the stability for other forms of model predictive control just like the matrix inequality condition.

In this paper, using p-ary bent functions defined on vector space over the finite field Fpk, we generalized the construction method of the families of p-ary bent sequences with balanced and optimal correlation properties introduced by Kumar and Moreno for an odd prime p, called generalized p-ary bent sequences. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuchi and Imamura is a special case of the newly constructed generalized p-ary bent sequences.

We propose a new approach associated with the use of some selected sets of Walsh Hadamard codes for joint estimation of channels and the number of transmit antennas by employing only one OFDM pilot symbol. This allows transmit antenna diversity to be applied in systems which have a limited number of training symbols (preambles), e.g. HIPERLAN/2. The proposed approach does not require any a priori knowledge about the number of transmit antennas, providing flexibility in the number of antennas to be used. In addition, adaptive scheme associated with the proposed approach provides more accurate estimations of the channels. The effectiveness of the proposed approach is evaluated through simulation. Results show that the proposed scheme provides significant improvement over previous channel estimation schemes and has almost the same performance as the ideal system with the full knowledge of the channel state information.

Two new voltage-mode universal biquadratic filters each with three input signals and one output signal are presented. Each proposed universal biquadratic filter is composed of only two CCIIs, two capacitors and two resistors and can realize all the standard filter functions, that is, highpass, bandpass, lowpass, notch and allpass filters (one more active device is needed for the realization of allpass filter). The proposed circuits have good sensitivities performance and have no requirements for component-matching conditions.

To increase the spectral utilization efficiency of a wireless link, multiple-input multiple-output (MIMO) systems can be employed to transmit several data streams in parallel at the same time and on the same frequency but from different transmit antennas. However, at the receiver side multi-stream detection is needed. In this paper, ordered successive MMSE detection (OSD) is considered as a low-complexity detection scheme. OSD's main computational cost lies in computing the nulling weights that correspond to each stage of successive detection. In this paper, we develop an efficient semi-adaptive approach to generate MMSE weights. This semi-adaptive approach efficiently combines two approaches: channel estimates-based direct matrix inversion weights generation (direct approach) and Recursive Least Squares (RLS) algorithm-based weights generation (adaptive approach). Although the direct approach alone performs better than the adaptive approach, it is more complex for updating weights within the tracking mode. On the other hand, the adaptive approach alone is less complex in updating weights within the tracking mode, but converges slowly within the training mode. Our combined semi-adaptive approach effectively offsets these disadvantages. We demonstrate, through computer simulations, that the semi-adaptive approach can achieve the BER of the direct approach in slow time-varying MIMO channels, while its computational complexity is less than or comparable to that of the adaptive approach.

As an access network to the Internet, CATV/HFC network has been widespread recently. Such a network employs a reservation access method under which reservation and data transmission periods appear by turns. Before data transmission, a station must send a request in a random access manner during the reservation period called a request cluster. If the cluster size is large, the probability of request collision occurrence becomes small. A large cluster size however increases the packet transmission delay. Moreover the throughput decreases since vacant duration of reservation period increases. DOCSIS, a de facto standard for the networks, employs the binary back-off method for request cluster allocation. Since that method normally allocates unnecessary large request cluster, the transmission delay increases under heavy load conditions. In this paper, we propose a request cluster allocation method which dynamically changes the cluster size according to the load conditions. In order to evaluate performance of the proposed method, we build a queuing model and execute computer simulation. Simulation result shows that the proposed method provides smaller delay than the binary back-off method.

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 paper describes synthesis of a complex RiCR filter with a finite transmission zero except zero frequency. The frequency response of the proposed filter is similar to the conventional elliptic filter. The proposed filter can be composed of fewer elements than the conventional one. A new kernel function is proposed. As an example, a fifth-order RiCR filter is designed. We compare the proposed filter with the conventional complex elliptic filter from the viewpoint of the frequency response and the number of the required elements.

This paper describes an efficient method for the macromodel generation of hybrid systems which are composed of electromagnetic systems and lumped RLC circuits. In our method, electromagnetic systems are formulated as finite-difference frequency-domain (FDFD) equations, and RLC circuits are formulated as nodal equations. Therefore, unlike the partial-element equivalent-circuit (PEEC) method, the technique presented here does not need any 3-dimensional capacitance and inductance parameter extractions to model interconnects, LSI packages and printed circuit boards. Also the lumped RLC elements can be easily included in the hybrid system of equations, thus it is convenient to model some passive components, such as bypass capacitors. The model order reduction technique is utilized in order to construct macromodels from hybrid system of equations. The accuracy of the proposed method is substantiated with some numerical examples.

This paper examines the properties of the greatest subsolution for linear equations in the max-plus algebra. The greatest subsolution is a relaxed solution of the linear equations, and gives a unified and reasonable solution whether there exists a strict solution or not. Accordingly, it forms part of a key algorithm for deriving a control law in the field of controller design, and some effective controllers based on the greatest subsolution have been proposed. However, there remain several issues to be discussed regarding the properties of the greatest subsolution. Hence, the main focus of this paper is on the following fundamental properties: 1) Formulation as an optimization problem, 2) Uniqueness of the greatest subsolution, 3) Necessary and sufficient condition for the correspondence of the greatest subsolution with the strict solution. These results could provide flexibility of the controller design based on the greatest subsolution, and facilitate the performance evaluation of the controller. Finally, the uniqueness of the strict solution of the linear equations is examined, and it is confirmed through illustrative examples.