Search arXivSearch

arXiv · 1301.5061

Capacity Region Bounds and Resource Allocation for Two-Way OFDM Relay Channels

Abstract

In this paper, we consider two-way orthogonal frequency division multiplexing (OFDM) relay channels, where the direct link between the two terminal nodes is too weak to be used for data transmission. The widely known per-subcarrier decode-and-forward (DF) relay strategy, treats each subcarrier as a separate channel, and performs independent channel coding over each subcarrier. We show that this per-subcarrier DF relay strategy is only a suboptimal DF relay strategy, and present a multi-subcarrier DF relay strategy which utilizes cross-subcarrier channel coding to achieve a larger rate region. We then propose an optimal resource allocation algorithm to characterize the achievable rate region of the multi-subcarrier DF relay strategy. The computational complexity of this algorithm is much smaller than that of standard Lagrangian duality optimization algorithms. We further analyze the asymptotic performance of two-way relay strategies including the above two DF relay strategies and an amplify-and-forward (AF) relay strategy. The analysis shows that the multi-subcarrier DF relay strategy tends to achieve the capacity region of the two-way OFDM relay channels in the low signal-to-noise ratio (SNR) regime, while the AF relay strategy tends to achieve the multiplexing gain region of the two-way OFDM relay channels in the high SNR regime. Numerical results are provided to justify all the analytical results and the efficacy of the proposed optimal resource allocation algorithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fei He, Yin Sun, Limin Xiao, Xiang Chen, Chong-Yung Chi, Shidong Zhou. 2013-03-24. Capacity Region Bounds and Resource Allocation for Two-Way OFDM Relay Channels. https://doi.org/10.1109/twc.2013.13.121205.

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT