Exploiting Diversity in Broadband Wireless Relay Networks

Fading is one of the most fundamental impairments to wireless communications. The standard approach to combating fading is by adding redundancy - or diversity - to help increase coverage and transmission speed. Motivated by the results in multiple-input multiple-output technologies, which are usually used at base stations or access points, cooperation commutation has been proposed to improve the performance of wireless networks which consist of low-cost single antenna devices. While the majority of the research in cooperative communication focuses on flat fading for its simplicity and easy analysis, in practice the underlying channels in broadband wireless communication systems such as cellular systems (UMTS/LTE) are more likely to exhibit frequency selective fading. In this dissertation, we consider a frequency selective fading channel model and explore distributed diversity techniques in broadband wireless relay networks, with consideration to practical issues such as channel estimation and complexity-performance tradeoffs. We first study a system model with one source, one destination and multiple decode-and-forward (DF) relays which share a single channel orthogonal to the source. We derive the diversity-multiplexing tradeoff (DMT) for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system at the expense of higher complexity, compared to the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we find special cases when the three relaying strategies have the same DMT. We further present a transceiver design and prove it can achieve the optimal DMT asymptotically. Monte Carlo simulations are presented to corroborate the theoretical analysis. We provide a detailed performance comparison of the three relaying strategies in channels encountered in practice. The work has been extended to systems with multiple amplify-and-forward relays. We propose two relay selection schemes with maximum likelihood sequential estimator and linear zero- forcing equalization at the destination respectively and both schemes can asymptotically achieve the optimal DMT. We next extend the results in the two-hop network, as previously studied, to multi-hop networks. In particular, we consider the routing problem in clustered multi-hop DF relay networks since clustered multi-hop wireless networks have attracted significant attention for their robustness to fading, hierarchical structure, and ability to exploit the broadcast nature of the wireless channel. We propose an opportunistic routing (or relay selection) algorithm for such networks. In contrast to the majority of existing approaches to routing in clustered networks, our algorithm only requires channel state information in the final hop, which is shown to be essential for reaping the diversity offered by the channel. In addition to exploiting the available diversity, our simple cross-layer algorithm has the flexibility to satisfy an additional routing objective such as maximization of network lifetime. We demonstrate through analysis and simulation that our proposed routing algorithm attains full diversity under certain conditions on the cluster sizes, and its diversity is equal to the diversity of more complicated approaches that require full channel state information. The final part of this dissertation considers channel estimation in relay networks. Channel state information is vital for exploiting diversity in cooperative networks. The existing literature on cooperative channel estimation assumes that block lengths are long and that channel estimation takes place within a fading block. However, if the forwarding delay needs to be reduced, short block lengths are preferred, and adaptive estimation through multiple blocks is required. In particular, we consider estimating the relay-to-destination channel in DF relay systems for which the presence of forwarded information is probabilistic since it is unknown whether the relay participates in the forwarding phase. A detector is used so that the update of the least mean square channel estimate is made only when the detector decides the presence of training data. We use the generalized likelihood ratio test and focus on the detector threshold for deciding whether the training sequence is present. We also propose a heuristic objective function which leads to a proper threshold to improve the convergence speed and reduce the estimation error. Extensive numerical results show the superior performance of using this threshold as opposed to fixed thresholds

Intersymbol and Intercarrier Interference in OFDM Transmissions through Highly Dispersive Channels

This work quantifies, for the first time, intersymbol and intercarrier interferences induced by very dispersive channels in OFDM systems. The resulting achievable data rate for \wam{suboptimal} OFDM transmissions is derived based on the computation of signal-to-interference-plus-noise ratio for arbitrary length finite duration channel impulse responses. Simulation results point to significant differences between data rates obtained via conventional formulations, for which interferences are supposed to be limited to two or three blocks, versus the data rates considering the actual channel dispersion

Modeling of Orthogonal Frequency Division Multiplexing (OFDM) for Transmission in Broadband Wireless Communications

Orthogonal Frequency Division Multiplexing (OFDM) is a multi carrier modulation technique that provides high bandwidth efficiency because the carriers are orthogonal to each other and multiple carriers share the data among themselves. The main advantage of this transmission technique is its robustness to channel fading in wireless communication environment. This paper investigates the effectiveness of OFDM and assesses its suitability as a modulation technique in wireless communications. Several of the main factors affecting the performance of a typical OFDM system are considered and they include multipath delay spread, channel noise, distortion (clipping), and timing requirements. The core processing block and performance analysis of the system is modeled usingMatlab

Applying Frequency-Domain Equalization to Code-Division Multiple Access and Transform-Domain Communications Systems

This research examined the theory and application of using orthogonal frequency division multiplexing (OFDM), or discrete multi-tone (DMT), frequency domain equalization (FEQ) with two communications systems that inherently possess unused carrier frequencies, or null-tones, in their respective transmission frequencies. The fundamental DMT-FEQ property relies on null-tones to equalize a non-ideal channel and mitigate the effects of interchannel interference (ICI), intersymbol interference (ISI), and noise. The two communications systems investigated were a Hadamard encoded code division multiple access (CDMA) communications system with up to 32 synchronous users and a transform domain communications system (TDCS) with only one user. Both communications systems were simulated while operating with real channel data corrupted by noise. Simulation results showed that the Hadamard encoded CDMA system worked well with DMT-FEQ only when the Hadamard code set was used to construct a transmission signal that obeyed DMT-FEQ null-tone conditions in conjunction with a vector estimation method. Simulation results also showed that a TDCS using traditional pseudo-random phase component, and traditional spectral mask with consecutive null-tones, did not work well with DMT-FEQ. Modifications to the TDCS model revealed that a TDCS with a conjugate-symmetric phase component in conjunction with a modified spectral mask with consecutive null-tones and forced null-tones provided acceptable results when equalizing with DMT-FEQ. The DMT-FEQ may be suitable for covert applications, such as TDCS, when modifications to TDCS’ phase component and forced null-tones in its spectral mask are made

Classical and Bayesian Linear Data Estimators for Unique Word OFDM

Unique word - orthogonal frequency division multiplexing (UW-OFDM) is a novel OFDM signaling concept, where the guard interval is built of a deterministic sequence - the so-called unique word - instead of the conventional random cyclic prefix. In contrast to previous attempts with deterministic sequences in the guard interval the addressed UW-OFDM signaling approach introduces correlations between the subcarrier symbols, which can be exploited by the receiver in order to improve the bit error ratio performance. In this paper we develop several linear data estimators specifically designed for UW-OFDM, some based on classical and some based on Bayesian estimation theory. Furthermore, we derive complexity optimized versions of these estimators, and we study their individual complex multiplication count in detail. Finally, we evaluate the estimators' performance for the additive white Gaussian noise channel as well as for selected indoor multipath channel scenarios.Comment: Preprint, 13 page

Study And Analysis Of An Optical OFDM Based On The Discrete Hartley Transform For IM/DD Systems

Projecte fet en col.lboració amb CTTC. Centre Tecnològic de Telecomunicacions de CatalunyaOrthogonal frequency division multiplexing (OFDM) is used extensively in broadband wired and wireless communication systems because it is an effective solution to inter channel. While many details of OFDM systems are very complex, the basic concept of OFDM is quite simple: data is transmi number of different frequencies, and as a result the symbol period is much longer than for a serial system with the same total data rate. Because the symbol period is longer, ISI affects at most one symbol, and equalization is simplified. In most OFDM implementations any residual ISI is removed by using a form of guard interval called a cyclic prefix