19,398 research outputs found

    Differential Distributed Space-Time Coding with Imperfect Synchronization in Frequency-Selective Channels

    Full text link
    Differential distributed space-time coding (D-DSTC) is a cooperative transmission technique that can improve diversity in wireless relay networks in the absence of channel information. Conventionally, it is assumed that channels are flat-fading and relays are perfectly synchronized at the symbol level. However, due to the delay spread in broadband systems and the distributed nature of relay networks, these assumptions may be violated. Hence, inter-symbol interference (ISI) may appear. This paper proposes a new differential encoding and decoding process for D-DSTC systems with multiple relays over slow frequency-selective fading channels with imperfect synchronization. The proposed method overcomes the ISI caused by frequency-selectivity and is robust against synchronization errors while not requiring any channel information at the relays and destination. Moreover, the maximum possible diversity with a decoding complexity similar to that of the conventional D-DSTC is attained. Simulation results are provided to show the performance of the proposed method in various scenarios.Comment: to appear in IEEE Transaction on Wireless Communications, 201

    Adaptive relaying protocol multiple-input multiple-output orthogonal frequency division multiplexing systems

    Get PDF
    In wireless broadband communications, orthogonal frequency division multiplexing (OFDM) has been adopted as a promising technique to mitigate multi-path fading and provide high spectral efficiency. In addition, cooperative communication can explore spatial diversity where several users or nodes share their resources and cooperate through distributed transmission. The concatenation of the OFDM technique with relaying systems can enhance the overall performance in terms of spectral efficiency and improve robustness against the detrimental effects of fading. Hybrid relay selection is proposed to overcome the drawbacks of conventional forwarding schemes. However, exciting hybrid relay protocols may suffer some limitations when used for transmission over frequency-selective channels. The combination of cooperative protocols with OFDM systems has been extensively utilized in current wireless networks, and have become a promising solution for future high data rate broadband communication systems including 3D video transmission. This thesis covers two areas of high data rate networks. In the first part, several techniques using cooperative OFDM systems are presented including relay selection, space time block codes, resource allocation and adaptive bit and power allocation to introduce diversity. Four (4) selective OFDM relaying schemes are studied over wireless networks; selective OFDM; selective OFDMA; selective block OFDM and selective unequal block OFDM. The closed-form expression of these schemes is derived. By exploiting the broadcast nature, it is demonstrated that spatial diversity can be improved. The upper bound of outage probability for the protocols is derived. A new strategy for hybrid relay selection is proposed to improve the system performance by removing the sub-carriers that experience deep fading. The per subcarrier basis selection is considered with respect to the predefined threshold signal-to-noise ratio. The closed-form expressions of the proposed protocol in terms of bit error probability and outage probability are derived and compared with conventional hybrid relay selection. Adaptive bit and power allocation is also discussed to improve the system performance. Distributed space frequency coding applied to hybrid relay selection to obtain full spatial and full data rate transmission is explored. Two strategies, single cluster and multiple clusters, are considered for the Alamouti code at the destination by using a hybrid relay protocol. The power allocation with and without sub-carrier pairing is also investigated to mitigate the effect of multipath error propagation in frequency-selective channels. The second part of this thesis investigates the application of cooperative OFDM systems to high data rate transmission. Recently, there has been growing attention paid to 3D video transmission over broadband wireless channels. Two strategies for relay selection hybrid relay selection and first best second best are proposed to implement unequal error protection in the physical layer over error prone channels. The closed-form expressions of bit error probability and outage probability for both strategies are examined. The peak signal-to-noise ratio is presented to show the quality of reconstruction of the left and right views

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

    Get PDF
    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

    Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

    Full text link
    Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM-tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency flat fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms are employed

    Dispensing with channel estimation: differentially modulated cooperative wireless communications

    No full text
    As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

    Differential Distributed Space-Time Coding with Imperfect Synchronization

    Full text link
    Differential distributed space-time coding (D-DSTC) has been considered to improve both diversity and data-rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are perfectly synchronized in the symbol level. In practice, this assumption is easily violated due to the distributed nature of the relay networks. This paper proposes a new differential encoding and decoding process for D-DSTC systems with two relays. The proposed method is robust against synchronization errors and does not require any channel information at the destination. Moreover, the maximum possible diversity and symbol-by-symbol decoding are attained. Simulation results are provided to show the performance of the proposed method for various synchronization errors and the fact that our algorithm is not sensitive to synchronization error.Comment: to appear in IEEE Globecom, 201

    Quasi-orthogonal space-frequency coding in non-coherent cooperative broadband networks

    Get PDF
    © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.So far, complex valued orthogonal codes have been used differentially in cooperative broadband networks. These codes however achieve less than unitary code rate when utilized in cooperative networks with more than two relays. Therefore, the main challenge is how to construct unitary rate codes for non-coherent cooperative broadband networks with more than two relays while exploiting the achievable spatial and frequency diversity. In this paper, we extend full rate quasi-orthogonal codes to differential cooperative broadband networks where channel information is unavailable. From this, we propose a generalized differential distributed quasi-orthogonal space-frequency coding (DQSFC) protocol for cooperative broadband networks. Our proposed scheme is able to achieve full rate, and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of our scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, we derive sufficient conditions for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity.Peer reviewe

    Distributed convolutional-coded differential space-time block coding for cooperative communications

    No full text
    A low complexity distributed coding scheme is proposed for communications over Rayleigh fading channels. Convolutional Coding (CC) assisted Differential Phase-Shift Keying (DPSK) modulation is employed at the source node for conveying the source signals to two relay nodes as well as to the destination node during the first transmission period. Iterative detection exchanging extrinsic information between the DPSK demapper and CC decoder is carried out at each relay node in order to recover the source signals. Then, the CC-encoded bits are re-encoded by the two relays to generate Differential Space-Time Block Coding (DSTBC) symbols for transmission to the destination node during the second transmission period. At the destination node, iterative decoding exchanging extrinsic information is invoked between the DPSK demapper and the concatenated CC-DSTBC decoder, where the later is viewed as a single amalgamated decoder. The relay and destination nodes do not have to estimate the channel’s fading coefficients due to the employment of DPSK and DSTBC schemes. Our design requires only two decoding iterations between the DPSK and CC decoders at each relay in order to further reduce the complexity of the relay nodes. Our distributed coding scheme assisted by two low-complexity relay nodes outperforms the non-cooperative benchmarker scheme by about 8 dBs, when aiming for a bit error ratio of 10-5
    corecore