Hiroshi SARUWATARI Hiroaki YAMAJO Tomoya TAKATANI Tsuyoki NISHIKAWA Kiyohiro SHIKANO
We propose a new two-stage blind separation and deconvolution strategy for multiple-input multiple-output (MIMO)-FIR systems driven by colored sound sources, in which single-input multiple-output (SIMO)-model-based ICA (SIMO-ICA) and blind multichannel inverse filtering are combined. SIMO-ICA can separate the mixed signals, not into monaural source signals but into SIMO-model-based signals from independent sources as they are at the microphones. After the separation by the SIMO-ICA, a blind deconvolution technique for the SIMO model can be applied even when each source signal is temporally correlated and the mixing system has a nonminimum phase property. The simulation results reveal that the proposed algorithm can successfully achieve separation and deconvolution of a convolutive mixture of speech, and outperforms a number of conventional ICA-based BSD methods.
Fengyuan REN Chuang LIN Xiaomeng HUANG
Adaptive Virtual Queue (AVQ) introduces a novel implementation algorithm for Active Queue Management (AQM). The stability criterion for AVQ was deduced in literature [1], but it lacks practicability due to the difficulty of solving the transcendental equation. In this letter, the AVQ stability is further investigated based on the characteristic roots of delay-differential equation. Another stability criterion explicitly associated with parameters of network configuration is deduced and the upper bound of delay time for stable AVQ algorithm is determined. Finally, the conclusion is validated through simulation experiments.
Yoshifumi KOBAYASHI Hidehiro NAKANO Toshimichi SAITO
This letter studies a simple nonautonomous chaotic circuit constructed by adding an impulsive switch to the RCL circuit. The switch operation depends on time and on state variable through a refractory threshold. The circuit exhibits various chaotic attractors, periodic attractors and related bifurcation phenomena. The dynamics can be analyzed using 1-D return map focusing on the time-dependent switching moments. Using a simple test circuit model typical phenomena are verified in PSPICE simulations.
Data broadcast has become a promising approach to achieving information dissemination in wireless environments due to the limited channel bandwidth and the power constraints of portable devices. In this paper, a restricted dynamic programming approach which generates broadcast programs is proposed to partition data items over multiple channels near optimally. In our approach, a function to predict the optimal average expected delay, in terms of the number of channels, the summation of the access frequencies of data items, and the ratio of the data items is developed by employing curve fitting. Applying this function, we can find a cut point that may be very close to the optimal cut. Thus, the search space in dynamic programming can be restricted to the interval around a determined cut point. Therefore, our approach only takes O(N log K) time, where N is number of data items and K is the number of broadcast channels. Simulation results show that the solution obtained by our proposed algorithm is near-optimal.
In contention-based wireless ad hoc networks, power control is an efficient way to improve the spatial reuse by allowing multiple pairs to communicate simultaneously. In this paper, we propose a game-theoretical approach for joint power and rate control in ad hoc networks, where the transmit rate of each link is maximized. Meanwhile we consider the transmit power as the cost, since higher power leads to higher interference and more energy consumption. In particular, we introduce a novel auction-like pricing algorithm in which the cost per unit power steps up until the network settles down at a Nash equilibrium, which is a feasible power and rate allocation, even when the Signal to Interference and Noise Ratio (SINR) requirements are initially infeasible. Numerical results show significant throughput improvement and energy consumption savings compared with the previously proposed algorithm that defers the link with minimum SINR.
Hui-Feng TSAI Pi-Hai LIU Yinyi LIN
A TMTR code is specified as (=2,=3,k) constraint. In this work, an approach for constructing (=2,=3,k) codes is presented. Based on this construction, a rate 8/9 code with k=7 is found. This code can achieve better timing recovery performance compared to the proposed previously TMTR code with k=11. An enumerating encoder and decoder exist for constructed (=2,=3,k) codes. A look-up table for the encoder/decoder is not required. Simulation results on an E2PRIV recording channel reveal that the TMTR code provides 2.2 dB gain over an uncoded case.
Jaewon LEE Seong-Min HONG Hyunsoo YOON
The mobile agent paradigm is a promising technology to structure distributed applications. Since mobile agents physically move to a remote host that is under the control of a different principal, they need to be protected from this environment which is responsible for execution. In this paper, we provide a new cryptographic methodology of protecting mobile agents from unauthorized modification for the program code by malicious hosts.
Jwu-Sheng HU Chieh-Cheng CHENG
This investigation proposed two array beamformers SPFDBB (Soft Penalty Frequency Domain Block Beamformer) and FDABB (Frequency Domain Adjustable Block Beamformer). Compared with the conventional beamformers, these frequency-domain methods can significantly reduce the computation power requirement in ASR (Automatic Speech Recognition) based applications. Like other reference signal based techniques, SPFDBB and FDABB minimize microphone's mismatch, desired signal cancellation caused by reflection effects and resolution due to the array's position. Additionally, these proposed methods are suitable for both near-field and far-field environments. Generally, the convolution relation between channel and speech source in time domain cannot be modeled accurately as a multiplication in the frequency domain with a finite window size, especially in ASR applications. SPFDBB and FDABB can approximate this multiplication by treating several frames as a block to achieve a better beamforming result. Moreover, FDABB adjusts the number of frames on-line to cope with the variation of characteristics in both speech and interference signals. A better performance was found to be achievable by combining these methods with an ASR mechanism.
YoungBae JANG SeungRyoul MAENG JungWan CHO
An active network has the advantage of being able to accept new protocols quickly and easily. The cluster-based active router can provide sufficient computing power for customized computations. In the router architecture, load balancing is achieved by the efficient distribution of packets. We present a packet distribution scheme according to estimated processing time.
Vinh Trong LE Xiaohong JIANG Son Hong NGO Susumu HORIGUCHI
Genetic Algorithms (GA) provide an attractive approach to solving the challenging problem of dynamic routing and wavelength assignment (RWA) in optical Wavelength Division Multiplexing (WDM) networks, because they usually achieve a significantly low blocking probability. Available GA-based dynamic RWA algorithms were designed mainly for WDM networks with a wavelength continuity constraint, and they cannot be applied directly to WDM networks with wavelength conversion capability. Furthermore, the available GA-based dynamic RWA algorithms suffer from the problem of requiring a very time consuming process to generate the first population of routes for a request, which may results in a significantly large delay in path setup. In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and GA. By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously update the routing tables, the new hybrid algorithm can promptly determine the first population of routes for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based dynamic RWA algorithms. To achieve a good load balance in WDM networks with sparse wavelength conversion, we adopt in our hybrid algorithm a new reproduction scheme and a new fitness function that simultaneously takes into account the path length, number of free wavelengths, and wavelength conversion capability in route selection. Our new hybrid algorithm achieves a better load balance and results in a significantly lower blocking probability than does the Fixed-Alternate routing algorithm, both for optical networks with sparse and full-range wavelength converters and for optical networks with sparse and limited-range wavelength converters. This was verified by an extensive simulation study on the ns-2 network simulator and two typical network topologies. The ability to guarantee both a low blocking probability and a small setup delay makes the new hybrid dynamic RWA algorithm very attractive for current optical circuit switching networks and also for the next generation optical burst switching networks.
Jungshik LIM Takashi YATSUI Motoichi OHTSU
We investigated the initial stage of Zn dot growth using near-field optical chemical vapor deposition. The dependence of the rate of Zn dot deposition on dot size revealed that the deposition rate was maximal when the dot grew to a size equivalent to the probe apex diameter. Such observed size-dependent resonance was in good agreement with theoretical results for dipole-dipole coupling with a Forster field between the deposited Zn dot and the probe apex.
Sangwon KANG Yongwon SHIN Changyong SON Thomas R. FISCHER
A fast encoding technique is described for vector quantization (VQ) of line spectral frequency parameters. A reduction in VQ encoding complexity is achieved by using a preliminary test that reduces the necessary codebook search range. The test is performed based on two criteria. One criterion uses the distance between a specific single element of the input vector and the corresponding element of the codevectors in the codebook. The other criterion makes use of the ordering property of LSF parameters. The fast encoding technique is implemented in the enhanced variable rate codec (EVRC) encoding algorithm. Simulation results show that the average searching range of the codebook can be reduced by 44.50% for the EVRC without degradation of spectral distortion (SD).
Dong-Wan TCHA Soon-Ho LEE Go-Whan JIN
For a CDMA system with a single carrier, we consider a call control policy at each cell, which gives priority to handoff calls over new calls while meeting the overall call quality. New calls are first under the call control of the threshold type, and then receive services together with the handoff calls but under the outage restriction guaranteeing a pre-specified call quality. An optimization model with such quality-guaranteeing constraints is formulated, which is to determine the threshold value for each cell, minimizing the new call blocking probability. We propose a solution heuristic, with which a number of simulations are conducted under a variety of traffic environments. The computational experiments evaluate the usefulness of our call control scheme in that handoff calls are given an appropriate level of priority while the system capacity is effectively utilized.
A method of evaluating the wavelength filter spectrum response is introduced. The increase of the crosstalk level due to the filtering and the relation between the total crosstalk and the spectral efficiency are derived in detail using the Gaussian filter. Since this method can be applied to various kinds of filter spectrum responses, the ultimate spectral efficiencies of filters are compared. In this comparison, the problem of the box-like filter, which has been considered to be desirable, is revealed, and this is improved by cascading the filter spectrum. The requirement on the rejection floor that inheres in the filter is also made clear.
We investigate the impact of symbol rate control, modulation level control, and the number of hops on the area spectral efficiency of interference-limited multihop radio networks. By controlling symbol rate and modulation level, data rate can be adapted according to received power. In addition, varying the number of hops can control received power. First, we evaluate the achievable end-to-end throughput of multihop transmission assuming symbol rate and modulation level control. Numerical results reveal that by controlling symbol rate or using multihop transmission, the end-to-end communication range can be extended at the cost of end-to-end throughput, and this may result in lower area spectral efficiency. Next, an expression for the area spectral efficiency of multihop radio networks is derived as a function of the number of hops and the end-to-end throughput. Numerical results also reveal that the resulting area spectral efficiency depends on the specific circumstances, which, however, can be increased only by using multihop transmission.
This paper proposes the MultiPath streaming scheme with Media Synchronization control (MPMS) for audio-video transmission in wireless ad hoc networks. In many audio-video streaming applications, media compensate each other from a perceptual point of view. On the basis of this property, we treat the two streams as separate transport streams, and then the source transmits them into two different routes if multiple routes to the destination are available. The multipath transmission disturbs the temporal structure of the streams; in MPMS, the disturbance is remedied by media synchronization control. In order to implement MPMS in this paper, we enhance the existing Dynamic Source Routing (DSR) protocol. We compare the application-level QoS of MPMS and three other schemes for audio-video transmission by simulation with ns-2. In the simulation, we also assess the influence of the multipath transmission on other traffic. The simulation result shows that MPMS is effective in achieving high QoS at the application-level.
Craig J. MITCHELL Giuseppe ABREU Ryuji KOHNO
In this paper we present a novel method for improving RAKE receiver reception in UWB systems. Due to the fact that practical pulses that can be produced for UWB-IR (Ultra Wideband-Impulse Radio) may occupy a longer time than the typical multipath resolution of the actual UWB channel, multiple channel components may arrive within this typical pulse width. Performance degradation may occur due to the resulting intrapulse (overlapping received pulses) interference. We here propose an adaptive, pilot aided RAKE receiver for UWB communications in the multipath environment. The proposed system estimates the actual received signal with intrapulse interference in each RAKE finger using projections onto a Hadamard-Hermite subspace. By exploiting the orthogonality of this subspace it is possible to decompose the received signal so as to better match the template waveform and reduce the effects of intrapulse interference. By using the projections onto this subspace, the dimension of the received signal is effectively increased allowing for adaptive correlator template outputs. RAKE receivers based on this proposal are designed which show significant performance improvement and require less fingers to achieve required performance than their conventional counterparts.
Mohammad AMINUL HAQ Mitsuji MATSUMOTO Jacir L. BORDIM Shinsuke TANAKA
In this paper we present a network layer based admission control and simple class based service differentiation model to support QoS in mobile ad hoc network. Our distributed admission control procedure works along with the route finding phase of reactive routing protocols for mobile ad hoc network (AODV, DSR etc). We also propose a simple class based distributed service differentiation system to support QoS once a traffic is admitted by our admission control mechanism. The proposed service differentiation is based on DiffServ model and includes modifications like configuration of each node with edge and core functionality, dynamic selection of edge/core functionality, use of minimal and simple classes. Simulation results show that our system allows seven times more real time traffic in the network than the proposed QoS for AODV model while satisfying the demanded end-to-end delay and providing low jitter.
Hajime SAWAMURA Takehisa TAKAHASHI
In our former paper, we formalized a Logic of Multiple-valued Argumentation (LMA) on an expressive knowledge representation language, Extended Annotated Logic Programming (EALP), in order to make it possible to construct arguments under uncertain information. In this paper, We confirm expressivity and applicability by applying LMA to arguments reflecting Easterners' preference over argumentation as well as Eastern thought and philosophy. In doing so, we exploit a wide variety of complete lattices as truth-values, showing the flexibility and adaptability of LMA to various multiple-valuedness required in argumentation under uncertain information. In particular, we consider a significant specialization of LMA to Tetralemma with an Eastern mind. Through various argument examples, it is shown that LMA allows for a kind of pluralistic argumentation, or a fusion of Eastern and Western argumentation.
Estimation of unknown signal parameters with sensor array measurements has been investigated quite extensively. Also, there has been in recent years an explosive increase in the number of mobile users in wireless cellular systems, thus contributing to growing levels of multi-user interference. To overcome this problem, application of adaptive antenna array techniques to further increase the channel capacity has been discussed. In this paper, a new model of locally scattered signals in the vicinity of mobiles is proposed by defining the mean steering vector and manipulate it mathematically for several distributions. Under this model an estimation method of the direction of arrival is investigated based on a weighted subspace fitting technique. Statistical analysis and simulations are also considered.