In forthcoming home network environment, computation capability will be embedded invisibly in home appliances, sensors, walls, ceilings, and floors. People will conduct various tasks using multiple devices simultaneously without consciousness of using computers. In this paper, first, we propose an application model named Virtual Network Appliance (VNA) model which simplify and expand device utilization. In the model, each device has VNA runtime system and function objects, called VNA components, running on it. A user task is defined in an application called VNA which is a logical appliance consisting of abstract function requirements and a message graph among them. Second, we propose Virtual Plug&Play mechanism which is a dynamic service integration mechanism in VNA model implementation. When a user conducts a task, he/she makes a VNA runtime system on a user-side terminal load a VNA definition appropriate for the task. Virtual Plug&Play dynamically discovers required VNA components and establishes the message graph as defined. Since XML documents are used to describe a VNA, users can share and customize it easily. We call the device integration done by Virtual Plug&Play top-down integration, which existing middleware do not aim at. Finally, we show that Virtual Plug&Play affords practical performance for top-down integration by performance evaluation.

Fairness as defined in wireline network cannot be achieved in wireless packet networks due to the bursty and location-dependent channel errors of wireless link. Channel-state dependent scheduling and compensation mechanism for errored flows are generally employed to improve the fairness in wireless packet scheduling algorithms. Most of the wireless scheduling algorithms, however, have two common significant problems. One problem is that they operate incorrectly unless all flows have the same packet size. This is due to the incorrect lead-and-lag model and the swapping-based rough compensation mechanism of the algorithms. The other problem is the degradation of error-free flow during compensation. The root of the degradation is that the bandwidth for compensation cannot be reserved since it is very difficult to predict. In this paper, we introduce WGPS (Wireless General Processor Sharing) to define fairness in wireless networks and present PWGPS as a packetized algorithm of WGPS. In our method, lead and lag of all flows are defined in terms of virtual time which is flexible enough to deal with packet size differences. Further, compensation is done by increasing the service share of the errored flow to a predetermined amount Δ. This enables the maximum bandwidth for compensation can be estimated and thus reserved. Our method can be proved to achieve improved fairness as compared with the previous scheduling algorithms.

AAL2 technology, which will be used in 3rd generation mobile communications systems, can be used to efficiently transmit low-bit-rate traffic. Because user connections are multiplexed at virtual-channel connections in AAL2 networks, conventional ATM QoS management, which operates in units of VC connections, may be inadequate for managing the QoS of AAL2 connections. In this paper, we argue that for efficient utilization of network resources, it is advantageous to accommodate AAL2 connections with different QoS conditions in the same VC connection. We present a multiplexing configuration that enables QoS to be controlled at the AAL2-connection level. It works by matching the AAL2-packet-multiplexing timing to the cell-transmission timing. We also address the issue of AAL2-bandwidth management. To calculate the bandwidth, we evaluate the characteristics of multiplexing CPS packets into the ATM cell payload.

In the current digital mobile communication that is used in the micro cellular system, a Self-Organized Dynamic Channel Assignment (DCA) Method has been proposed to use frequencies effectively. However, its characteristics and operational matters have not been reported yet. This paper takes up the TDMA/TDD system used in the current PHS system and also evaluates the characteristics and operational matters of this method through the actual operational tests. In addition, this paper aims to propose a new DCA method in order to speed up the Channel Segregation and evaluates its effects through the actual operational tests.

This paper discusses the teletraffic characteristics of cellular systems using Dynamic Channel Assignment. In general, it is difficult to exactly and theoretically analyze the teletraffic characteristics of Dynamic Channel Assignment. Also, it is not easy to theoretically evaluate influence of mobility on the traffic characteristics. This paper proposes approximate techniques to analyze teletraffic characteristics of Dynamic Channel Assignment considering mobility. The proposed techniques are based on Clique Packing approximation.

Wireless LANs have been used for realizing fully-distributed users in a multimedia environment that has the ability to provide real-time bursty traffic (such as voice or video) and data traffic. In this paper, we present a new realistic and detailed system model and a new effective analysis for the performance of wireless LANs which support multimedia communication with non-persistent carrier sense multiple access with collision avoidance (CSMA/CA) protocol. In this CSMA/CA model, a user with a packet ready to transmit initially sends some pulse signals with random intervals within a collision avoidance period before transmitting the packet to verify a clear channel. The system model consists of a finite number of users to efficiently share a common channel. Each user can be a source of both voice traffic and data traffic. The time axis is slotted, and a frame has a large number of slots and includes two parts: the collision avoidance period and the packet transmission period. A discrete-time Markov process is used to model the system operation. The number of slots in a frame can be arbitrary, dependent on the chosen lengths of the collision avoidance period and packet transmission period. Numerical results are shown in terms of channel utilization and average packet delay for different packet generation rates. They indicate that the network performance can be improved by adequate choice of ratios between the collision avoidance period and transmission period, and the pulse transmission probability.

This paper evaluates high-speed broadband packet wireless access in the forward link using coherent Time Division-Orthogonal Frequency and Code Division Multiplexing (TD-OFCDM) by applying time-multiplexed pilot symbol assisted channel estimation and integrating efficient multi-level modulation, hybrid automatic repeat request (ARQ), and code-multiplexing over a 50-100 MHz bandwidth. Computer simulation results first clarify that the common time-multiplexed pilot symbols with the transmit power of 6 dB higher than that of data symbols should be placed at both the beginning and end of a packet, and that the optimum averaging interval of channel estimates in the frequency domain is different according to the delay spread of a channel. Based on these optimized parameters for packet transmission, we show that the orthogonality among the code-multiplexed channels is destroyed due to severe frequency selective (multipath) fading and the accumulation of spread signals using equal gain combining (EGC) in the frequency domain. This degrades the achievable throughput performance especially when employing multi-level modulation and a high coding rate. Consequently, coherent TD-OFCDM with 8PSK data modulation and the convolutional coding of rate R = 2/3 employing sixteen-code multiplexing (spreading factor (SF) is 16) achieves the highest throughput of approximately 105 Mbps at the average received E_b/N₀ (signal energy per bit-to-noise power spectrum density ratio) of approximately 24 dB in a 3-path Rayleigh fading channel (rms delay spread, σ= 0.1 µsec). Furthermore, in coherent TD-OFCDM with QPSK and R = 4/5 or 8PSK and R = 1/2, throughput performance greater than 80 Mbps is achieved at the average received E_b/N₀ of approximately 20 dB even in a 24-path Rayleigh fading channel (σ= 0.2 µsec).

This paper elucidates the most appropriate hybrid automatic-repeat-request (ARQ) scheme, i.e., which can achieve the highest throughput, for high-speed packet transmission in the W-CDMA forward link by comparing the throughput performance of three types of hybrid ARQ schemes: type-I hybrid ARQ with packet combining (PC), type-II hybrid ARQ, and basic type-I hybrid ARQ as a reference. Moreover, from the viewpoint of maximum throughput, the respective optimum roles of ARQ and channel coding in hybrid ARQ are also clarified, such as the optimum coding rate and the packet length related to the interleaving effect. The simulation results reveal that the type-II scheme exhibits the best throughput performance, and the required received signal energy per chip-to-background noise spectral density ratio (E_c/N₀) at the throughput efficiency of 0.2/0.4/0.6 is improved by 0.7/0.3/0.1 dB and 3.9/1.8/0.5 dB, respectively, compared to the type-I scheme with and without PC in a 2-path Rayleigh fading channel with the average equal power at the maximum Doppler frequency of 5 Hz and the packet length of 4 slots (= 0.667 4 = 2.667 msec). However, the improvement of the type-II scheme compared to the type-I scheme with PC is small or the achievable throughput is almost identical in the high-received E_c/N₀ region. On the other hand, the type-I scheme with PC is much less complex and thus preferable, while maintaining almost the same throughput performance or allowing very minor degradation compared to that with type-II. The results also elucidate that, while the optimum coding rate depends on the required throughput in the basic type-I and type-I with PC schemes, it is around between 3/4 and 8/9 in type-II, resulting in a higher throughput efficiency. In addition, for high-speed packet transmission employing a hybrid ARQ scheme, a shorter retransmission unit size is preferable such as 1 slot, and the fast transmit power control is effective only under conditions such as a low maximum Doppler frequency and a high transmit E_c/N₀ region.

This paper proposes an outer loop control method of fast transmit power control (TPC) for high-quality data transmission such as that with the average bit error rate (BER) of 10^-6 in serial concatenated channel coding combining convolutional (inner) and Reed-Solomon (outer) codings for DS-CDMA mobile radio. In the proposed method, the outer loop control is performed based on the measured intermediate block error rate (BLER) value after inner-channel decoding. Since the number of block errors after inner-channel decoding is much greater than that of the final output after outer channel decoding, fast tracking performance of the sudden changes in the propagation conditions such as the number of multipaths and fading Doppler frequency, i.e., moving speed of the mobile station, is achieved. The experimental results clarify that the measured BLER after outer channel decoding is accurately controlled to almost a constant value from the low to high fading maximum Doppler frequency of up to 480 Hz, and that the measured BER after outer channel decoding is within the range of one-order of magnitude of the antenna diversity reception (meanwhile, the target SIR value after Rake combining varied with the range of 2.5 dB).

We propose a novel control method for an unknown distributed system, and apply it to transmission power control in a code-division multiple access (CDMA) wireless system. Our proposed distributed control contains conventional transmission power control and packet transmission rate control for constant bit rate (CBR) and transmission control protocol (TCP) connections. Using theoretical analysis and computer simulations we show that our method for transmission power control allows high bandwidth utilization for both CBR and TCP connections, and that conventional power control, by contrast, does not make efficient use of bandwidth in TCP connections.

This paper proposes and investigates optimum modulation assignment and band allocation scheme according to subband channel status for BST-OFDM system. The proposed system can adaptively optimize modulation assignment and band allocation according to the conditional parameter under independently fading subband channels. Specifically, in this paper only two optimization problems are treated in terms of modulation assignment. At first, an optimization criterion is a total Bit Error Rate (BER) subject to the constraint conditions of a desired total information bit rate under a fixed effective bandwidth. Another optimization problem is the maximization of a total information bit rate to satisfy a desired BER under a fixed effective bandwidth. Knowledge of the subband channel status is assumed to be updated by the feedback information from a receiver. This paper shows that the proposed system can overperform the conventional system in which all subbands employ the same modulation schemes in terms of BER. In addition, it is shown that the proposed system improves the overall information bit rate, which is not accomplishable in the conventional system.

In this letter, we present bit error analysis (BER) of orthogonal multi-carrier direct sequence code division multiple access (DS-CDMA) system with multi-rate (multimedia) traffic. Analysis is carried out with random signature codes for an AWGN channel. Interference in such a system is severe because all users of all media transmit over the same assigned sub-carriers. This makes the analysis difficult. In our analysis, we divide this interference into different types and carry out our analysis to obtain the BER taking into account all these types. We show that the performance of the system is improved as the number of assigned sub-carriers M increases until a limit where the improvement does not continue even when M increases more. This is because of, as we show, the interference due to other sub-carriers becomes constant even in the case of M , and the interference in a multi-rate multi-carrier system is bigger than that in a single-carrier (M=1) by a factor of π²/3.

The ultrasonic wave is widely used for acquiring perceptual information necessary for indoor/outdoor navigation of mobile robots, where the system is implemented as a sound navigation and ranging system (sonar). A robot equipped with multiple ultrasonic sonars is likely to exhibit undesirable operation due to erroneous measurements resulting from cross-talk among the sonars. Each sonar transmits and receives a pulse-modulated ultrasonic wave for measuring the range and identifying its own signal. We propose a technique for generating pulse patterns for multiple concurrently operated ultrasonic sonars. The approach considers pulse-pattern generation as a combinatorial optimization problem which can be solved by a genetic algorithm (GA). The aim is to acquire a pulse pattern satisfying certain conditions in order to avoid cross-talk or keep the probability of erroneous measurement caused by cross-talk low. We provide a method of genotype coding for the generation of the pulse pattern. Furthermore, in order to avoid a futile search encountered when the conventional technique is used, we propose an improved genotype coding technique that yields considerably different results from those of the conventional technique.

This paper presents a new class of complex-valued compact-supported orthonormal symmlets. Firstly, some properties of complex-valued compact-supported orthonormal symmlets are investigated, and then it is shown that complex-valued symmlets can be generated by real-valued half-band filters. Therefore, the construction of complex-valued symmlets can be reduced to the design of real-valued half-band filters. Next, a design method of real-valued half-band FIR filters with some flatness requirements is proposed. For the maximally flat half-band filters, a closed-form solution is given. For the filter design with a given degree of flatness, the design problem is formulated in the form of linear system by using the Remez exchange algorithm and considering the given flatness condition. Therefore, a set of filter coefficients can be easily computed by solving a set of linear equations, and the optimal solution is obtained through a few iterations. Finally, some design examples are presented to demonstrate the effectiveness of the proposed method.

In this paper, we present a dynamic output feedback controller design technique for robust decentralized stabilization of uncertain large-scale systems with time-delay in the subsystem interconnections. Based on Lyapunov second method, a sufficient condition for the stability, is derived in terms of three linear matrix inequalities (LMI). The solutions of the LMIs can be easily obtained using efficient convex optimization techniques. A numerical example is given to illustrate the proposed method.

This paper introduces a new approach based on the geographic nearest neighbors for constructing the Delaunay triangulation (a dual of the Voronoi diagram) of a set of n sites in the plane under the L₁ metric. In general, there is no inclusion relationship between the Delaunay triangulation and the octant neighbor graph. We however find that under the L₁ metric the octant neighbor graph contains at least one edge of each triangle in the Delaunay triangulation. By using this observation and employing a range tree scheme, we design an algorithm for constructing the Delaunay triangulation (thus the Voronoi diagram) in the L₁ metric. This algorithm takes O(n log n) sequential time for constructing the Delaunay triangulation in the L₁ metric. This algorithm can easily be parallelized, and takes O(log n) time with O(n) processors on a CREW-PRAM.

Currently, the most popular model in data compression theory is that of stationary ergodic sources. But there do exist sequences each of which is not emitted from any stationary ergodic source but can be compressed sufficiently by a certain algorithm. We estimate the size of the set of such sequences in terms of Hausdorff dimension.

An unwrapping of signal coefficients in transform domain is proposed for applications in which a lossy operation is performed on the coefficients between analysis and synthesis. It is shown that the unwrapping-based modification of signal-to-additive-signal ratio can employ the fact that an implementation of a biorthogonal decomposition is characterized by a mutually orthogonal eigenvectors. An example to illustrate the benefits of the presented approach in lossy image compression applications is shown.

It is necessary for anyone to be able to extract embedded index data without specific keys or secret information when index data are embedded into digital contents. In this paper, we propose a new data hiding technique for embedding index data into color images using wavelet transform. In our method, we prevent image quality from degrading by utilizing not specific keys but features of wavelet transform. The method extracts index data without specific keys and is tolerant of edge-enhancement, gamma correction, brightness conversion and lossy image compression such as JPEG compression.

PID control schemes based on the classical control theory, have been widely used for various real control systems. However, in practice, since it is considerably difficult to determine the PID parameters suitably, lots of researches have been reported with respect to tuning schemes of PID parameters. Furthermore, several self-tuning and auto-tuning techniques in the PID control have been reported for systems with unknown or slowly time-varying parameters. On the other hand, so-called a generalized predictive control (GPC) scheme has been reported as a useful self-tuning control technique for unknown and/or time variant delay systems. In this paper, a new self-tuning predictive PID control algorithm based on a GPC criterion is proposed.

Most of the previous controllers proposed for output regulation problems on uncertain nonlinear systems tried to keep the state variables to the nominal equilibrium points. In this letter, however, the dynamic state feedback controller makes the state variables follow the perturbed equilibrium points computed from an equilibrium-estimator.

This letter focuses on the design of a unified estimator for scheduled control in nonlinear systems with unknown parameter. An estimation law with a finite convergence time is formulated to compute the unknown scheduling parameter that drives a scheduled controller. This estimator can also be extended to the types of scheduled controllers addressed in the literature.

It is very difficult to obtain a linearizing feedback and a coordinate transformation map, even though the system is feedback linearizable. It is known that finding a desired transformation map and feedback is equivalent to finding an integrating factor for an annihilating one-form. In this paper we develop a numerical algorithm for an integrating factor involving a set of partial differential equations and corresponding zero-form using the C.I.R method. We employ a tensor product splines as an interpolation method to data which are resulted from the numerical algorithm in order to obtain an approximate integrating factor and a zero-form in closed forms. Next, we obtain a coordinate transformation map using the approximate integrating factor and zero-form. Finally, we construct a stabilizing controller based on a linearized system with the approximate coordinate transformation.

A gradient ascent learning algorithm of the Hopfield neural networks for graph planarization is presented. This learning algorithm uses the Hopfield neural network to get a near-maximal planar subgraph, and increases the energy by modifying parameters in a gradient ascent direction to help the network escape from the state of the near-maximal planar subgraph to the state of the maximal planar subgraph or better one. The proposed algorithm is applied to several graphs up to 150 vertices and 1064 edges. The performance of our algorithm is compared with that of Takefuji/Lee's method. Simulation results show that the proposed algorithm is much better than Takefuji/Lee's method in terms of the solution quality for every tested graph.