This paper presents a study on the blind separation of a convoluted mixture of speech signals using Frequency Domain Independent Component Analysis (FDICA) algorithm based on the negentropy maximization of Time Frequency Series of Speech (TFSS). The comparative studies on the negentropy approximation of TFSS using generalized Higher Order Statistics (HOS) of different nonquadratic, nonlinear functions are presented. A new nonlinear function based on the statistical modeling of TFSS by exponential power functions has also been proposed. The estimation of standard error and bias, obtained using the sequential delete-one jackknifing method, in the approximation of negentropy of TFSS by different nonlinear functions along with their signal separation performance indicate the superlative power of the exponential-power-based nonlinear function. The proposed nonlinear function has been found to speed-up convergence with slight improvement in the separation quality under reverberant conditions.

Call admission control (CAC) plays a significant role in providing the efficient use of the limited bandwidth and the desired quality-of-service (QoS) in mobile multimedia communications. As efficiency is an important performance issue for CAC in the mobile networks with multimedia services, the concept of fairness among services should also be considered. Game theory provides an appropriate framework for formulating such fair and efficient CAC problem. Thus, in this paper, a framework based on game theory (both of noncooperative and cooperative games) is proposed to select fair-efficient guard bandwidth coefficients of the CAC scheme for the asymmetrical traffic case in mobile multimedia communications. The proposed game theoretic framework provides fairness and efficiency in the aspects of bandwidth utilization and QoS for multiple classes of traffic, and also guarantees the proper priority mechanism. Call classes are viewed as the players of a game. Utility function of the player is defined to be of two types, the bandwidth utilization and the weighted sum of new call accepting probability and handoff succeeding probability. The numerical results show that, for both types of the utility function, there is a unique equilibrium point of the noncooperative game for any given offered load. For the cooperative game, the arbitration schemes for the interpersonal comparisons of utility and the bargaining problem are investigated. The results also indicate that, for both types of the utility function, the Nash solution with the origin (0,0) as the starting point of the bargaining problem can achieve higher total utility than the previous CAC scheme while at the same time providing fairness by satisfying a set of fairness axioms. Since the Nash solution is determined from the domain of the Pareto boundary, the way to generate the Pareto boundary is also provided. Therefore, the Nash solution can be obtained easily.

In this paper, we propose a statistical model for detecting article errors, which Japanese learners of English often make in English writing. It is based on the three head words--the verb head, the preposition, and the noun head. To overcome the data sparseness problem, we apply the backed-off estimate to it. Experiments show that its performance (F-measure=0.70) is better than that of other methods. Apart from the performance, it has two advantages: (i) Rules for detecting article errors are automatically generated as conditional probabilities once a corpus is given; (ii) Its recall and precision rates are adjustable.

This paper compared the approaches concerning the pinball routing problem that occurs in the nested network in network mobility environment and developed the analytic framework to model. Each model was evaluated of transmission latency, memory usage, and BU's occurrence number at routing optimization process. The estimation result showed that the optimization mechanism achievement overhead existed in each model, and the full optimization of the specific model was not attained because of it. Therefore, the most appropriate approach for routing optimization in nested NEMO can be determined only after a careful evaluation, and the proposals must consider using it in combination with other approaches. The modeling framework presented in this paper is intended to quantity the relative merits and demerits of the various approaches.

Based on the Si CMOS process, a low operating voltage and low power light emitting device is presented. It has a power transfer efficiency of 1 to 2 orders higher than previous reports and can be used as a high efficiency photodiode. Configurations using the same structure as both the light emitter and the optical receiver, and employing a simple modulation instrument is then proposed for applications in the chip-to-chip optical alignment and the signal transmission. Only single power supply is required in the emitter-receiver circuits and is compatible with other integrated circuits made by the CMOS process.

The main contribution of this work is to present several hardware implementations of an "n choose k" counter (C(n,k) counter for short), which lists all n-bit numbers with (n-k) 0's and k 1's, and to show their applications. We first present concepts of C(n,k) counters and their efficient implementations on an FPGA. We then go on to evaluate their performance in terms of the number of used slices and the clock frequency for the Xilinx VirtexII family FPGA XC2V3000-4. As one of the real life applications, we use a C(n,k) counter to accelerate a digital halftoning method that generates a binary image reproducing an original gray-scale image. This method repeatedly replaces an image pattern in small square regions of a binary image by the best one. By the partial exhaustive search using a C(n,k) counter we succeeded in accelerating the task of finding the best image pattern and achieved a speedup factor of more than 2.5 over the simple exhaustive search.

In this letter, we propose a closed-form joint space-time channel and direction of arrival (DOA) blind estimation algorithm for space-time coded MC-CDMA systems equipped with a uniform linear array (ULA) at the base station in frequency-selective fading environments. We prove that the signal subspaces defined by the receive data covariance matrix can be determinately separated into an equivalent set of signal subspaces spanned by the space-time channel vector of an individual user. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method.

This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to reduce the complexity of the circuits and a preconditioned Krylov-subspace iterative method is then used to perform the nodal analysis on the reduced circuits. By proper selection of the simulation time step and interval based on Elmore delays, the delay of the clock signal between the clock source and the sink node as well as the clock skews between the sink nodes can be computed efficiently and accurately. Our experimental results show that the proposed algorithm is two orders of magnitude faster than HSPICE without loss of accuracy and stability. The maximum error is within 0.4% of the exact delay time.

In recent years, the Internet has come to be able to be used at higher speed and more cheaply everywhere as the broadband service and the wireless LAN service have been provided by various ISPs. In such a ubiquitous environment, a demand for mobile computing environments in the intranet and easy access from remote sites has been increasing greatly as well as the Internet. To meet this requirement, we have proposed a Logical Office service, which is a kind of the mobile VLAN, and enables terminal plug and play, layer two tunneling, and ubiquitous communication. This paper newly proposes that the offer of the IP mobility to not only the movement of the terminal but also existing network services be possible the Logical Office service which we developed. As a result, it was verified to operate existing network services such as wirelesses LAN on the Logical Office service, and for newly existing network services to able to have the IP mobility.

We have proposed in [5] a practical blind channel identification algorithm for the white observation noise. In this paper, we examine the effectiveness of the algorithm given in [5] for the colored observation noise. The proposed algorithm utilizes Gram-Schmidt orthogonalization procedure and estimates (1) the channel order, (2) the noise variance and then (3) the channel impulse response with less computational complexity compared to the conventional algorithms using eigenvalue decomposition. It can be shown through numerical examples that the algorithm proposed in [5] is quite effective in the colored noise case.

In this paper we report a 3rd-order Gm-C filter based on pseudo-differential continuous-time transconductors for applications in low-voltage systems over VHF range. By using a 0.18 µm pure digital CMOS process, a prototype low pass filter with -3 dB frequency programmable from 38 MHz to 213 MHz confirms the feasibility of the proposed filter in applications such as data storage systems.

Visibility culling techniques have been studied extensively in computer graphics for interactive walkthrough applications in recent years. In this paper, a visibility culling approach by exploiting hardware-accelerated occlusion query is proposed. Organizing the regular grid representation of input scene as an octree-like hierarchy, a 2-tier view frustum culling algorithm is to efficiently cull away nodes invisible from a given viewpoint. Employing the eye-siding number of nodes, we can quickly enumerate an occlusion front-to-back order and effectively maximize the number of parallelizable occlusion queries for nodes while traversing the hierarchy. As experimental results show, our approach improves the overall performance in the test walkthrough.

In this letter, we consider a problem of global exponential stabilization of a class of approximately feedback linearized systems. With a newly proposed LMI-condition, we propose a controller design method which is shown to be improved over the existing methods in several aspects.

A robust time and frequency synchronization scheme is proposed for the high rate OFDM-based wireless local area networks (WLANs). The IEEE 802.11a standardized preamble is efficiently utilized and makes the proposed scheme practical. Simulation results under different channel environments are presented to illustrate the effectiveness of the proposed scheme.

Orthogonal modulation provides low probability of bit error, however its bandwidth efficiency is very low. Biorthogonal code may double the bandwidth efficiency, but its required bandwidth grows exponentially with the number of input bits as in orthogonal modulation. In this paper, we propose a multi-code biorthogonal code keying (MBCK) scheme that significantly reduces the signal bandwidth with the benefit from orthogonal waveform coding maintained. The system consists of multiple waveform coding blocks, and the sum of output codewords is transmitted. A problem with MBCK is that output signal is multi-level, which requires amplifier with high linearity. So it may not be an appropriate scheme for portable unit where power efficiency is highly important. We also propose a modified MBCK scheme that guarantees constant amplitude output. The transmitter of the proposed scheme contains a redundant waveform coder whose input is generated by encoding the information bits. Adding the codewords from all constituent waveform coding blocks, the composite signal has constant amplitude. It is also shown that the redundant bits are not only used to make constant amplitude signal but also used to improve the BER performance at the receiver.

This paper presents the design of a novel method for improvement of the operation of distance relays during capacitive voltage transformer transients using artificial neural network. The proposed module uses voltage and current signals to learn the hidden relationship existing in the input patterns. Simulation studies are preformed and the influence of changing system parameters, such as fault resistance and source impedance is studied. Details of the design procedure and the results of performance studies with the proposed relay are given in the paper. Performance studies results show that the proposed algorithm decreases the effects of CVT transients and is fast and accurate.

In an empowered Internet with end-to-end Quality of Service (QoS) facilities, it is essential for content servers to minimize reserved network resources to achieve a reduction in transmission cost for the use of QoS. Resource reservation usage charging forces customers to efficiently use network resources. In this paper, we analyze a model that optimizes the total cost when semi-elastic traffic flows are delivered in a client-server scenario. The client uses the proposed analytical model to easily control its buffer occupancy and to determine at any time if it is needed to utilize resource reservation or best-effort transmission mode.

Severe frequency-selective fading, encountered in a broadband wireless mobile communication, significantly degrades the bit error rate (BER) performance of direct sequence spread spectrum (DSSS) signal transmission with rake combining. In this paper, frequency-domain pre-equalization transmission, called pre-FDE transmission, is presented for orthogonal multicode DSSS signal transmission. It is confirmed by the computer simulation that pre-FDE transmission can achieve a BER performance almost identical to that attainable by FDE reception.

In order to assess the effect of multipath fading on Orthogonal Frequency Division Multiplex (OFDM) signal transmission when the delay profile exceeds the guard interval, a simple prediction model is developed based on the Equivalent Transmission-Path (ETP) model. This model, which is described in this paper, is referred to as the ETP-OFDM-statistical model. The validity of the model is demonstrated by comparing the calculated digital transmission characteristics to results obtained by computer simulation. Using the newly developed ETP-OFDM-statistical model, digital transmission characteristics of the OFDM signal in a multipath environment when the delay profile exceeds the guard interval are shown as a function of delay spread, guard interval and OFDM symbol period.

This paper proposes a novel boundary scan test scheme for intellectual property (IP) core identification via watermarking. The core concept is embedding a watermark identification circuit (WIC) and a test circuit into the IP core at the behavior design level. The procedure depends on current IP-based design flow. This scheme can detect the identification of the IP provider without the need to examine the microphotograph after the chip has been manufactured and packaged. This scheme can successfully survive synthesis, placement, and routing and identify the IP core at various design levels. Experimental results have demonstrated that the proposed approach has the potential to solve the IP identification problem.