Symbol-timing estimation in space-time coding systems based on orthogonal training sequences

Space-time coding has received considerable interest recently as a simple transmit diversity technique for improving the capacity and data rate of a channel without bandwidth expansion. Most research in space-time coding, however, assumes that the symbol timing at the receiver is perfectly known. In practice, this has to be estimated with high accuracy. In this paper, a new symbol-timing estimator for space-time coding systems is proposed. It improves the conventional algorithm of Naguib et al. such that accurate timing estimates can be obtained even if the over-sampling ratio is small. Analytical mean-square error (MSE) expressions are derived for the proposed estimator. Simulation and analytical results show that for a modest oversampling ratio (such as Q equal to four), the MSE of the proposed estimator is significantly smaller than that of the conventional algorithm. The effects of the number of transmit and receive antennas, the oversampling ratio, and the length of training sequence on the MSE are also examined. © 2005 IEEE.published_or_final_versio

A semi-blind channel estimation method for multiuser multiantenna OFDM systems

A subspace-based blind method is proposed for estimating the channel responses of a multiuser and multiantenna orthogonal frequency division multiplexing (OFDM) uplink system. It gives estimations to all channel responses subject to a scalar matrix ambiguity and does not need precise channel order information (only upper bound for the orders is required). Furthermore, the scalar ambiguity matrix can be easily resolved by using only one pilot OFDM block, given that the number of users is smaller than the number of symbols in the pilot symbol block. Equalization methods are discussed based on the estimated channels. By using partial knowledge of the channels, a multipath subspace method is proposed that reduces the computational complexity. Simulations show that the methods are effective and robust.published_or_final_versio

Optimal cross layer design for CDMA-SFBC wireless systems

The demand for high speed reliable wireless services has been rapidly growing. Wireless networks have limited resources while wireless channels suffer from fading, interference and time variations. Furthermore, wireless applications have diverse end to end quality of service (QoS) requirements. The aforementioned challenges require the design of spectrally efficient transmission systems coupled with the collaboration of the different OSI layers i.e. cross layer design. To this end, we propose a code division multiple access (CDMA)-space frequency block coded (SFBC) systems for both uplink and downlink transmissions. The proposed systems exploit code, frequency and spatial diversities to improve reception. Furthermore, we derive closed form expressions for the average bit error rate of the proposed systems. In this thesis, we also propose a cross layer resource allocation algorithm for star CDMA-SFBC wireless networks. The proposed resource allocation algorithm assigns base transceiver stations (BTS), antenna arrays and frequency bands to users based on their locations such that their pair wise channel cross correlation is minimized while each user is assigned channels with maximum coherence time. The cooperation between the medium access control (MAC) and physical layers as applied by the optimized resource allocation algorithm improves the bit error rate of the users and the spectral efficiency of the network. A joint cross layer routing and resource allocation algorithm for multi radio CDMA-SFBC wireless mesh networks is also proposed in this thesis. The proposed cross layer algorithm assigns frequency bands to links to minimize the interference and channel estimation errors experienced by those links. Channel estimation errors are minimized by selecting channels with maximum coherence time. On top, the optimization algorithm routes network traffic such that the average end to end packet delay is minimized while avoiding links with high interference and short coherence time. The cooperation between physical, MAC and network layers as applied by the optimization algorithm provides noticeable improvements in average end to end packet delay and success rat

Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions