In this paper, we propose a novel array antenna-assisted adaptive modulation scheme for fast fading environments. Although adaptive modulation is an efficient technique capable of establishing high bit-rate digital transmission in a multi-path fading environment, it is sensitive to the fast time variation of the channel because of difficulties in tracking the channel state. To resolve this problem, an array antenna-based Doppler spread compensator was applied to the adaptive modulation scheme. Computer simulation results indicated that the proposed scheme can markedly improve the bit error rate and throughput performance for the region in which the maximum Doppler frequency normalized by the packet length is up to 0.1.

When a mobile node that subscribes to one or more multicast groups moves to another subnet, it is essential to provide a network level multicast handoff mechanism. Previous multicast handoff schemes are based on Mobile IP. However it is known that the Mobile IP is not adequate to interactive multimedia applications such as voice over IP or video conferencing due to its large handoff delay. Additionally, few researches have paid attentions on multicast handoff in infrastructure-mode WLAN environment. This paper proposes a fast inter-subnet multicast handoff method in Mobile IP based infrastructure-mode IEEE 802.11 WLAN environment. We introduce a dedicated Multicast Access Point (MAP) that works with an access points specified in standard IEEE 802.11 WLAN in order to alleviate disruption of receiving multicast datagram. Unlike previous research, our scheme does not modify Mobile IP specifications. MAP detects the completion of link-layer handoff, sends unsolicited IGMP Membership report to its local router on behalf of the mobile station and performs unicast tunneling. We evaluate the proposed method using ns-2 simulation. The simulation result shows that the proposed method can reduce the disruption period due to inter-subnet multicast handoff to about 1/12 and the packet loss rate can be reduced to about 1/4 over 20-size multicast group compared with the standard Mobile IP based IEEE 802.11 WLAN.

In this paper, we briefly describe a fast Jacket transform based on simple matrices factorization. The proposed algorithm needs fewer and simpler computations than that of the existing methods, which are RJ's [2], Lee's [7] and Yang's algorithm [8]. Therefore, it can be easily applied to develop the efficient fast algorithm for signal processing and data communications.

A novel application of fuzzy-neuro approach to protection of double circuit transmission line is demonstrated in this paper. Different system faults on a protected transmission line should be detected and classified rapidly and correctly. Using the proposed approach, fault detection, classification and faulted phase selection could be achieved within a quarter of cycle. Results of performance studies show that the proposed fuzzy-neuro-based module can improve the performance of conventional fault selection algorithms.

A compensation method of the array element pattern is proposed to measure EM field distribution on an observation plane located several wavelengths away from electronic devices in a short time. Numerical and experimental data of the 3 and 5 element collinear dipole array sensors are presented to demonstrate the validity of the proposed method.

Faults in computer systems can occur due to a variety of reasons. These include internal effects such as coupling and external effects such as alpha particles. As we move towards smaller manufacturing technologies, the probability of errors for a single transistor is likely to increase. Even if this probability remains the same, the probability of a fault in a processor will increase linearly with the boost in the number of transistors per chip. In many systems, an error has a binary effect, i.e., the output is either correct or erroneous. However, networking systems exhibit different properties. For example, although a portion of the code behaves incorrectly due to a fault, the application can still work correctly. Therefore, measuring the effects of faults on the network processor applications require new measurement metrics to be developed. Particularly, hardware faults need to be measured in the context of their effect on the application behavior. In this paper, we highlight essential application properties and data structures that can be used to measure the error behavior of network processors. Using these metrics, we study the error behavior of seven representative networking applications under different cache access fault probabilities. With this study, we hope to bridge the gap between the circuit-level phenomena and their impact on the application behavior.

Zero-suppressed BDDs (ZBDDs) have been used in the nonenumerative path delay fault (PDF) grading of VLSI circuits. One basic and one cut-based grading algorithm are proposed to grade circuits with polynomial and exponential number of PDFs, respectively. In this article, we present a new ZBDD-based basic PDF grading algorithm to enable grading of some circuits with exponential number of PDFs without using the cut-based algorithm. The algorithm overcomes the memory overflow problems by dynamically pruning the ZBDD at run-time. This new algorithm may give exact or pessimistic coverage depending on the statuses of the pruned nodes. Furthermore, we re-assess the performance of the static variable ordering heuristics in ZBDDs for PDF coverage calculation. The proposed algorithm combined with the efficient static variable ordering heuristics can avoid ZBDD size explosion in many circuits. Experimental results for ISCAS85 benchmarks show that the proposed algorithm efficiently grades circuits.

This paper proposes a new family of space-time block codes whose transmission rate is 1 symbol per channel use. The proposed space-time codes can achieve full transmit diversity with larger coding gain for the constellation carved from the scaled complex integer ring κZ[i]. It is confirmed that the performances of the proposed space-time codes are superior to the existing space-time block codes by our simulation results.

Future wireless/mobile system is expected to have heterogeneous wireless overlay networks for ubiquitous multimedia communication. In a such network environment, mobile users are likely to try to get attached to higher bandwidth network as bandwidth-hungry multimedia applications are increasing. However, the users have to perform vertical handoff to lower bandwidth network, as high bandwidth network become unavailable due to various reasons (such as its limited coverage, network congestion, etc.). In this paper, we discuss the problem of vertical handoff from a user's perspective. For this purpose, we formulate user satisfaction as a function of bandwidth utility and handoff latency. Then, we investigate the effect of call holding time, user movement probability, etc. on the satisfaction that a user derives from the use of network service for multimedia applications. In addition, based on the evaluation, we present an algorithm for selecting a wireless network, which maximizes the effective user satisfaction.

A rotator graph was proposed as a topology for interconnection networks of parallel computers, and it is promising because of its small diameter and small degree. However, a rotator graph is a directed graph that sometimes behaves harmfully when it is applied to actual problems. A bi-rotator graph is obtained by making each edge of a rotator graph bi-directional. In a bi-rotator graph, average distance is improved against a rotator graph with the same number of nodes. In this paper, we give an algorithm for the container problem in bi-rotator graphs with its evaluation results. The solution achieves some fault tolerance such as file distribution based information dispersal technique. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into two cases according to the position of the destination node. The time complexity of the algorithm and the maximum length of paths obtained are estimated to be O(n3) and 4n-5, respectively. Average performance of the algorithm is also evaluated by computer experiments.

In this paper, we propose an OFDM scheme with pre-IDFT/DFT and the frequency domain equalization on frequency-selective Rayleigh fading channels. In this scheme, a two-dimensional block interleaving is used to randomize the correlated noise caused by the frequency domain linear equalizer. Then, the pre-DFT averages the interleaved noise enhancement and improves the error performance of the proposed scheme. Computer simulations confirm the bit error probability of the proposed scheme for multilevel modulations.

In a CDMA non-linear interference canceller, a generated replica of an interference signal is multiplied by a positive number smaller than unity, which is called cancellation moderating factor (CMF), to prevent interference enhancement due to inaccurate replica subtraction. In this paper, two CMF controlling schemes applicable to a multistage parallel interference canceller with multi-antenna (spatial diversity) reception are proposed. They control CMF by using the mean square error of the complex channel gain or by using the ratio of the estimated power of each interference signal to remaining interference signals' power, in order to mitigate the replica subtraction error due to inaccurate channel estimation. The performance of the proposed schemes are evaluated by computer simulations assuming an asynchronous uplink single chip-rate variable spreading factor DS-CDMA system. The simulation results show that the proposed schemes with higher order diversity reception improve the bit error rate (BER) performance compared with a conventional scheme considering the tentative decision error or fixed CMF settings. Their performance improvement is by 0.1-0.9 dB in terms of the required Eb/N0 at an average BER of 10-5 over exponentially decaying 5-path Rayleigh distributed channels when the number of receiving antennas is 6.

This paper proposes a partial order reduction algorithm for timed trace theoretic verification in order to detect both safety failures and timing failures of timed circuits efficiently. This algorithm is based on the framework of timed trace theoretic verification according to the original untimed trace theory. Consequently, its conformance checking supports hierarchical structure when verifying timed circuits. Experimenting with the STARI and DME circuits, the proposed approach shows its effectiveness.

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 letter compares orthogonal space time codes and quasi-orthogonal codes when the wireless channels are fast fading. It is well known that a orthogonal space-time code is better than a quasi-orthogonal code in high signal-to-noise ratio (SNR) range and that a quasi-orthogonal code is better in low SNR range. In this letter, we show that a quasi-orthogonal space-time code is a better choice even in high SNR range when the channels are fast fading.

The effect of antenna correlation on the Multiple-Input Multiple-Output (MIMO) channel capacity in the real propagation environment is a topic of interest. In this paper, we present the results of a measurement campaign conducted in an indoor Line-Of-Sight (LOS) office environment. Channel responses were taken with varying distance in a static indoor environment. Results showed measurements with high received Signal-to-Noise Ratio (SNR) and a high level of correlation among the antenna elements. Further analysis of the results showed that MIMO systems can achieve sufficient channel capacity compared to the Single-Input Single-Output (SISO) system, despite high antenna correlation. Theoretical analysis reveals that when the SNR is sufficiently high, the loss in channel capacity due to high antenna correlation is relatively low. Therefore it is shown that in the indoor LOS environment, MIMO systems can be sufficiently efficient because the MIMO channel is more robust to antenna correlation when the SNR is high.

This paper describes an estimation of the computational and memory complexities of Greengard-Rokhlin's Fast Multipole Algorithm (GRFMA). GRFMA takes a quad tree structure and six calculation processes. We consider a perfect a-ary tree structure and the number of floating-point operations for each calculation process. The estimation for both complexities shows that the perfect quad tree is the best and the perfect binary tree is the worst. When we apply GRFMA to the computation of realistic problems, volume scattering are the best case and surface scattering are the worst case. In the worst case, the computational and memory complexities of GRFMA are O(Llog2 L) and O(Llog L), respectively. The computational complexity of GRFMA is higher than that of the multilevel fast multipole algorithm.

We propose a method to estimate fault efficiency of test patterns for path delay faults. In path delay fault testing, fault coverage of test patterns is usually very low, because circuits have not only a lot of paths but also a lot of untestable paths. Although fault efficiency would be better metric to evaluate test patterns rather than fault coverage, it is too difficult to compute it exactly, if we do not compute the total number of untestable paths exactly. The proposed method samples a part of paths after untestable path analysis, and estimate fault efficiency based on the percentage of untestable paths in the sample paths. Through our experimental results, we show that the proposed method can accurately estimate fault efficiency of test patterns in a reasonable time. Also, since the accuracy of fault efficiency estimated with the proposed method depends on how to sample the paths, we look into the influence of path sampling methods to the accuracy in the experiments.

The multichannel switch is an architecture widely used for ATM (Asynchronous Transfer Mode). It is known that the fault tolerant characteristic can be incorporated in into the multichannel crossbar switching fabric. For example, if a link belonging to a multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if a fault occurs in a switching element, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithms in multichannel crossbar ATM switches with a view to early fault recovery. The optimal algorithm gives the best performance in terms of time to localization but is computationally complex, which makes it difficult to operate in real time. We develop an online algorithm which is computationally more efficient than the optimal one. We evaluate its performance through simulation. The simulation results show that the performance of the online algorithm is only slightly suboptimal for both random and bursty traffic. There are cases where the proposed online algorithm cannot pinpoint down to a single fault. We explain the causes and enumerate those cases. Finally, a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm. The fault recovery algorithm adds extra rows and columns to allow cells to detour the faulty element.

In this paper, a pilot-assisted channel estimation using adaptive interpolation (in which, different interpolation filter tap weights is used for different symbol position) is proposed. Each set of tap weights is updated using the normalized least mean square (NLMS) algorithm, the reference signal for which is obtained by decision feedback and reverse modulation of the received data symbol. In order to reduce the number of tap weight sets and to achieve fast convergence, the conjugate centrosymmetry property of the tap weight set is used. The average bit error rate (BER) performance in a frequency-selective Rayleigh fading channel is evaluated by computer simulation. Also evaluated is the robustness against the frequency offset between a transmitter and a receiver.