1,398 research outputs found

    SAGE-based estimation algorithms for time-varying channels in amplify-and-forward cooperative networks

    Get PDF
    Cooperative communication is a technique that achieves spatial diversity by exploiting the presence of other nodes in the network. Most analyses of such networks are conducted under the simplifying assumption of perfect channel knowledge. In this paper we focus on the popular Amplify-and-forward (AF) cooperative protocol. We propose several SAGE-based iterative algorithms with different complexities for estimating the channel gain and noise variance in the case of time-varying channels. Computer simulations are provided to evaluate their performance over Rice-fading channels. We point out a low-complexity estimation algorithm yielding an error performance that (for Rayleigh fading) is only about 0.5 dB worse than in the case of perfect estimation, while outperforming a pilot-based estimation algorithm by about 1.5 dB

    Estimation of Synchronization Parameters in AF Cooperative Networks

    Get PDF
    In cooperative networks, multiple carrier frequency offsets (MCFOs) and multiple timing offsets (MTOs) originate due to multiple distributed nodes. In this paper, algorithms for joint estimation of these parameters and channels in amplify-and-forward (AF) relaying networks are proposed. A new training model and transceiver structure at the relays for achieving synchronization throughout the network is devised. New exact closed-form expressions for the Cram´er-Rao lower bounds (CRLBs) for the multi-parameter estimation problem are derived. An estimation method is proposed for jointly estimating MCFOs, MTOs, and channel gains at the destination based on space-alternating generalized expectation maximization (SAGE) and compared to a computationally-intensive least squares (LS) approach. The proposed estimator’s performance is shown to be close to the CRLB at mid-to-high signal-to-noise ratio (SNR) resulting in significant cooperative performance gains in the presence of practical impairments

    Synchronization in Cooperative Communication Systems

    No full text
    Cooperative communication is an attractive solution to combat fading in wireless communication systems. Achieving synchronization is a fundamental requirement in such systems. In cooperative networks, multiple single antenna relay terminals receive and cooperatively transmit the source information to the destination. The multiple distributed nodes, each with its own local oscillator, give rise to multiple timing offsets (MTOs) and multiple carrier frequency offsets (MCFOs). Particularly, the received signal at the destination is the superposition of the relays' transmitted signals that are attenuated differently, are no longer aligned with each other in time, and experience phase rotations at different rates due to different channels, MTOs, and MCFOs, respectively. The loss of synchronization due to the presence of MTOs and MCFOs sets up the recovery of the source signal at the destination to be a very challenging task. This thesis seeks to develop estimation and compensation algorithms that can achieve synchronization and enable cooperative communication for both decode-and-forward (DF) and amplify-and-forward (AF) relaying networks in the presence of multiple impairments, i.e., unknown channel gains, MTOs, and MCFOs. In the first part of the thesis, a training-based transmission scheme is considered, in which training symbols are transmitted first in order to assist the joint estimation of multiple impairments at the destination node in DF and AF cooperative relaying networks. New transceiver structure at the relays and novel receiver design at the destination are proposed which allow for the decoding of the received signal in the presence of unknown channel gains, MTOs, and MCFOs. Different estimation algorithms, e.g., least squares (LS), expectation conditional maximization (ECM), space-alternating generalized expectation-maximization (SAGE), and differential evolution (DE), are proposed and analyzed for joint estimation of multiple impairments. In order to compare the estimation accuracy of the proposed estimators, Cramer-Rao lower bounds (CRLBs) for the multi-parameter estimation are derived. Next, in order to detect the signal from multiple relays in the presence of multiple impairments, novel optimal and sub-optimal minimum mean-square error (MMSE) compensation and maximum likelihood (ML) decoding algorithm are proposed for the destination receiver. It has been evidenced by numerical simulations that application of the proposed estimation and compensation methods in conjunction with space-time block codes achieve full diversity gain in the presence of channel and synchronization impairments. Considering training-based transmission scheme, this thesis also addresses the design of optimal training sequences for efficient and joint estimation of MTOs and multiple channel parameters. In the second part of the thesis, the problem of joint estimation and compensation of multiple impairments in non-data-aided (NDA) DF cooperative systems is addressed. The use of blind source separation is proposed at the destination to convert the difficult problem of jointly estimating the multiple synchronization parameters in the relaying phase into more tractable sub-problems of estimating many individual timing offsets and carrier frequency offsets for the independent relays. Next, a criteria for best relay selection is proposed at the destination. Applying the relay selection algorithm, simulation results demonstrate promising bit-error rate (BER) performance and realise the achievable maximum diversity order at the destination

    Timing estimation and resynchronization for amplify-and-forward communication systems

    Get PDF
    This paper proposes a general framework to effectively estimate the unknown timing and channel parameters, as well as design efficient timing resynchronization algorithms for asynchronous amplify-and-forward (AF) cooperative communication systems. In order to obtain reliable timing and channel parameters, a least squares (LS) estimator is proposed for initial estimation and an iterative maximum-likelihood (ML) estimator is derived to refine the LS estimates. Furthermore, a timing and channel uncertainty analysis based on the CramrRao bounds (CRB) is presented to provide insights into the system uncertainties resulted from estimation. Using the parameter estimates and uncertainty information in our analysis, timing resynchronization algorithms that are robust to estimation errors are designed jointly at the relays and the destination. The proposed framework is developed for different AF systems with varying degrees of timing misalignment and channel uncertainties and is numerically shown to provide excellent performances that approach the synchronized case with perfect channel information. © 2006 IEEE.published_or_final_versio

    User Cooperation in TDMA Wireless System

    Get PDF
    Abstract: Reliability of radio link is limited, owing to path loss, shadowing and multi-path fading. This necessitates the use of a certain type of diversity. In recent years, cooperative diversity has gained considerable attention. Here, wireless nodes cooperate in such a way that they share their antennas and other resources, to create a virtual array through distributed transmission and signal processing. This increases coverage and reduces transmitted power, thereby bringing down co-channel interference, which results in increased system capacity. This paper gives an overview of the state of art of various cooperation schemes and issues related to their implementation

    Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

    Get PDF
    Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

    Low-complexity a posteriori probability approximation in EM-based channel estimation for trellis-coded systems

    Get PDF
    When estimating channel parameters in linearly modulated communication systems, the iterative expectation-maximization (EM) algorithm can be used to exploit the signal energy associated with the unknown data symbols. It turns out that the channel estimation requires at each EM iteration the a posteriori probabilities (APPs) of these data symbols, resulting in a high computational complexity when channel coding is present. In this paper, we present a new approximation of the APPs of trellis-coded symbols, which is less complex and requires less memory than alternatives from literature. By means of computer simulations, we show that the Viterbi decoder that uses the EM channel estimate resulting from this APP approximation experiences a negligible degradation in frame error rate (FER) performance, as compared to using the exact APPs in the channel estimation process

    Adaptive modulation, coding and power allocation in cognitive radio networks

    Get PDF

    Channel estimation, synchronisation and contention resolution in wireless communication networks

    Get PDF
    In the past decade, the number of wireless communications users is increasing at an unprecedented rate. However, limited radio resources must accommodate the increasing number of users. Hence, the efficient use of radio spectrum is a critical issue that needs to be addressed. In order to improve the spectral efficiency for the wireless communication networks, we investigate two promising technologies, the relaying and the multiple access schemes. In the physical (PHY) layer of the open systems interconnect (OSI) model, the relaying schemes are capable to improve the transmission reliability and expand transmission coverage via cooperative communications by using relay nodes. Hence, the two-way relay network (TWRN), a cooperative communications network, is investigated in the first part of the thesis. In the media access control (MAC) layer of the OSI model, the multiple access schemes are able to schedule multiple transmissions by efficiently allocating limited radio resources. As a result, the contention-based multiple access schemes for contention resolution are explored in the second part of the thesis. In the first part of the thesis, the channel estimation for the two-way relay networks (TWRNs) is investigated. Firstly, the channel estimation issue is considered under the assumption of the perfect synchronisation. Then, the channel estimation is conducted, by relaxing the assumption of perfect synchronisation. Another challenge facing the wireless communication systems is the contention and interference due to multiple transmissions from multiple nodes, sharing the common communication medium. To improve the spectral efficiency in the media access control layer, a self-adaptive backoff (SAB) algorithm is proposed to resolve contention in the contention-based multiple access networks
    • …
    corecore