Space-time array manifold model is usually used in a fast fading channel to estimate delay for the radio location. The existing additive white Gaussian noise (AWGN) estimation error model significantly overestimates the delay estimation. In this paper, we model the estimation error of the space-time array manifold channel impulse response (CIR) matrix as a correlated AWGN matrix and its performance is shown to be closer to the estimation error of practical systems than the existing model.

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 this paper, a refined analytic model is presented for the IEEE 802.11 distributed coordination function (DCF) in a time-varying channel environment. In the proposed model, the channel is modelled using a finite-state Markov (FSM) chain. The saturation throughput and average packet delay are analyzed from the proposed model. It is shown using OPNETTM and UltraSANTM simulations that the proposed model accurately predicts the performance of the IEEE 802.11 DCF.

This paper proposes wavelet packets for use in ultra wideband communications. The pulse shapes that are generated are quasi orthogonal and have almost identical time duration. After normalization, an M-ary signaling set can be constructed allowing higher data rate. Finally, the performance of such a system when multipath propagation occurs is investigated by computer simulations. In order to combat multipath fading, a Rake receiver using coherent channel estimation is designed. This channel estimation is carried out using adaptive algorithms such as least-mean square (LMS), normalized least-mean square (NLMS), or recursive least square (RLS) algorithms which adapt the received signal given a reference signal.

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.

In this letter, we analyze a solution for multiple access technique based on OFDM-CDMA with pilot tone. The proposed system is designed to provide higher data rates in multimedia wireless communications. Primarily, it is achieved by introducing a serial to parallel converter with a pilot tone implemented in each of its output branches. The bit error rates (BER) performance of the proposed scheme are evaluated using computer simulations. The results show that the presented OFDM-CDMA system provides high data rates and low BER and, for the same bandwidth, it performs better than its competitive solution.

The exact calculation of the ergodic and outage capacity for Rayleigh fading single-input multiple-output (SIMO) channels in the presence of unequal-power Rayleigh fading interferers is mathematically quite challenging due to the complicated distribution of the capacity. In this paper, a SIMO system with M receive antennas and N interferers is considered. Based on some statistical results, the closed-form upper and lower bound for the ergodic and outage capacity are derived respectively. These bounds are shown to be simple to compute and appear to be quite tight.

This paper discusses a generalized concept of multiple-symbol differential detection (MDD) and analytically derives weight parameters based on channel prediction for MDD on fast time-varying channels. At first, this paper shows that adaptive maximum-likelihood sequence estimation employing per-survivor processing (PSP-MLSE) with a single channel tap is similar concept to MDD. Next, the weight parameters for MDD are derived according to the channel estimation of PSP-MLSE based on a high order channel prediction. Finally, computer simulation confirms that MDD with the analytically derived parameters mitigates floor of bit error rate (BER) on fast time-varying fading channels without channel state information.

In spatial multiplexing systems using multiple antennas, the error-rate performance is heavily dependent on the residual channel estimation error. In this letter, we propose a design method that uses the genetic algorithms to optimize training sequences for accurate channel estimation.

Multihop techniques in CDMA radio access networks, enable dead-spot mobile stations, which cannot communicate with base stations directly, to send data to them via other mobile stations. In this paper, we propose a mechanism for establishing connections and relaying packets between mobile stations. In this mechanism, the mobile stations are connected to one another and relay packets through a random access channel, which is an uplink common channel. In addition, our mechanism satisfies the requirements for applying multihop techniques to third generation radio access networks. Moreover, we also discuss our evaluation of the performance of the mechanism through computer simulations. The results we obtained reveal that it is capable of reducing dead-spot mobile stations and improving throughput with only limited modifications to conventional systems. Furthermore, we propose an adaptive transmission power control to enhance our mechanism and also evaluate this method through computer simulations.

Orthogonal space-time block codes (STBCs) appear to be a very fascinating means of enhancing reception quality in quasi-static MIMO channels due to their full diversity, and especially their simple maximum-likelihood (ML) decoders. However, full-rate full-diversity orthogonal STBCs do not exist for more than two transmit antennas. Vertical layered space-time architecture (so-called the V-BLAST) with a nulling- and cancelling-based detection algorithm, in contrast, has an ability of achieving high transmission rates at the cost of having very low diversity gain, an undesirable consequence caused by the interference nulling and cancelling processes. The uncoded V-BLAST system is able to reach its ML performance with the aid of the sphere decoder algorithm at the expense of higher detection complexity. Undoubtedly, the tradeoff between transmission rates, diversity, and complexity is inherent in designing space-time codes. This paper investigates a method to increase the "nulling diversity gains" for a general high-rate space-time code and introduces a new design strategy for high-rate space-time codes detected based on interference nulling and cancelling processes, thanks to which high-rate quasi-orthogonal space-time codes for MIMO applications are proposed. We show that when nT transmit and nR=nT receive antennas are deployed, the first code offers a transmission rate of (nT-1) with a minimum nulling diversity order of 3, whereas the second one offers a transmission rate of (nT-2) with a minimum nulling diversity order of 5. Therefore, the proposed codes significantly outperform the V-BLAST as nR=nT. Simulation results and discussions on the performance of the proposed codes are provided.

We have proposed in [5] a practical blind channel identification algorithm for the white observation noise. In this paper, we examine the effectiveness of the algorithm given in [5] for the colored observation noise. The proposed algorithm utilizes Gram-Schmidt orthogonalization procedure and estimates (1) the channel order, (2) the noise variance and then (3) the channel impulse response with less computational complexity compared to the conventional algorithms using eigenvalue decomposition. It can be shown through numerical examples that the algorithm proposed in [5] is quite effective in the colored noise case.

In designing a video-on-demand system, one of the major challenges is how to reduce the client's waiting time maintaining the concurrently used channels. For this reason, the hybrid architectures which integrate the multicast streams with the unicast streams were suggested in order to improve channel efficiency in recent years. In combining multicast with unicast, the ways to group the channels together are important so that more clients can share the multicast transmission channels. This paper proposes a hybrid video-on-demand system which gathers the unicast and multicast transmission channels efficiently by using dynamic channel allocation architecture. The newly proposed architecture can reduce the average client's waiting time significantly. The numerical results demonstrate that the dynamic channel allocation architecture in some case (e.g., 100-channel and 10-video system at 0.5 requests/second) achieves performance gain of 551% compared to existing architecture. This paper presents procedure of channel release and reuse, performance analysis, and simulation results of the dynamic channel allocation architecture.

In this paper, downlink performance of multicarrier CDMA (MC-CDMA) systems under correlated fading channels is analytically investigated. Under code hopping, a signal to interference plus noise ratio (SINR) and bit error rate (BER) performance are derived in multi-cell environments. In addition, specific conditions to validate the commonly used Gaussian approximation of an interference plus noise distribution in MC-CDMA systems are discussed. It is proved that the approximation is adequate in case of low correlation between subcarriers and a large spreading factor (SF). The proposition is confirmed through comparison between analytical and simulation results.

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.

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.

Taking the uplink and downlink cochannel interference and noise into account, we determine the error probability in detecting a binary phase-shift keying (BPSK) signal transmitted over a satellite system containing two high power amplifiers (HPA). The first one is the constituent part of the transmitting ground station and the second one is the constituent part of the satellite station. The emphasis is placed on determining the system performance degradation imposed by the influence of the nonlinear characteristic of the HPA at the transmitting ground station in combination with the negative influences of the uplink and downlink cochannel interference, as well as the nonlinear characteristic of HPA at the satellite station.

We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed that the rejection of a hand-off call is less desirable than that of a new call, for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as different costs. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over the long term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs are exponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-off calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization. Comparison with the static guard channel scheme is made.

For multiple-channel active noise control (ANC) systems, distributed systems consisting of more than one controller are useful. In this paper, we propose a performance improvement algorithm for the distributed multiple-channel ANC system based on the simultaneous equations method. In the proposed algorithm, no estimation of error paths is required. This algorithm can provide good performance in canceling primary noises with auto-/cross-correlations and achieve stable noise reduction under a change of the error paths.

A scalable multicast session announcement system is a key component of a group communication framework over the Internet. It enables the announcement of session parameters (like the {source address; group address} pair) to a potentially large number of users, according to each site administrator's policy. This system should accommodate any flavor of group communication system, like the Any-Source Multicast (ASM) and Source-Specific Multicast (SSM) schemes. In this paper we first highlight the limitations of the current Session Announcement Protocol (SAP) and study several other information distribution protocols. This critical analysis leads us to formulate the requirements of an ideal multicast session announcement system. We then introduce a new session announcement system called "Channel Reflector". It appears as a hierarchical directory system and offers an effective policy and scope control technique. We finally mention some design aspects, like the protocol messages and configuration structures the Channel Reflector uses.