List Decoding for Bidirectional Broadcast Channels with Unknown Varying Channels
- 1 May 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 1-6
Abstract
The concept of bidirectional relaying shows the potential to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. It applies to three-node networks, where a relay node establishes a bidirectional communication between two other nodes. In the first phase of a decode-and-forward protocol, the two nodes transmit their messages to a relay node, which decodes them. In the succeeding bidirectional broadcast phase, the relay broadcasts a re-encoded composition of them so that both nodes can decode the other's message using their own message as side information. We assume that the transmission is affected by unknown varying channels. Unfortunately, the unknown variation of the channel can lead to channels which completely prohibit any reliable communication. In this work, we analyze the bidirectional broadcast phase under list decoding and show that this decoding technique can improve the performance significantly in the sense that it allows to transmit reliably in scenarios where usual decoding schemes fail.Keywords
This publication has 13 references indexed in Scilit:
- On the capacity of bidirectional relaying with unknown varying channels2009
- Coding Strategies for Bidirectional Relaying for Arbitrarily Varying Channels2009
- Coding theorems for the restricted half-duplex two-way relay channel with joint decoding2008
- Broadcast Capacity Region of Two-Phase Bidirectional RelayingIEEE Transactions on Information Theory, 2008
- Algorithmic Results in List DecodingFoundations and Trends® in Theoretical Computer Science, 2007
- The smallest list for the arbitrarily varying channelIEEE Transactions on Information Theory, 1997
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Channel capacities for list codesJournal of Applied Probability, 1973
- The strong converse theorem in the decoding scheme of list size $L$Kodai Mathematical Journal, 1969
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960