It is shown that simple preprocessing on the reference signals in multichannel feedforward ANC system can improve the convergence performance of the adaptive ANC algorithm. A fast and efficient blind preprocessing algorithm in frequency domain is proposed to reduce the computational complexity even that the reference sensors are located far from the noise sources. The permutation problem at different frequency bin is also addressed and solved by an independent vector analysis algorithm. The basic principle and performance comparison are given to verify our conclusion.

In this paper, we propose a successive signal-to-leakage-plus-noise ratio (SLNR) based precoding with geometric mean decomposition (GMD) for the downlink multi-user multiple-input multiple-output (MU-MIMO) systems. The known leakages are canceled at the transmit side, and SLNR is calculated with the unknown leakages. GMD is applied to cancel the known leakages, so the subchannels for each receiver have equal gain. We further improve the proposed precoding scheme by ordering users. Simulation results show that the proposed schemes have a considerable bit error rate (BER) improvement over the original SLNR scheme.

The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (mod p2).

Electromagnetic wave scattering in two open-ended coaxial cables with flanges is presented for adiabatic transmission line applications. Field distributions in the cables are obtained by employing the mode-matching method. A set of simultaneous equations is solved to investigate the transmission and reflection coefficients.

We consider distance-based registration (DBR). DBR causes a mobile station (MS) to reregister when the distance between the current base station (BS) and the BS with which it last registered exceeds a distance threshold. The addition of implicit registration to DBR (DBIR) was proposed to improve the performance of DBR, and its performance has also been presented using a continuous-time Markov chain. In this study, we point out some problems of the previous DBIR performance analysis, and we propose a new model of the DBIR to analyze its exact performance. Using the new method, we show that DBIR is always superior to DBR, and the extent of the improvement is generally greater than what is currently known.

We present a novel transmission rate control method for Wireless Mesh Networks, termed Semi-Fixed Rate Control (SFRC), which incorporates the advantages of Fixed Rate Control (FRC) and Adaptive Rate Control (ARC). SFRC has two periods, which are alternately repeated: an autorate period and a fixed-rate period. A unit of an autorate period and the successive fixed-rate period is termed “rate-control period”. The duration of the rate-control period is set considerably longer than that of the autorate period. In the autorate period, RTS/CTS is used with the lowest transmission rate, transmission rate adjustment is only applied to data frames, and loss of CTS frames is not reflected in the transmission rate adjustment. In the fixed-rate period, the transmission rate that was used most frequently in the preceding autorate period (optimum rate) is fixed, and RTS/CTS is not used. Implementation of SFRC is straightforward as it uses conventional IEEE 802.11 DCF and only minor modification of the wireless LAN driver is required. SFRC, which uses a modified SampleRate, an ARC implementation in the Madwifi, (SampleRate+) in the autorate period, termed SFRC-SampleRate+, was developed. The results of real-world experiments indicate that SFRC-SampleRate+ is superior to SampleRate and SampleRate+, and is closer to FRC, which uses optimum rate on each link, in terms of throughput in wireless mesh network environments.

This paper presents a memory efficient version of set partitioning in hierarchical tree (SPIHT). The proposed coder called Memory Efficient SPIHT (MESH) uses a single re-usable list instead of three continuously growing linked lists as in conventional SPIHT. The list is re-initialized at the beginning of each bit-plane (coding pass) and is exhausted within the same bit-plane. Another feature of the proposed coder is that it uses a single pass for each bit-plane by merging the sorting and refinement passes of the conventional version of SPIHT. The performance of the proposed coder is measured in terms of coding efficiency, and the worst case dynamic memory requirements due to the list entries in each bit-plane. Performance comparison with SPIHT shows that the proposed coder reduces the dynamic memory requirement by about 50–70% compared to the SPIHT while retaining its coding efficiency.

In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.

In this letter, we propose a packet loss probability (PLP) assessment method that uses active measurements. Considering the statistical nature of measurement data in a network, we adopt the confidence interval to assess whether the performance of a network complies with a target PLP or not. Using both analysis and simulations, we show that the proposed method can guarantee that the probabilities of erroneous assessments are not more than a given significance level. In addition, we provide a systematic method to determine the number of probing packets needed for statistical assurance by presenting a clear relation between the assessment accuracy and the measurement overhead.

The optimal way to build speech understanding modules depends on the amount of training data available. When only a small amount of training data is available, effective allocation of the data is crucial to preventing overfitting of statistical methods. We have developed a method for allocating a limited amount of training data in accordance with the amount available. Our method exploits rule-based methods for when the amount of data is small, which are included in our speech understanding framework based on multiple model combinations, i.e., multiple automatic speech recognition (ASR) modules and multiple language understanding (LU) modules, and then allocates training data preferentially to the modules that dominate the overall performance of speech understanding. Experimental evaluation showed that our allocation method consistently outperforms baseline methods that use a single ASR module and a single LU module while the amount of training data increases.

We investigate the impact of traffic on the performance of large-scale NAT (LSN), since it has been attracting attention as a means of better utilizing the limited number of global IPv4 addresses. We focus on the number of active flows because they drive up the LSN memory requirements in two ways; more flows must be held in LSN memory, and more global IPv4 addresses must be prepared. Through traffic measurement data analysis, we found that more than 1% of hosts generated more than 100 TCP flows or 486 UDP flows at the same time, and on average, there were 1.43-3.99 active TCP flows per host, when the inactive timer used to clear the flow state from a flow table was set to 15 s. When the timer is changed from 15 s to 10 min, the number of active flows increases more than tenfold. We also investigate how to reduce the above impact on LSN in terms of saving memory space and accommodating more users for each global IPv4 address. We show that to save memory space, regulating network anomalies can reduce the number of active TCP flows on an LSN by a maximum of 48.3% and by 29.6% on average. We also discuss the applicability of a batch flow-arrival model for estimating the variation in the number of active flows, when taking into account that the variation is needed to prepare an appropriate memory space. One way to allow each global IPv4 address to accommodate more users is to better utilize destination IP address information when mapping a source IP address from a private address to a global IPv4 address. This can effectively reduce the required number of global IPv4 addresses by 85.9% for TCP traffic and 91.9% for UDP traffic on average.

This letter presents a robust receiver using the generalized sidelobe canceller aided with the high-order derivative constraint technique for multicarrier code-division multiple-access (MC-CDMA) uplink against carrier frequency offset (CFO). Numerical results demonstrate the efficacy of the proposed receiver.

Slotted-waveguide array antennas are attractive because of their low-loss characteristics at high frequencies. Several types of slotted arrays whose polarization angles are inclined to the waveguide axis have been reported. In this paper, we propose a new type of slot array antenna on a rectangular coaxial line for minimizing the waveguide width. As opposed to a conventional waveguide, there is no “cut-off” concept in our proposal because the coaxial line is a transverse electromagnetic (TEM) line. Therefore it is possible to guide the wave even if the diameter of the line is much smaller than that of the waveguide. Moreover, the proposed antenna is a resonant slot array antenna that is based on standing-wave excitation and is thus different from traveling-wave antennas (such as a leaky coaxial cable (LCX)).

In this paper, we discuss the stochastic modeling for operational software reliability measurement, assuming that the testing environment is originally different from the user operation one. In particular, we introduce the concept of systemability which is defined as the reliability characteristic subject to the uncertainty of the field operational environment into the model. First we introduce the environmental factor to consistently bridge the gap between the software failure-occurrence characteristics during the testing and the operation phases. Then we consider the randomness of the environmental factor, i.e., the environmental factor is treated as a random-distributed variable. We use the Markovian imperfect debugging model to describe the software reliability growth phenomena in the testing and the operation phases. We derive the analytical solutions of the several operational software reliability assessment measures which are given as the functions of time and the number of debuggings. Finally, we show several numerical illustrations to investigate the impacts of the consideration of systemability on the field software reliability evaluation.

Nowadays, software development societies have given more precedence to Open Source Software (OSS). There is much research aimed at understanding the OSS society to sustain the OSS product. To lead an OSS project to a successful conclusion, researchers study how developers change source codes called patches in project repositories. In existing studies, we found an argument in the conventional patch acceptance detection procedure. It was so simplified that it omitted important cases from the analysis, and would lead researchers to wrong conclusions. In this research, we propose an algorithm to overcome the problem. To prove out our algorithm, we constructed a framework and conducted two case studies. As a result, we came to a new and interesting understanding of patch activities.

A novel long-term sub-band entropy (LT-SubEntropy) measure, which uses improved long-term spectral analysis and sub-band entropy, is proposed for voice activity detection (VAD). Based on the measure, we can accurately exploit the inherent nature of the formant structure on speech spectrogram (the well-known as voiceprint). Results show that the proposed VAD is superior to existing standard VAD methods at low SNR levels, especially at variable-level noise.

Wireless multimedia sensor networks tend to generate a large number of sensing data packets within a short period. A multi-channel TDMA scheme can avoid the hidden terminal problem and and has been shown to achieve higher performance than the CSMA scheme. In order to deliver large volumes of sensing data within a time limit, our scheme for minigroup multicast can improve the performance gain of the multi-channel TDMA by incorporating deflection routing which constrains any intermediate nodes from serving multiple sessions and establishes a new path detour the nodes on the existing path of multicast sessions. Through simulations, we show that, even though the deflection routing builds non-optimal paths, our scheme supports 95% packet delivery ratio and higher throughput than the legacy multicast routing protocol with CSMA-based media access control.

The impact and benefits of infrastructure support are shown by introducing an achievable throughput scaling law of a ultra-wide band (UWB) ad hoc network in which m base stations (BSs) are regularly located. The existing multi-hop scheme consisting of two variants, with and without BS help, is utilized with a slight modification. Our result indicates that the derived throughput scaling depends on the path-loss exponent due to the power-limited characteristics for all operating regimes examined. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. It thus turns out the use of infrastructure is also helpful in improving the throughput scaling of UWB networks in some conditions.

This paper proposes an alternate time-switched transmission technique for orthogonal frequency division multiplexing systems. There are two antennas in the transmitter but it still has only one baseband/RF and a switch that alternates between the antennas at every symbol timing. Alternating transmit symbols result in zeros which make maximal ratio receive combining possible in the receiver. Simulation results show that it has better performance than the traditional algorithm at the expense of one additional antenna.

IEEE 802.15.4 based devices are a key component for mobile and pervasive computing. However, their small dimensions and reduced resources, together with the intrinsic properties of wireless communication, make it difficult to evaluate such networked systems through real-world trials. In this paper we present an emulation testbed intended for the evaluation of IEEE 802.15.4 networked systems. The testbed builds on the generic framework of the wireless network testbed QOMB, and adds IEEE 802.15.4 network, processor and sensing emulation functionality. We validated the testbed through a series of experiments carried out both through real-world trials in a smart home environment, and through emulation experiments on our testbed. Our results show that one can accurately, and in real time, execute IEEE 802.15.4 network applications on our testbed in an emulated environment that reproduces closely the real scenario.