We propose a rapid and reliable signal acquisition scheme for UWB (Ultra Wide Band) systems in indoor wireless environments. The proposed scheme is a two-step search with different thresholds and search windows, where each step utilizes the single-dwell search with the bit reversal. Simulation results show that the proposed scheme for the UWB signals can achieve significant reduction of the required mean acquisition time as compared to other schemes including general double-dwell search scheme for various threshold levels. Furthermore, it is also observed that the proposed scheme can achieve much faster and reliable signal acquisition as the first threshold is larger in noisy environments.

Multi-Protocol Label Switching (MPLS) can efficiently support the explicit routes setup by the use of Label Switched Paths (LSPs) between an ingress Label Switched Router (LSR) and an egress LSR. Hence it is possible to distribute the network traffic among several paths to achieve load balancing, thus improving the network utilization, and minimizing the congestion. The packet-level traffic characteristics in the Internet is so complex that it is natural to do traffic engineering (TE) and control at the flow level. The emerging Multi-Protocol Label Switching (MPLS) has introduced an attractive solution to TE in IP networks. The main objective of this paper is to balance traffic at the flow level among the parallel Label Switched Paths (LSPs) in MPLS networks. We introduce a multipath load-balancing model at the flow level. In this model, each LSP is modeled as an M/G/1 processor-sharing queue. The load-balancing problem is then considered as an optimization problem. Based on the analysis of the model, we propose a heuristic but efficient mechanism that can make good use of the traffic characteristics at the flow level. Packet disorder is avoided effectively by dispatching packets belonging to one flow to the same path. This mechanism only need to be implemented in the ingress LSRs and the egress LSRs, while the intermediate LSRs only forward the packets. Apart from discussing the traffic allocation granularity, and the implementation issues in details, we have also performed extensive simulations using NS-2 with MPLS modules. The simulation results show that the load through the network is well balanced so that the network throughput is improved and the delay is decreased efficiently.

A space-time RAKE (ST-RAKE) receiver with a blind interference-blocking (IB) pre-processor, termed as the IB-RAKE receiver, is proposed for spread spectrum communications systems. The design of the proposed architecture consists of three components. A blind IB transformer is first constructed based on the received data, and then applied on the undespread data for the suppression of strong interference. After despreading, optimal beamforming is then performed on the IB despread data to extract the signals of interest (SOIs) from the desired user. Finally, a RAKE receiver with a maximum ratio combining technique is employed to constructively collect all the SOI energies. Since strong interference has been removed in the first stage, the RAKE receiver combines only those SOIs plus negligible interference, leading to robustness against strong interference. Numerical results have shown that substantial improvement can be obtained from the proposed ST-RAKE receiver with the blind IB pre-processing scheme.

This paper provides an overview of research in channel modeling for multiple-input multiple-output (MIMO) data transmission focusing on a radio wave propagation. A MIMO channel is expressed as an equivalent circuit with a limited number of eigenpaths according to the singular-value decomposition (SVD). Each eigenpath amplitude depends on the propagation structure not only of the path direction profiles for both transmission and reception points but also of intermediate regions. Inherent in adaptive control is the problem of instability as a hidden difficulty. In this paper these issues are addressed and research topics on MIMO from a radio wave propagation viewpoint are identified.

In this paper, we present a set of sequence pairs which produce zero correlation windows not only in the middle part of the sum of aperiodic correlation functions, but also in the two terminal parts. We name it "Ear Windows." In approximately synchronous CDMA communication system, this set of sequences is able to completely remove the inter-symbol interference (ISI) and multi-user interference (MUI) caused by the multi-path effect if the maximum delay is shorter than the length of the "Ear windows." In addition, it is also feasible in M-ary modulation. The inter-code interference will be mitigated drastically.

This letter presents a timing synchronization method of high-rate wireless personal area network (WPAN) systems encountered with a multipath fading channel. Two-stage timing synchronization using constant amplitude zero auto-correlation (CAZAC) training symbols and correlation techniques is adopted. At the same time, a simple way of setting a reliable threshold used to estimate WPAN timing is provided.

The problem of estimating code timings in DS-CDMA systems with multiple antennas is considered in the presence of multipath time-varying fading channels and near-far environments. We present an efficient algorithm for an approximate maximum likelihood approach of jointly estimating the multipath timings of a desired user for DS-CDMA systems that consist of multiple antennas either uncorrelated or fully correlated in space. The procedures of the algorithm to estimate code-timings are developed in order to better exploit the time-varying characteristics of the fading process. In the multipath fading channels, the solution of the proposed algorithms is based on successively optimizing the criterion for increasing numbers of multipath delays. It is shown via simulation results that the modified approaches of the approximate maximum likelihood algorithm much more improve its acquisition performance in the time-varying fading channels. It is seen that the acquisition performance of multiple antennas based acquisition scheme is much better than that of a single antenna based timing estimator in the presence of multipath fading channels and the near-far problem. Furthermore, it is observed that the proposed algorithms outperform the correlator and MUSIC estimator in the multiuser environments with near-far situation on time-varying Rayleigh fading channels.

In this paper, we propose a multiple-input multiple-output (MIMO) beamforming scheme for a multiuser system in frequency-selective fading channels. The maximum signal-to-noise and interference ratio (MSINR) is adopted as a criterion to determine the transmit and receive weight vectors. In order to maximize the output SINR over all users, two algorithms for base station are considered: the first algorithm is based on the receive weight vector optimization and the second algorithm is based on an iterative update of both transmit and receive weight vectors. Based on the result of single user MIMO beamforming, we analyze the interference channels cancellation ability of multiuser MIMO system. The first algorithm is a simple method and the second algorithm is a performative solution. Through computer simulations, it is shown that multiuser communication system is achievable using the proposed methods in frequency-selective fading condition.

In this paper, we propose a spatio-temporal equalizer for the space-time block coded transmission over the frequency selective fading channels with the presence of co-channel interference (CCI). The proposed equalizer, based on the tapped delay line adaptive array (TDLAA), performs signal equalization and CCI suppression simultaneously using the minimum mean square error (MMSE) method. It is to show that our scheme outperforms the previous two-stage combined adaptive antenna and delayed decision feedback sequence estimator (DDFSE) approach. We also show that performance can be further improved if the synchronization between the preceding and delayed paths is achieved.

In this paper, we improve the performance analysis of the Rake receiver for the DS-CDMA forward link using long random spreading sequences (RSS's) by more accurately evaluating the correlation between the various interference terms. We also extend the analysis to the case of short (periodic) RSS. The accuracy of the expressions obtained in our analysis is verified by computer simulation. We show that for a given normalized spreading factor, the bit error rate (BER) performance of the Rake receiver is the same for BPSK and QPSK data modulation. We also show that when the channel delay spread is smaller than a data symbol duration, the CDMA receiver has similar BER performance for long and short RSS's. However, for large delay spread, the employment of short RSS's may result in severe performance degradation.

This letter derives and computes the detection probability for timing synchronization in an orthogonal frequency division multiplexing (OFDM) system encountered with a multipath Rayleigh fading channel. OFDM timing synchronization using constant amplitude zero auto-correlation (CAZAC) training symbols and correlation techniques is adopted. With this provision, we focus on the numerical analysis for OFDM timing synchronization scheme employing a preadvancement technique to reduce the inter-symbol interference (ISI). For measuring system performance, the sync detection performance derived in the considered system is presented in a multipath Rayleigh fading channel.

In this paper, we propose a multiuser detection (MUD) scheme for space-time block coded orthogonal frequency division multiplexing (STBC-OFDM) systems. We derive the optimum weight matrix used to decouple simultaneously signals from active multiple access users using the minimum mean square error (MMSE) multiuser detection method. The proposed scheme provides good performance over different models of the frequency selective fading channel. It is also to show that if the length of the cyclic prefix is larger than that of the channel, the performance of the detector depends on only the total energy extracted from multipath components but not the employed channel model, the number of multipath components or the delay of each multipath component.

In this paper, we propose a novel traffic engineering architecture for IP networks with MPLS backbones. In this architecture, two link-disjoint label switched paths, namely the primary and secondary paths, are established among every pair of IP routers located at the edges of an MPLS backbone network. As the main building block of this architecture, we propose that primary paths are given higher priority against the secondary paths in the MPLS data plane to cope with the so-called knock-on effect. Inspired by the ABR flow control mechanism in ATM networks, we propose to split traffic between a source-destination pair between the primary and secondary paths using explicit rate feedback from the network. Taking into consideration the performance deteriorating impact of packet reordering in packet-based load balancing schemes, we propose a traffic splitting mechanism that operates on a per-flow basis (i.e., flow-based multipath routing). We show via an extensive simulation study that using flow-based multipath traffic engineering with explicit rate feedback not only provides consistently better throughput than that of a single path but is also void of out-of-order packet delivery.

This paper presents a novel decoding strategy called combined iterative demapping/decoding (CIDD), for coded M-ary biorthogonal keying-based direct sequence ultra-wideband (MBOK DS-UWB) systems. A coded MBOK DS-UWB system consists of a convolutional encoder, an interleaver, and an MBOK DS-UWB pulse mapper. CIDD improves the error rate performance of MBOK DS-UWB systems by applying the turbo principle to the demapping and decoding processes at the receiver side. To develop the CIDD, a soft-in/soft-out MBOK demapping algorithm, based on the max-log-MAP algorithm, was derived. Simulation results showed that using CIDD siginificantly improved the error rate performance of both static and multipath fading channels. It was also shown that the computational complexity of CIDD is comparable to that of the Viterbi decoding used in [133,171]8 conventional convolutional coding.

Wavelet packet modulation (WPM) using the discrete wavelet transform is a multiplexing transmission method in which data is assigned to wavelet subbands having different time and frequency resolutions. The WPM keeps data transmission throughput even in tone and impulse interference environments that cannot be achieved with conventional multiplexing methods such as TDM (Time division multiplexing) or OFDM (Orthogonal frequency division multiplexing). In this paper, we propose an effective multicarrier transmission method of WPM for wireless mobile communications. First, the transmission characteristics of WPM in fading environments are minutely investigated. Then, taking the advantage of the WPM and the OFDM that has an equalizing technique in multipath fading environments, we propose a multimode transmission method using them. The adaptive transmission in those fading and interference environments is achieved by using the multimode transmission. Their transmission performances are evaluated by computer simulations.

An ultra wide band channel sounder has been developed and has attained the time delay resolution of 0.5 ns which enables the propagation path discrimination in indoor wireless propagation environments as well as the direction-of-arrival measurements by power delay profile measurements.

Smart or adaptive antennas promise to provide significant space-time communications against fading in wireless communication systems. In this paper, we propose multiple-input multiple-output (MIMO) beamforming for frequency-selective fading channels to maximize the Signal-to-Noise and Interference Ratio (SINR) based on an iterative update algorithm of transmit and receive weight vectors with prior knowledge of the channel state information (CSI) at both the transmitter and receiver. We derive the necessary conditions for an optimum weight vector solution and propose an iterative weight update algorithm for an optimal SINR reception. The Maximum Signal-to-Noise (MSN) method, where noise includes the additive gaussian noise and interference signals, is used as a criterion. The proposed MIMO with M N arrays allows the cancellation of M + N - 2 delayed channels. Computer simulations are presented to verify our analysis. The results show that significant improvements in performance are possible in wireless communication systems.

Reduced-state sequence estimation (RSSE) for trellis-coded modulation (TCM) in cyclic prefixed single carrier (CPSC) with minimum mean-square error-linear equalization (MMSE-LE) on frequency-selective Rayleigh fading channels is proposed. The Viterbi algorithm (VA) is used to search for the best path through the reduced-state trellis combined equalization and TCM decoding. Computer simulations confirm the symbol error probability of the proposed scheme.

An adaptive filtering algorithm based on the sliding window criterion is known to be very attractive for violent changing environments. In this paper, a new sliding window linearly constrained recursive least squares (SW-LC-RLS) algorithm based on the modified minimum mean squared error (MMSE) structure is devised for the RAKE receiver in direct sequence spread spectrum code-division multiple access (DS-SS CDMA) system over multipath fading channels, where the channel estimation scheme is accomplished at the output of adaptive filter. The proposed SW-LC-RLS algorithm has the advantage of having faster convergence property and tracking ability, and can be applied to the environments, where the narrowband interference is joined suddenly to the system, to achieve desired performance. Via computer simulation, we show that the performance, in terms of mean square errors (MSE), signal to interference plus noise ratio (SINR) and bit error rate (BER), is superior to the conventional LC-RLS and orthogonal decomposition-based LMS algorithms based on the MMSE structure.

A traffic engineering problem in a network consists of setting up paths between the edge nodes of the network to meet traffic demands while optimizing network performance. It is known that total traffic throughput in a network, or resource utilization, can be maximized if a traffic demand is split over multiple paths. However, the problem formulation and practical algorithms, which calculate the paths and the load-splitting ratios by taking bandwidth, the route constraints or policies into consideration, have not been much touched. In this paper, we formulate the constrained multipath-routing problems with the objective of minimizing the maximum of link utilization, while satisfying bandwidth, the maximum hop count, and the not-preferred node/link list in Linear Programming (LP). Optimal solutions of paths and load-splitting ratios found by an LP solver are shown to be superior to the conventional shortest path algorithm in terms of maximum link utilization, total traffic volume, and number of required paths. Then, we propose a heuristic algorithm with low computational complexity that finds near optimal paths and load-splitting ratios satisfying the given constraints. The proposed algorithm is applied to Multi-Protocol Label Switching (MPLS) that can permit explicit path setup, and it is tested in a fictitious backbone network. The experiment results show that the heuristic algorithm finds near optimal solutions.