Frequency domain blind source separation has the great advantage that the complicated convolution in time domain becomes multiple efficient multiplications in frequency domain. However, the inherent ambiguity of permutation of ICA becomes an important problem that the separated signals at different frequencies may be permuted in order. Mapping the separated signal at each frequency to a target source remains to be a difficult problem. In this paper, we first discuss the inter-frequency correlation based method, and propose a new method using the continuity in power between adjacent frequency components of same source. The proposed method also implicitly utilizes the information of inter-frequency correlation, as such has better performance than the previous method.

In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.

We investigate the error exponent in the lossy source coding with a fidelity criterion. Marton (1974) established a formula of the reliability function for the stationary memoryless source with finite alphabet. In this paper, we consider a stationary memoryless source assuming that the alphabet space is a metric space and not necessarily finite nor discrete. Our aim is to prove that Marton's formula for the reliability function remains true even if the alphabet is general.

RF MOSFET's are usually measured in common source configuration by a 2-port network analyzer, and the common gate and common drain S-parameters cannot be directly measured from a conventional 2-port test structure. In this work, a 4-port test structure for on-wafer measurement of RF MOSFET's is proposed. Four-port measurements for RF MOSFET's in different dimensions and the de-embedded procedures are performed up to 20 GHz. The S-parameters of the RF MOSFET in common source (CS), common gate (CG), and common drain (CD) configurations are obtained from a single DUT and one measurement procedure. The dependence of common source S-parameters of the device on substrate bias are also shown.

In wideband code division multiaccess (W-CDMA) uplink, immediate accommodation of high data rate packet causes power control error and makes active users' signal quality deteriorate in a beginning of a frame. To avoid the deterioration, we propose a new radio resource management (RRM) which accommodates high data rate traffic gradually in several frames. The proposed RRM reduces the signal quality deterioration in the beginning of the frame. We also propose an effective power control scheme, where a power increase command is sent to all users before a new high data rate packet is transmitted. Simulation results show that joint utilization of the proposed two methods is effective to keep signal quality good for all users.

We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence.

In this paper, single-input multiple-output (SIMO)-model-based blind source separation (BSS) is addressed, where unknown mixed source signals are detected at microphones, and can be separated, not into monaural source signals but into SIMO-model-based signals from independent sources as they are at the microphones. This technique is highly applicable to high-fidelity signal processing such as binaural signal processing. First, we provide an experimental comparison between two kinds of SIMO-model-based BSS methods, namely, conventional frequency-domain ICA with projection-back processing (FDICA-PB), and SIMO-ICA which was recently proposed by the authors. Secondly, we propose a new combination technique of the FDICA-PB and SIMO-ICA, which can achieve a higher separation performance than the two methods. The experimental results reveal that the accuracy of the separated SIMO signals in the simple SIMO-ICA is inferior to that of the signals obtained by FDICA-PB under low-quality initial value conditions, but the proposed combination technique can outperform both simple FDICA-PB and SIMO-ICA.

Multi-carrier code division multiplexing (MC-CDM) is one of promising multiplexing techniques for fourth-generation mobile downlink communications systems, where high data rate services should be provided even for high speed-cruising mobiles. For MC-CDM-based packet communication, a frequency scheduling method, which adaptively assigns different sub-carriers to different users, is proposed. This paper proposes a frequency scheduling method, which utilizes pre-assignmented subcarriers in the frequency domain for the MC-CDM scheme. Furthermore, the performance of the proposed system in frequency selective fading channels is compared with that of a no-scheduled MC-CDM scheme by computer simulation in both single- and multi-cell environments. From the results, it is found that the proposed system achieves better bit error rate performance than the no-scheduled MC-CDM scheme and can control quality of service (QoS) for active users.

In this paper, a novel type of the step-up high frequency transformer linked full-bridge soft-switching phase-shift PWM DC-DC power converter with ZVS and ZCS bridge legs is proposed for small scale fuel cell power generation systems, automotive AC power supplies. A tapped inductor filter with a freewheeling diode is implemented in the proposed soft-switching DC-DC power converter to minimize the circulating current in the high-frequency step-up transformer primary side and high-frequency inverter stage. Using a tapped inductor filter with a freewheeling diode makes possible to reduce the circulating current without any active switches and theirs gate-drive circuits. The operating principle of the proposed DC-DC power converter with each operation mode during a half cycle of the steady state operation is explained. The optimum design of the tapped inductor turns ratio is described on the basis of the circuit simulation results. Developing 1 kW 100 kHz prototype with power MOSFETs and 36 V DC source verifies the practical effectiveness of the proposed soft-switching DC-DC power converter. The actual efficiency of the proposed DC-DC power converter is obtained 94% for the wide load and output voltage variation ranges.

An important issue in applying machine learning algorithms to Natural Language Processing areas such as Named Entity Recognition tasks is to overcome the lack of tagged corpora. Several bootstrapping methods such as co-training have been proposed as a solution. In this paper, we present a different approach using the Web resources. A Named Entity (NE) tagged corpus is generated from the Web using about 3,000 names as seeds. The generated corpus may have a lower quality than the manually tagged corpus but its size can be increased sufficiently. Several features are developed and the decision list is learned using the generated corpus. Our method is verified by comparing it to both the decision list learned on the manual corpus and the DL-CoTrain method. We also present a two-level classification by cascading highly precise lexical patterns and the decision list to improve the performance.

Due to the cost of multicast state management, multicast address allocation, inter-domain multicast routing of traditional IP multicast scheme, ASM leads to a search for other multicast schemes. This paper presents a new solution to the problems mentioned above based on IPv6. The proposed scheme provides an enhanced scheme supporting the strengths of SSM in basic Xcast. This is achieved by adding MLDv2 operations at recipient's side and a new control plane into existing Xcast. The proposed scheme does not only provide the transparency of traditional multicast schemes to sources and recipients, but it also enhances the routing efficiency in networks. Intermediate routers do not have to maintain multicast state, so that it results in a more efficient and scalable mechanism to deliver native multicast datagrams. Also, the seamless integration in Mobile IPv6 can support multicast efficiently for mobile nodes in IPv6 networks by avoiding tunnel avalanches and tunnel convergence. We've attempted to prove this alternative architecture by both simulation and implementation, respectively. Our approach cannot fundamentally perform for many large groups distributed widely as effectively as traditional multicast schemes. However, we believe that the resulting scheme is simple, efficient, robust, transparent, and to the extent possible, scalable in case that recipients are clustered in subnets.

This paper presents a new method for blind source separation by exploiting phase and frequency redundancy of cyclostationary signals in a complementary way. It requires a weaker separation condition than those methods which only exploit the phase diversity or the frequency diversity of the source signals. The separation criterion is to diagonalize a polynomial matrix whose coefficient matrices consist of the correlation and cyclic correlation matrices, at time delay τ= 0, of multiple measurements. An algorithm is proposed to perform the blind source separation. Computer simulation results illustrate the performance of the new algorithm in comparison with the existing ones.

Many P2P lookup services based on distributed hash tables (DHT) have appeared recently. These schemes are built upon overlay networks and ignore distance to the target resources. As a result, P2P lookups often suffer from unnecessarily long routes in the underlay network, which we call overlay dilation. This paper proposes a new scheme for resource routing, called hybrid hierarchical overlay routing, dubbed Hyho. We introduce distance-weighted Bloom filters (dwBFs) as a concise representation of routing information for scattered resources in overlay networks. To further reduce the size of Bloom filters, so that they are linear in the number of distinct resources, Hyho splits overlay networks in accordance with DHT, where each subnetwork has a smaller set of resources and spans the entire network thinly. As a result, Hyho constructs a hierarchical overlay network and routes requests accordingly. Simulation results show that Hyho can reduce overlay dilation to one half that yielded by the Chord lookup service.

In wide-area wireless access systems such as satellite communications systems and stratospheric platform systems, electric power supplies for radio communications are realized using solar photovoltaic cells and/or fuel cells. However, the on-board weight limits restrict the number of cells that can be equipped. In addition, the transmission power of such systems is limited taking account of issues and regulations on sharing the same frequency band with other systems. Hence, both the frequency band and electric power is limited, which are crucial radio resources for those systems. Although radio channel allocation methods taking account of the frequency constraint only or the power constraint only have been proposed, radio channel allocation methods taking account of both constraints simultaneously have been insufficiently studied. This paper proposes a radio channel allocation method that provides global optimum allocation results by utilizing the linear programming method. The proposed method has features such that the method first allocates radio channels in proportion to the traffic demand distributed over the service coverage area and then maximizes the total radio channels allocated to systems. Numerical results are presented for a stratospheric platform system that covers an area of Japan, as an example, to demonstrate that the proposed method optimally allocates radio channels taking account of both constraints while efficiently allocating excess resources. In addition, whether a system reaches either the frequency or power limit can be estimated, by investigating the radio channel allocation results. Furthermore, enhanced linear programming models based on a method aiming at practical use of the radio channel allocation results in operation are also introduced. The enhanced model is demonstrated to work effectively to avoid unbalanced radio channel allocations over geographical areas. The proposed method and linear programming models are useful not only for making pre-plans but also for determining the amount of necessary frequency and power resources in designing systems.

This paper proposes methods of computing maximum throughput for Petri nets that model workflows including resources, called WF-nets with resources. We first propose the formal definitions of WF-nets with resources and their subclasses: marked graph/state machine WF-nets with conflict-free resources (CF-Res-MG/SMWF-nets). We also show several properties of CF-Res-MG/SMWF-nets. Next we give the methods of computing maximum throughput for CF-Res-MG/SMWF-nets under condition that all tokens have to be processed in the order of First-In First-Out (FIFO). Concretely, for CF-Res-MGWF-nets, on the basis of Ramamoorthy's method of computing cycle time, we give an algorithm of computing maximum throughput under the FIFO condition. For CF-Res-SMWF-nets, there is not any method of computing maximum throughput under the FIFO condition. So we are the first to give an algorithm of computing maximum throughput for CF-Res-SMWF-nets under the FIFO condition. Finally we show an example of computing maximum throughput by using our method.

This paper proposes a simple method for estimation and compensation of signal direction, to deal with relative change of sound source location caused by the movements of a microphone array and a sound source. This method introduces a delay filter that has shifted and sampled sinc functions. This paper presents a concept for the joint optimization of arrival time differences and of the coordinate system of a mobile microphone array. We use the LMS algorithm to derive this method by maintaining a certain relationship between the directions of the microphone array and the sound source directions. This method directly estimates the relative directions of the microphone array to the sound source directions by minimizing the relative differences of arrival time among the observed signals, not by estimating the time difference of arrival (TDOA) between two observed signals. This method also compensates the time delay of the observed signals simultaneously, and it has a feature to maintain that the output signals are in phase. Simulation results support effectiveness of the method.

Active Reliable Multicast (ARM) is a novel loss recovery scheme for large-scale reliable multicast that employs active routers to protect the sender and network bandwidth from unnecessary feedback and repair traffic. Active routers perform NACKs suppression, cache multicast data for local loss recovery, and use scoped retransmission to avoid exposure. Limited active resources at routers need to be optimized to achieve low loss recovery latency and/or high network throughput. In this paper, we study the cache placement strategies and caching policies for ARM. Several heuristics, namely uniform allocation, proportional allocation, max-min fair share and weighted allocation for cache allocation methods are proposed. To further improve the loss recovery performance, caching policies can be employed in conjunction with the cache allocation strategies. Several caching policies, namely complete caching, random caching and deterministic caching, are proposed. Extensive simulation experiments are conducted to evaluate and compare the performance of the proposed strategies and policies. Numerical results reveal that significant performance gains can be achieved when a proper cache placement strategy and a caching policy are used for a given available cache resource. Another interesting finding is that the contributions of the cache placement scheme and caching policy to the recovery latency performance are roughly independent. The obtained insights in this study will provide some design guidelines for optimal active resource allocation and caching polices for reliable multicast communications.

Optimistic coding is a coding in which we require the existence of reliable codes for infinitely many block length. In this letter we consider the optimistic source coding theorems for a general source Z from the information-spectrum approach. We first formulate the problem to be considered clearly. We obtain the optimistic infimum achievable source coding rate Tε (Z) for the case where decoding error probability εn is asymptotically less than or equal to an arbitrarily given ε [0,1). In fact, Tε (Z) turns out to be expressed in a form similar to the ordinary infimum achievable source coding rate. A new expression for Tε (Z) is also given. In addition, we investigate the case where εn = 0 for infinitely many n and obtain the infimum achievable coding rate.

Sensor networks, in which a large number of sensor nodes are connected with each other through communication networks, are potential to provide extensive new applications with various research and technical challenges and attracting much attention all over the world. In this paper we describe information and signal processing for sensor networks with emphasis on the concepts of collaboration and fusion as one of the most important issues for the sensor networks. We also review some basic aspects of sensor networks in terms of their features and the network architecture.

A large-swing, high-driving, low-power, class-AB buffer amplifier, which consists of a high-gain input stage and a unity-gain class-AB output stage, with low variation of quiescent current is proposed. The low power consumption and low variation of the quiescent output current are achieved by using a weak-driving and a strong-driving pseudo-source followers. The high-driving capability is mainly provided by the strong-driving pseudo-source follower whose output transistors are turned off in the vicinity of the stable state to reduce the power consumption and the variation of output current, while the quiescent state is maintained by the weak-driving pseudo-source follower. The error amplifiers with source-coupled pairs of the same type transistors are merged into a single error amplifier to reduce the area of the buffer and the current consumption. An experimental prototype buffer amplifier implemented in a 0.35-µm CMOS technology demonstrates that the circuit dissipates an average static power consumption of only 388.7 µW with the standard deviation of only 3.4 µW, which is only 0.874% at a power supply of 3.3 V, and exhibits the slew rates of 2.18 V/µs and 2.50 V/µs for the rising and falling edges, respectively, under a 300 Ω /150 pF load. Both of the second and third harmonic distortions (HD2 and HD3) are -69 dB at 20 kHz under the same load.