Optimized constellations for two-way wireless relaying with physical network coding
01 Jun 2009-IEEE Journal on Selected Areas in Communications (Institute of Electrical and Electronics Engineers)-Vol. 27, Iss: 5, pp 773-787
TL;DR: The proposed modulation scheme can significantly improve end-to-end throughput for two-way relaying systems and is applicable to a relaying system using higher-level modulations of 16QAM in the MA stage.
Abstract: We investigate modulation schemes optimized for two-way wireless relaying systems, for which network coding is employed at the physical layer. We consider network coding based on denoise-and-forward (DNF) protocol, which consists of two stages: multiple access (MA) stage, where two terminals transmit simultaneously towards a relay, and broadcast (BC) stage, where the relay transmits towards the both terminals. We introduce a design principle of modulation and network coding, considering the superposed constellations during the MA stage. For the case of QPSK modulations at the MA stage, we show that QPSK constellations with an exclusive-or (XOR) network coding do not always offer the best transmission for the BC stage, and that there are several channel conditions in which unconventional 5-ary constellations lead to a better throughput performance. Through the use of sphere packing, we optimize the constellation for such an irregular network coding. We further discuss the design issue of the modulation in the case when the relay exploits diversity receptions such as multiple-antenna diversity and path diversity in frequency-selective fading. In addition, we apply our design strategy to a relaying system using higher-level modulations of 16QAM in the MA stage. Performance evaluations confirm that the proposed scheme can significantly improve end-to-end throughput for two-way relaying systems.
Citations
More filters
Dissertation•
25 Mar 2014
TL;DR: This thesis introduces two efficient fading correction strategies, i.e., the rotationally-invariant coded modulation and the soft-bit correction, and proposes a novel multilevel coded linear PNC scheme with extended mapping for the Rayleigh fading 2-WRC.
Abstract: As a newly-emerged paradigm in the networking techniques, physical-layer network coding (PNC) [1, 5] takes advantage of the superimposition of the electromagnetic waves, and embraces the interference which was typically deemed as harmful, by performing exclusive-or mapping. Therefore, the spectral efficiency is utilized, which in turn boosts the network throughput. In the classical 2-way relay channel (2-WRC), PNC only spends two channel uses for the bi-directional data exchange. However, one challenge for such a paradigm is that the singular fading states in the uplink of 2-WRC, might result in ambiguity for decoding the network coded symbol. One major focus of this thesis is to address the fading issue for PNC in the 2-WRC. Another fundamental challenge for PNC is to extend the PNC from the 2-WRC to a multi-user network such as the multi-way relay channel (M-WRC) or the hierarchical wireless network (HWN). To tackle these two fundamental challenges of PNC, several solutions are proposed in this thesis, which are summarized as follows: First, we introduce two efficient fading correction strategies, i.e., the rotationally-invariant coded modulation and the soft-bit correction. Second, a novel multilevel coded linear PNC scheme with extended mapping for the Rayleigh fading 2-WRC is proposed. Third, we design a new type of linear PNC for the Rayleigh fading 2-WRC, based on rings. We refer to such design as linear PNC over the hybrid finite ring. Fourth, we redesign PNC for the HWN, which facilitates the multi-user data exchange. To combat the co-channel interference introduced by multi-user data exchange, two efficient interference exploitation strategies based on network coding are proposed: 1) PNC with joint decoding; and 2) analogue network coding with interference-aware maximum likelihood detection. Finally, we propose a multilevel coded LPNC for the data exchange in the M-WRC.
1 citations
TL;DR: In this paper, a physical-layer network coding (PNC) method is offered for a two-way relay network with spatial modulation (SM) for source node and relay node and results show that the bit error rate in the relay node of the proposed method is significantly improved compared to the conventional method PNC.
Abstract: In this paper, a physical-layer network coding (PNC) method is offered for a two-way relay network with spatial modulation (SM) for source node and relay node. For this purpose, we consider a two-way relay network consists of a single relay node and two source nodes both equipped with multiple antennas. It includes two source nods for transferring the data through SM and also, the relay node for decrypting coded packet network (through the XOR) of two packets received from the source node. In the proposed method, the signal detection approach with maximum-likelihood for the PNC with SM modulation is used for relay nodes. The simulation results show that the bit error rate (BER) in the relay node of the proposed method is significantly improved compared to the conventional method PNC; while the data rate is based on the same BER. It is worth mentioning that the performance of the proposed method, when the number of antenna nodes rises, is significant. And it leads to increase in the data rate which indicates that the proposed method will be much convenient for the next generation of wireless communication systems, especially the fifth generation. It should also be said that the suggested SM-based PNC method, does not need channel state information at transmitter. So it can be easily implemented in practice.
1 citations
01 May 2017
TL;DR: A half-blind equalization based on pre-distortion is proposed, and the upper bound of proposed equalization is proved by formulating a phase gain-loss factor model.
Abstract: Phase offset is inevitable in asynchronous physical-layer network coding (PNC) systems, which restricts the accuracy of PNC decoding. To address this issue, this paper proposes a half-blind equalization based on pre-distortion. In the scheme, the intentional phase distortion is pre-brought into the symbols of one user, and then, it is utilized by the relay to equalize the received signals and modify the updating equations in the decoding process. By formulating a phase gain-loss factor model, the upper bound of proposed equalization is proved. On the basis of that, a threshold is proposed to avoid unnecessary distortion. Simulation results verify the effectiveness of the theoretical analysis, and show that the bit error rate performance can be improved by the proposed algorithm.
1 citations
Cites background from "Optimized constellations for two-wa..."
...In [10], a constellation rotation was developed to mitigate carrier phase offsets, where the PNC mapping varied depending on the phase offset....
[...]
Posted Content•
TL;DR: In this article, a two-stage search algorithm is proposed to identify the optimum PNC mappings for given channel state information and modulation, which achieves low bit error rate with reduced backhaul load.
Abstract: Fifth generation (5G) wireless networks will need to serve much higher user densities than existing 4G networks, and will therefore require an enhanced radio access network (RAN) infrastructure. Physical layer network coding (PNC) has been shown to enable such high densities with much lower backhaul load than approaches such as Cloud-RAN and coordinated multipoint (CoMP). In this letter, we present an engineering applicable PNC scheme which allows different cooperating users to use different modulation schemes, according to the relative strength of their channels to a given access point. This is in contrast with compute-and-forward and previous PNC schemes which are designed for two-way relay channel. A two-stage search algorithm to identify the optimum PNC mappings for given channel state information and modulation is proposed in this letter. Numerical results show that the proposed scheme achieves low bit error rate with reduced backhaul load.
1 citations
TL;DR: The numerical results demonstrate that the average SEP of TWOR-AF systems can be improved greatly when the proposed jointing adaptive modulation relay selection protocols are performed, and in certain channel realizations, the adaptive modulation non-selection protocol outperforms the conventional NonAM-MM protocol in which theAdaptive modulation is not integrated.
Abstract: Two novel best-relay selection protocols, the jointing adaptive modulation max---min (AM-MM) protocol and the jointing adaptive modulation maximum harmonic mean (AM-MHM) protocol, are proposed for two-way opportunistic relaying systems with amplify-and-forward policy (TWOR-AF). By integrating the adaptive modulation with the conventional max---min (NonAM-MM) and maximum harmonic mean protocols, the effect of the modulation schemes used at both sources is exploited perfectly in the proposed AM-MM and AM-MHM protocols. The analytical expressions to the approximate upper bounds of overall average symbol error probability (SEP) for TWOR-AF systems with these different relay selection protocols are obtained through theoretic analysis. The numerical results demonstrate that the average SEP of TWOR-AF systems can be improved greatly when the proposed jointing adaptive modulation relay selection protocols are performed. Furthermore, in certain channel realizations, the adaptive modulation non-selection protocol outperforms the conventional NonAM-MM protocol in which the adaptive modulation is not integrated.
1 citations
Cites background or methods or result from "Optimized constellations for two-wa..."
...Although the adaptive modulation has been investigated in [14,15], they are different from our work....
[...]
...Otherwise, [14,15] investigate the system throughput for TW-DNF systems, our work analyzes SEP performance for TWORAF systems....
[...]
...In addition, as stated in [14,15], in the two-way adaptive modulation relaying systems with DNF policy, two sources can adopt the different modulation schemes if their obtained local channel state information (CSI) is different, which results in the improvement of system performance....
[...]
...[14,15] mainly focus on the optimized integration of modulation schemes and network coding strategies to improve system throughput, while our work mainly discusses the novel proposed relay selection protocols which integrate adaptive modulation with the conventional relay selection protocols to minimize SEP....
[...]
...We write x1 = M1(s1) and x2 = M2(s2), here s1 ∈ Z Q1, s2 ∈ Z Q2 are the source data before modulation [14,15]....
[...]
References
More filters
Book•
01 Jan 1991TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Abstract: Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entropy, and Mutual Information. 2.1 Entropy. 2.2 Joint Entropy and Conditional Entropy. 2.3 Relative Entropy and Mutual Information. 2.4 Relationship Between Entropy and Mutual Information. 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information. 2.6 Jensen's Inequality and Its Consequences. 2.7 Log Sum Inequality and Its Applications. 2.8 Data-Processing Inequality. 2.9 Sufficient Statistics. 2.10 Fano's Inequality. Summary. Problems. Historical Notes. 3. Asymptotic Equipartition Property. 3.1 Asymptotic Equipartition Property Theorem. 3.2 Consequences of the AEP: Data Compression. 3.3 High-Probability Sets and the Typical Set. Summary. Problems. Historical Notes. 4. Entropy Rates of a Stochastic Process. 4.1 Markov Chains. 4.2 Entropy Rate. 4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph. 4.4 Second Law of Thermodynamics. 4.5 Functions of Markov Chains. Summary. Problems. Historical Notes. 5. Data Compression. 5.1 Examples of Codes. 5.2 Kraft Inequality. 5.3 Optimal Codes. 5.4 Bounds on the Optimal Code Length. 5.5 Kraft Inequality for Uniquely Decodable Codes. 5.6 Huffman Codes. 5.7 Some Comments on Huffman Codes. 5.8 Optimality of Huffman Codes. 5.9 Shannon-Fano-Elias Coding. 5.10 Competitive Optimality of the Shannon Code. 5.11 Generation of Discrete Distributions from Fair Coins. Summary. Problems. Historical Notes. 6. Gambling and Data Compression. 6.1 The Horse Race. 6.2 Gambling and Side Information. 6.3 Dependent Horse Races and Entropy Rate. 6.4 The Entropy of English. 6.5 Data Compression and Gambling. 6.6 Gambling Estimate of the Entropy of English. Summary. Problems. Historical Notes. 7. Channel Capacity. 7.1 Examples of Channel Capacity. 7.2 Symmetric Channels. 7.3 Properties of Channel Capacity. 7.4 Preview of the Channel Coding Theorem. 7.5 Definitions. 7.6 Jointly Typical Sequences. 7.7 Channel Coding Theorem. 7.8 Zero-Error Codes. 7.9 Fano's Inequality and the Converse to the Coding Theorem. 7.10 Equality in the Converse to the Channel Coding Theorem. 7.11 Hamming Codes. 7.12 Feedback Capacity. 7.13 Source-Channel Separation Theorem. Summary. Problems. Historical Notes. 8. Differential Entropy. 8.1 Definitions. 8.2 AEP for Continuous Random Variables. 8.3 Relation of Differential Entropy to Discrete Entropy. 8.4 Joint and Conditional Differential Entropy. 8.5 Relative Entropy and Mutual Information. 8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information. Summary. Problems. Historical Notes. 9. Gaussian Channel. 9.1 Gaussian Channel: Definitions. 9.2 Converse to the Coding Theorem for Gaussian Channels. 9.3 Bandlimited Channels. 9.4 Parallel Gaussian Channels. 9.5 Channels with Colored Gaussian Noise. 9.6 Gaussian Channels with Feedback. Summary. Problems. Historical Notes. 10. Rate Distortion Theory. 10.1 Quantization. 10.2 Definitions. 10.3 Calculation of the Rate Distortion Function. 10.4 Converse to the Rate Distortion Theorem. 10.5 Achievability of the Rate Distortion Function. 10.6 Strongly Typical Sequences and Rate Distortion. 10.7 Characterization of the Rate Distortion Function. 10.8 Computation of Channel Capacity and the Rate Distortion Function. Summary. Problems. Historical Notes. 11. Information Theory and Statistics. 11.1 Method of Types. 11.2 Law of Large Numbers. 11.3 Universal Source Coding. 11.4 Large Deviation Theory. 11.5 Examples of Sanov's Theorem. 11.6 Conditional Limit Theorem. 11.7 Hypothesis Testing. 11.8 Chernoff-Stein Lemma. 11.9 Chernoff Information. 11.10 Fisher Information and the Cram-er-Rao Inequality. Summary. Problems. Historical Notes. 12. Maximum Entropy. 12.1 Maximum Entropy Distributions. 12.2 Examples. 12.3 Anomalous Maximum Entropy Problem. 12.4 Spectrum Estimation. 12.5 Entropy Rates of a Gaussian Process. 12.6 Burg's Maximum Entropy Theorem. Summary. Problems. Historical Notes. 13. Universal Source Coding. 13.1 Universal Codes and Channel Capacity. 13.2 Universal Coding for Binary Sequences. 13.3 Arithmetic Coding. 13.4 Lempel-Ziv Coding. 13.5 Optimality of Lempel-Ziv Algorithms. Compression. Summary. Problems. Historical Notes. 14. Kolmogorov Complexity. 14.1 Models of Computation. 14.2 Kolmogorov Complexity: Definitions and Examples. 14.3 Kolmogorov Complexity and Entropy. 14.4 Kolmogorov Complexity of Integers. 14.5 Algorithmically Random and Incompressible Sequences. 14.6 Universal Probability. 14.7 Kolmogorov complexity. 14.9 Universal Gambling. 14.10 Occam's Razor. 14.11 Kolmogorov Complexity and Universal Probability. 14.12 Kolmogorov Sufficient Statistic. 14.13 Minimum Description Length Principle. Summary. Problems. Historical Notes. 15. Network Information Theory. 15.1 Gaussian Multiple-User Channels. 15.2 Jointly Typical Sequences. 15.3 Multiple-Access Channel. 15.4 Encoding of Correlated Sources. 15.5 Duality Between Slepian-Wolf Encoding and Multiple-Access Channels. 15.6 Broadcast Channel. 15.7 Relay Channel. 15.8 Source Coding with Side Information. 15.9 Rate Distortion with Side Information. 15.10 General Multiterminal Networks. Summary. Problems. Historical Notes. 16. Information Theory and Portfolio Theory. 16.1 The Stock Market: Some Definitions. 16.2 Kuhn-Tucker Characterization of the Log-Optimal Portfolio. 16.3 Asymptotic Optimality of the Log-Optimal Portfolio. 16.4 Side Information and the Growth Rate. 16.5 Investment in Stationary Markets. 16.6 Competitive Optimality of the Log-Optimal Portfolio. 16.7 Universal Portfolios. 16.8 Shannon-McMillan-Breiman Theorem (General AEP). Summary. Problems. Historical Notes. 17. Inequalities in Information Theory. 17.1 Basic Inequalities of Information Theory. 17.2 Differential Entropy. 17.3 Bounds on Entropy and Relative Entropy. 17.4 Inequalities for Types. 17.5 Combinatorial Bounds on Entropy. 17.6 Entropy Rates of Subsets. 17.7 Entropy and Fisher Information. 17.8 Entropy Power Inequality and Brunn-Minkowski Inequality. 17.9 Inequalities for Determinants. 17.10 Inequalities for Ratios of Determinants. Summary. Problems. Historical Notes. Bibliography. List of Symbols. Index.
45,034 citations
"Optimized constellations for two-wa..." refers background in this paper
...Since Shannon firstly considered a two–way channel in [10], some theoretical investigations on the bidirectional relaying have emerged so far [ 11 ]....
[...]
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Abstract: We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.
8,533 citations
"Optimized constellations for two-wa..." refers background in this paper
...W IRELESS network coding has recently received a lot of attention in research community, although the concept of network coding has been around for almost a decade [2]....
[...]
Book•
01 Dec 1987
TL;DR: The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space?
Abstract: The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to examine related problems such as the kissing number problem, the covering problem, the quantizing problem, and the classification of lattices and quadratic forms. Like the first edition, the second edition describes the applications of these questions to other areas of mathematics and science such as number theory, coding theory, group theory, analog-to-digital conversion and data compression, n-dimensional crystallography, and dual theory and superstring theory in physics.
4,564 citations
TL;DR: The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput, and the gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
Abstract: This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
2,190 citations
TL;DR: Two new half-duplex relaying protocols are proposed that avoid the pre-log factor one-half in corresponding capacity expressions and it is shown that both protocols recover a significant portion of the half- duplex loss.
Abstract: We study two-hop communication protocols where one or several relay terminals assist in the communication between two or more terminals. All terminals operate in half-duplex mode, hence the transmission of one information symbol from the source terminal to the destination terminal occupies two channel uses. This leads to a loss in spectral efficiency due to the pre-log factor one-half in corresponding capacity expressions. We propose two new half-duplex relaying protocols that avoid the pre-log factor one-half. Firstly, we consider a relaying protocol where a bidirectional connection between two terminals is established via one amplify-and-forward (AF) or decode-and-forward (DF) relay (two-way relaying). We also extend this protocol to a multi-user scenario, where multiple terminals communicate with multiple partner terminals via several orthogonalize-and-forward (OF) relay terminals, i.e., the relays orthogonalize the different two-way transmissions by a distributed zero-forcing algorithm. Secondly, we propose a relaying protocol where two relays, either AF or DF, alternately forward messages from a source terminal to a destination terminal (two-path relaying). It is shown that both protocols recover a significant portion of the half-duplex loss
1,728 citations
"Optimized constellations for two-wa..." refers background in this paper
...In [6, 18 ], the amplify–and–forward (AF) bidirectional relaying is introduced, where the terminal nodes simultaneously transmit to the relaying node, and subsequently the relay broadcasts the received signal after amplification....
[...]