In this work, we observe the behavior of block space-time code in wireless channel dynamics. The block space-time code is optimally constructed in slow fading. The block code in quasi-static fading channels provides affordable complexity in design and construction. Our results show that the performance of the block space-time code may not be as good as conventionally convolutional coding with s...

We present a new framework for code-division multiple access (CDMA) communication over fast fading mobile wireless channels. The performance of the RAKE receiver, which is at the heart of existing CDMA systems, degrades substantially under fast fading encountered in many mobile scenarios. Due to the time-varying nature of the fast fading channel, we employ joint time-frequency processing, which...

Assume a STC (space-time codes) OFDM (orthogonal frequency-division multiplexing) scheme the receiver antennas and multiple transmitters on compared time-chosen fading channels and frequency. It has been displayed that the time-selectivity product array is the input parameter to describe the associated fading channel outage capacity. It is considered that space-time codes with huge efficient ex...

We complete the result in [2] by showing the exponential decay of the perturbation of the laminar solution below the critical Rayleigh number and of the convective solution above the Rayleigh number, in the kinetic framework.

In this paper, we discuss the convergence of two time window discretization methods for the traveling salesman problem with time window constraints. These methods are general and can be applied to other vehicle routing and scheduling problems with time windows. The first method provides a feasible solution to the problem while the second provides a lower bound for the minimization problem. Anal...