Power allocation strategies and lattice based coding schemes for bi-directional relaying

Wilson, Mary Dabney; Narayanan, Krishna R.

doi:10.1109/isit.2009.5205659

Cited by 26 publications

(23 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Background and Preliminariesmentioning

confidence: 99%

“…A multi-level coding scheme for the two-way relaying scenario was proposed in [9]. Power allocation strategies and lattice based coding schemes for bi-directional relaying were proposed in [10].It was observed in [7] that for uncoded transmission, the network coding map used at the relay needs to be changed adaptively according to the channel fading coefficients, in order to minimize the impact of the multiple access interference. In this paper, it is shown that a finite number of network coding maps, obtained by completion of Partially Filled Latin Squares…”

mentioning

confidence: 99%

See 1 more Smart Citation

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-PSK Modulation

Muralidharan

Namboodiri

Rajan

2013

IEEE Trans. Inform. Theory

106

View full text Add to dashboard Cite

Abstract-The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with a protocol which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. It was observed by KoikeAkino et. al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called the exclusive law. We show that every network coding map that satisfies the exclusive law is representable by a Latin Square and conversely, that this relationship can be used to get the network coding maps satisfying the exclusive law. The channel fade states for which the minimum distance of the effective constellation at the relay become zero are referred to as the singular fade states. For M −PSK modulation (M any power of 2), it is shown that there are V. Namboodiri is currently with Qualcomm India Private Limited, Hyderabad-500081, India (e-mail: namboodiri.vishnu@gmail.com). The work was carried out when he was with the Dept. of Electrical Communication Engineering, Indian Institute of Science, Bangalore-560012, India.Communicated by J.-C. Belfiore, Associate Editor for Coding Theory. I. BACKGROUND AND PRELIMINARIESWe consider the two-way wireless relaying scenario shown in Fig. 1, where bidirectional data transfer takes place between the nodes A and B with the help of the relay R. It is assumed that all three nodes operate in half-duplex mode, i.e., they cannot transmit and receive simultaneously in the same frequency band. The relaying protocol consists of the following two phases: the multiple access (MA) phase, during which A and B simultaneously transmit to R and the broadcast (BC) phase during which R transmits to A and B. Network coding is employed at R in such a way that A (B) can decode the message of B (A), given that A (B) knows its own message. The concept of physical layer network coding has attracted a lot of attention in recent times. The idea of physical layer network coding for the two way relay channel was first introduced in [3], where the multiple access interference occurring at the relay was exploited so that the communication between the end nodes can be done using a two phase protocol. Information theoretic studies for the physical layer network coding scenario were reported in [4], [5]. A differential modulation scheme with analog network coding for bidirectional relaying was proposed in [6]. The design principles governing the choice of modulation schemes to be used at the nodes for uncoded transmission were studied in [7]. An extension for the case when the nodes use convolutional codes was done in [8]. A multi-level coding scheme for the two-way relaying scenario was proposed in [9]. Power allocation strategies and lattice based coding schemes for bi-directional relaying were proposed in [10].It was observed in [7] that for uncoded transmission, the network c...

show abstract

Section: Background and Preliminariesmentioning

confidence: 99%

mentioning

confidence: 99%

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-PSK Modulation

Muralidharan

Namboodiri

Rajan

2013

IEEE Trans. Inform. Theory

106

View full text Add to dashboard Cite

show abstract

“…Subsequently, Nam, Chung, and Lee extended their analysis to the case of unequal (but known) channel gains [14,15]. Further work along this line can be found in [16,17].…”

Section: Compute-and-forwardmentioning

confidence: 99%

An algebraic approach to physical-layer network coding

Feng

Silva

Kschischang

2010

2010 IEEE International Symposium on Information Theory

132

202

View full text Add to dashboard Cite

This dissertation studies a family of the state-of-the-art PNC schemes called compute-and-forward (C&F). C&F was originally proposed and studied from an information-theoretic perspective. As such, it typically relies on several strong assumptions: very long block length, almost unbounded complexity, perfect channel state information, and no decoding errors at the relays; its benefit is often analyzed for simple network configurations. The aim of this dissertation is two-fold: first, to relax the above assumptions while preserving the performance of C&F, and second, to understand the benefit of C&F in more realistic network scenarios, such as random-access wireless networks.There are four main results in this dissertation. First, an algebraic framework is developed, which establishes a direct connection between C&F and module theory. This connection allows us to systematically design lattice codes for C&F with controlled block length and complexity. In particular, explicit design criteria are derived, concrete design examples are provided, and it is shown that nominal coding gains from 3 to 7.5 dB can be obtained with relatively short block length and reasonable decoding complexity. Second, a new C&F scheme is proposed, which, unlike conventional C&F schemes, does not require any channel state information (CSI). It is shown that this CSI-free scheme achieves, for a certain class of lattice codes, almost the same throughput as its CSI-enabled counterpart. Third, an end-to-end error control mechanism is designed, which effectively mitigates decoding errors introduced at wireless relays. In particular, the end-to-end error control problem is modeled as a finite-ring matrix channel problem, for which tight capacity bounds and capacity-approaching schemes are provided. The final part of this dissertation studies the benefit of C&F in random-access wireless networks. In particular, it is shown that C&F significantly improves the network throughput and delay performance of slotted-ALOHA-based random-access protocols.ii Acknowledgements This thesis is the result of the support, help, and advice that I have received from an amazing group of scholars and students at the University of Toronto. Without them this dissertation wouldn't have been possible. First, I feel very fortunate to have two great supervisors: Prof. Frank R. Kschischang and Prof.Baochun Li. As an advisor, Frank has consistently exceeded my expectation. He is not only a brilliant researcher and excellent teacher, but also truly a kind and caring person. He has given me a tremendous amount in the past six years, I can only thank him for a subset. In particular, I have benefited greatly from his focus on fundamental problems, his taste for beautiful mathematics, his emphasis on clarity and grace, and his dedication in developing his students to their full potential. I am very grateful to Frank for making my PhD journey so exciting and rewarding! Frank also has a great sense of humor.I will always remember how much fun we had together during our endless discus...

show abstract

“…Compared with other relay strategies such as the digital network coding [4] and the physical network coding [5], the amplify-and-forward (AF) strategy has lower complexity, shorter processing delay, and lower implementation cost. Therefore, the AF strategy is considered in this letter.…”

Section: Introductionmentioning

confidence: 99%

Joint Transceiver Optimization for Two-Way MIMO Relay Systems With MSE Constraints

Lang

Rong

et al. 2014

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

Abstract-Transceiver design for two-way multiple-input multiple-output (MIMO) relay systems has attracted much research interest recently. However, there is little research on the impact of quality-of-service (QoS) constraints on two-way MIMO relay systems, which greatly affects the user experience. In this letter, we propose a transceiver design for two-way MIMO relay systems which minimizes the total network transmission power subjecting to QoS constraints expressed as upper-bounds on the mean-squared error (MSE) of the signal waveform estimation at both destinations. An iterative algorithm is developed to optimize the source, relay, and receive matrices. Simulation results demonstrate the fast convergence of the proposed algorithm.Index Terms-Two-way relay, MIMO relay, QoS, MMSE, linear non-regenerative relay.

show abstract

Power allocation strategies and lattice based coding schemes for bi-directional relaying

Cited by 26 publications

References 3 publications

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-PSK Modulation

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-PSK Modulation

An algebraic approach to physical-layer network coding

Joint Transceiver Optimization for Two-Way MIMO Relay Systems With MSE Constraints

Contact Info

Product

Resources

About