Capacity Bounds for Two-Way Relay Channels
Top Cited Papers
- 1 March 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21603839,p. 144-147
- https://doi.org/10.1109/izs.2008.4497296
Abstract
We provide achievable rate regions for two-way relay channels (TRC). At first, for a binary TRC, we show that the subspace-sharing of linear codes can achieve the capacity region. And, for a Gaussian TRC, we propose the subset-sharing of lattice codes. In some cases, the proposed lattice coding scheme can achieve within 1/2-bit the capacity and is asymptotically optimal at high signal-to-noise ratio (SNR) regimes.Keywords
This publication has 10 references indexed in Scilit:
- Embracing wireless interferencePublished by Association for Computing Machinery (ACM) ,2007
- Broadcasting when Receivers Know Some Messages A PrioriPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Two-Way Radio Networks with a Star TopologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Achievable Rate Regions for the Two-way Relay ChannelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Spectral Efficient Signaling for Half-duplex Relay ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Capacity and Lattice Strategies for Canceling Known InterferenceIEEE Transactions on Information Theory, 2005
- Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and DecodingIEEE Transactions on Information Theory, 2004
- Random codes: minimum distances and error exponentsIEEE Transactions on Information Theory, 2002
- Elements of Information TheoryPublished by Wiley ,2001
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997