High-Throughput Cooperative Communication with Interference Cancellation for Two-Path Relay in Multi-Source System
TL;DR: In this paper, the authors proposed a cooperative transmission scheme which combines network coding and the two-path relay scheme together in the multi-source system, which achieves full-rate transmission by adopting complex field network coding at both the sources and the relays.
Abstract: Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and the two-path relay scheme is exploited to deal with the increase in network size and the half-duplex nature of relay, respectively. To further improve bandwidth efficiency, we propose a novel cooperative transmission scheme which combines network coding and the two-path relay scheme together in the multi-source system. Due to the utilization of two-path relay, our proposed scheme achieves full-rate transmission. Adopting complex field network coding (CFNC) at both the sources and the relays ensures that symbols from different sources are allowed to be broadcasted in the same time slot. We also adopt physical-layer network coding (PNC) at the relay nodes to deal with the inter-relay interference caused by the two-path relay. With careful process design, our scheme can achieve the ideal throughput up to 1 symbol per source per time slot (sym/S/TS). Furthermore, the theoretical analysis provides a method to estimate the symbol error probability (SEP) and throughput in complex additive white Gaussian noise (AWGN) and Rayleigh fading channels. The simulation results verify the improvements achieved by the proposed scheme.
Citations
More filters
Posted Content•
TL;DR: It is shown by simulations and analysis that the channel estimation does not affect the diversity order of the OSTBC-based two-way AF MIMO relay system.
Abstract: In this paper, we consider the relaying of orthogonal space time block codes (OSTBCs) in a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with estimated channel state information (CSI). A simple four phase protocol is used for training and OSTBC data transmission. Decoding of OSTBC data at a user terminal is performed by replacing the exact CSI by the estimated CSI, in a maximum likelihood decoder. Tight approximations for the moment generating function (m.g.f.) of the received signal-to-noise ratio at a user is derived under Rayleigh fading by ignoring the higher order noise terms. Analytical average error performance of the considered cooperative scheme is derived by using the m.g.f. expression. Moreover, the analytical diversity order of the considered scheme is also obtained for certain system configurations. It is shown by simulations and analysis that the channel estimation does not affect the diversity order of the OSTBC based two-way AF MIMO relay system.
29 citations
TL;DR: A new CSS scheme to provide D2D access with an ideal throughput of 1 symbol per time slot (sym/TS) and the DU average throughput approaches 1 sym/TS at high signal-to-interference-plus-noise ratio, demonstrating that DUs gain full access opportunity to the cellular spectrum.
Abstract: While device-to-device (D2D) communication between two proximate cellular terminals improves spectral efficiency, cooperative spectrum sharing (CSS) among D2D users (DUs) and cellular users (CUs) provides more gains. In this paper, we thus propose a new CSS scheme, where a pair of DUs (D $_1$ and D $_2$ ) acts as half-duplex two-path successive relays (TPSRs) between two CUs (C $_1$ and C $_2$ ) while maintaining cellular full-duplex gains. The channel between D $_1$ and D $_2$ , referred to as TPSR interrelay interference channel, is exploited to provide D2D access with an ideal throughput of 1 symbol per time slot (sym/TS). To eliminate the interference between C $_1$ –C $_2$ and D $_1$ –D $_2$ links, we propose a hybrid complex field network coding (HCFNC) scheme for two cases: First, both of D $_1$ and D $_2$ correctly decode cellular data; and second, either D $_1$ or D $_2$ correctly decodes cellular data. For each case, we derive the closed-form CU diversity-multiplexing tradeoff (DMT) and data rate, symbol error probability for the HCFNC strategy, and the D2D throughput. Our performance analysis and simulation results show that: first, the proposed scheme achieves the 3 $\times$ 1 multiple-input single-output DMT; second, the CU achievable rate approaches the full-duplex upper bound; and third, the DU average throughput approaches 1 sym/TS at high signal-to-interference-plus-noise ratio, demonstrating that DUs gain full access opportunity to the cellular spectrum.
12 citations
TL;DR: A generalized interrelay interference cancelation (gIRIC) scheme for a two-path relay model in multisource systems and the bounds of average symbol error probability (SEP) and throughput of the scheme are derived.
Abstract: This paper proposes a generalized interrelay interference cancelation (gIRIC) scheme for a two-path relay model in multisource systems. Both the sources and the relay adopt complex field network coding (CFNC) to remove the interrelay interference (IRI) caused by the two-path relay. Furthermore, we introduce two detecting modes (gIRIC-noSD and gIRIC-SD) for destination in our scheme. Two switching rules are given to select a suitable detecting mode between treating the signal of a direct link as noise (gIRIC-noSD) and utilizing the direct link to assist signal detection (gIRIC-SD). The bounds of average symbol error probability (SEP) and throughput of our scheme are derived.
12 citations
TL;DR: The queueing model and take outage probabilities into consideration to characterize the packet-level cooperation and derive the closed-form stable throughput region and proposes a power-allocation scheme between the source node and relays to maximize the achievable packet rate.
Abstract: Two-path relay networks can be deployed to achieve full-rate transmissions. In this paper, we introduce stable throughput analysis into decode-and-forward (DF) two-path relay networks. We establish the queueing model and take outage probabilities into consideration to characterize the packet-level cooperation and derive the closed-form stable throughput region. Based on the stable throughput region, we also propose a power-allocation scheme between the source node and relays to maximize the achievable packet rate. The maximal achievable packet rate determines the admission control of certain cooperation (i.e., when to cooperate) under a specific interrelay interference (IRI) cancellation technique. The power allocation is utilized to illustrate how to cooperate between the source node and relays. Three IRI responses are considered, and the system behaviors under various circumstances are presented through simulations.
5 citations
TL;DR: Simulations verify that in scenarios without full knowledge of CSI, DL3PSR protocol outperforms conventional two-path successive relaying in bit error performance and that the rate of DL3 PSR is close to that of the full-duplex relaying.
Abstract: Successive relaying has recently emerged as a spectral-efficient technique for cooperative wireless communications. However, in scenarios with uncertain accuracy of instantaneous channel state information (CSI), the scope of conventional two-path successive relaying protocol shrinks. This is due to the challenges of cancelling inter-relay interference (IRI) and detecting signals efficiently without specific CSI. The two challenges motivate us to propose a novel double listening 3-path successive relaying (DL3PSR) protocol to mitigate the successive relaying's dependence on accurate instantaneous CSI. We overcome the first challenge by proposing a blind IRI cancellation technique, and its effectiveness is proven. After blind IRI cancellation, the challenge of efficient signal detection is overcome by robust cooperative non-coherent detection, which consists of exclusive OR (XOR) demodulation and joint decoding. Based on constellation mapping, XOR demodulation is designed to demodulate M-ary phase-shift keying symbols without instantaneous CSI. Moreover, joint forward and backward decoding strategy is proposed to improve the robustness of data detection by retrieving two independent versions of the original data. Furthermore, the detection threshold, bit error probability, and achievable rate of DL3PSR are theoretically obtained. Simulations verify that in scenarios without full knowledge of CSI, DL3PSR protocol outperforms conventional two-path successive relaying in bit error performance and that the rate of DL3PSR is close to that of the full-duplex relaying. Copyright © 2016 John Wiley & Sons, Ltd.
3 citations
References
More filters
01 Nov 1985
TL;DR: This month's guest columnist, Steve Bible, N7HPR, is completing a master’s degree in computer science at the Naval Postgraduate School in Monterey, California, and his research area closely follows his interest in amateur radio.
Abstract: Spread Spectrum It’s not just for breakfast anymore! Don't blame me, the title is the work of this month's guest columnist, Steve Bible, N7HPR (n7hpr@tapr.org). While cruising the net recently, I noticed a sudden bump in the number of times Spread Spectrum (SS) techniques were mentioned in the amateur digital areas. While QEX has discussed SS in the past, we haven't touched on it in this forum. Steve was a frequent cogent contributor, so I asked him to give us some background. Steve enlisted in the Navy in 1977 and became a Data Systems Technician, a repairman of shipboard computer systems. In 1985 he was accepted into the Navy’s Enlisted Commissioning Program and attended the University of Utah where he studied computer science. Upon graduation in 1988 he was commissioned an Ensign and entered Nuclear Power School. His subsequent assignment was onboard the USS Georgia, a trident submarine stationed in Bangor, Washington. Today Steve is a Lieutenant and he is completing a master’s degree in computer science at the Naval Postgraduate School in Monterey, California. His areas of interest are digital communications, amateur satellites, VHF/UHF contesting, and QRP. His research area closely follows his interest in amateur radio. His thesis topic is Multihop Packet Radio Routing Protocol Using Dynamic Power Control. Steve is also the AMSAT Area Coordinator for the Monterey Bay area. Here's Steve, I'll have some additional comments at the end.
8,781 citations
29 Sep 2006
TL;DR: This paper proposes a physical-layer network coding (PNC) scheme to coordinate transmissions among nodes that makes use of the additive nature of simultaneously arriving electromagnetic (EM) waves for equivalent coding operation and demonstrates its potential for boosting network capacity.
Abstract: A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11). The goal of this paper is to show how the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC) scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM) waves for equivalent coding operation. PNC can yield higher capacity than straight-forward network coding when applied to wireless networks. We believe this is a first paper that ventures into EM-wave-based network coding at the physical layer and demonstrates its potential for boosting network capacity. PNC opens up a whole new research area because of its implications and new design requirements for the physical, MAC, and network layers of ad hoc wireless stations. The resolution of the many outstanding but interesting issues in PNC may lead to a revolutionary new paradigm for wireless ad hoc networking.
1,576 citations
03 Apr 2006
TL;DR: The results show that network-coded DAS leads to better diversity performance as compared to conventional DAS, at a lower hardware cost and higher spectral efficiency.
Abstract: This paper investigates the diversity gain offered by implementing network coding (R. Ahlswede et al., 2000) over wireless communication links. The network coding algorithm is applied to both a wireless network containing a distributed antenna system (DAS) as well as one that supports user cooperation between users. The results show that network-coded DAS leads to better diversity performance as compared to conventional DAS, at a lower hardware cost and higher spectral efficiency. In the case of user cooperation, network coding yields additional diversity, especially when there are multiple users
406 citations
TL;DR: Compared with existing ST block codes adhering to an orthogonal design (ST-OD), ST-LCP offers not only better performance, but also higher mutual information for N/sub t/>2 and the near-optimum sphere-decoding algorithm, as well as reduced-complexity suboptimum alternatives.
Abstract: We present a unified approach to designing space-time (ST) block codes using linear constellation precoding (LCP). Our designs are based either on parameterizations of unitary matrices, or on algebraic number-theoretic constructions. With an arbitrary number of N/sub t/ transmit- and N/sub r/ receive-antennas, ST-LCP achieves rate 1 symbol/s/Hz and enjoys diversity gain as high as N/sub t/N/sub r/ over (possibly correlated) quasi-static and fast fading channels. As figures of merit, we use diversity and coding gains, as well as mutual information of the underlying multiple-input-multiple-output system. We show that over quadrature-amplitude modulation and pulse-amplitude modulation, our LCP achieves the upper bound on the coding gain of all linear precoders for certain values of N/sub t/ and comes close to this upper bound for other values of N/sub t/, in both correlated and independent fading channels. Compared with existing ST block codes adhering to an orthogonal design (ST-OD), ST-LCP offers not only better performance, but also higher mutual information for N/sub t/>2. For decoding ST-LCP, we adopt the near-optimum sphere-decoding algorithm, as well as reduced-complexity suboptimum alternatives. Although ST-OD codes afford simpler decoding, the tradeoff between performance and rate versus complexity favors the ST-LCP codes when N/sub t/, N/sub r/, or the spectral efficiency of the system increase. Simulations corroborate our theoretical findings.
388 citations
Book•
01 Jan 1992
TL;DR: This book discusses components of a Digital Communication System, Signals, Systems, Modulation, and Noise, and Design Examples and System Tradeoffs, and some Commonly Used Modulation Schemes.
Abstract: (NOTE: Most chapters begin with an Introduction and conclude with Summary, References, and Problems.) 1. Introduction to Digital Data Transmission. Components of a Digital Communication System. Communications Channel Modeling. Communication Link Power Calculations. Driving Forces in Communications. Computer Use in Communication System Analysis and Design. Preview of the Book. 2. Signals, Systems, Modulation, and Noise: Overview. Review of Signal and Linear System Theory. Basic Analog Modulation Techniques. Complex Envelope Representation of Bandpass Signals and Systems. Signal Distortion and Filtering. Practical Filter Types and Characteristics. Sampling Theory. Random Processes. Computer Generation of Random Variables. 3. Basic Digital Communication Systems. The Binary Digital Communications Problem. Signaling through Bandlimited Channels. Equalization in Digital Data Transmission. A Digital Communication System Simulation Example. Noise Effects in Pulse Code Modulation. 4. Signal-Space Methods in Digital Data Transmission. Optimum Receiver Principals in Terms of Vector Spaces. Performance Analysis of Coherent Digital Signaling Schemes. Signaling Schemes Not Requiring Coherent References at the Receiver. Comparison of Digital Modulation Systems. Comparison of M-ary Digital Modulation Schemes on Power and Bandwidth-Equivalent Bases. Some Commonly Used Modulation Schemes. Design Examples and System Tradeoffs. Multi-h Continuous Phase Modulation. Orthogonal Frequency Division Multiplexing. 5. Channel Degradations in Digital Communications. Synchronization in Communication Systems. The Effects of Slow Signal Fading in Communicative Systems. Diagnostic Tools for Communication System Design. 6. Fundamentals of Information Theory and Block Coding. Basic Concepts of Information Theory. Fundamentals of Block Coding. Coding Performance in Slow Fading Channels. 7. Fundamentals of Convolutional Coding. Basic Concepts. The Viterbi Algorithm. Good Convolutional Codes and Their Performance. Other Topics. 8. Fundamentals of Repeat Request Systems. General Considerations. Three ARQ Strategies. Codes for Error Detection. 9. Spread-Spectrum Systems. Two Communication Problems. Types of Spread-Spectrum Systems. Complex-Envelope Representation of Spread Spectrum. Generation and Properties of Pseudorandom Sequences. Synchronization of Spread-Spectrum Systems. Performance of Spread-Spectrum Systems in Jamming Environments. Performance in Multiple User Environments. Multiuser Detection. Examples of Spread-Spectrum Systems. 10. Introduction to Cellular Radio Communications. Frequency Reuse. Channel Models. Mitigation Techniques for the Multipath Fading Channel. System Design and Performance Prediction. Advanced Mobile Phone Service. Global System for Mobile Communications. Code Division Multiple Access. Recommended Further Reading. 11. Satellite Communications. Allocation of a Satellite Transmission Resource. Link Power Budget Analysis. Examples of Link Power Budget Calculations. Low- and Medium-Earth Orbit Voice Messaging Satellite Systems. Appendix A. Probability and Random Variables, Probability Theory. Random Variables, Probability Density Functions, and Averages. Characteristic Function and Probability Generating Function. Transformations of Random Variables. Central Limit Theorem. Appendix B. Characterization of Internally Generated Noise. Appendix C. Attenuation of Radio-Wave Propagation by Atmospheric Gases and Rain. Appendix D. Generation of Coherent References. Description of Phase Noise and Its Properties. Phase-Lock Loop Models and Characteristics of Operation. Frequency Synthesis. Appendix E. Gaussian Probability Function. Appendix F. Mathematical Tables. The Sinc Function. Trigonometric Identities. Indefinite Integrals. Definite Integrals. Series Expansions. Fourier Transform Theorems. Fourier Transform Pairs. Index.
244 citations