Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1302.6292

An Iterative Noncoherent Relay Receiver for the Two-way Relay Channel

Terry Ferrett·Matthew C. Valenti·Don Torrieri
View original source ↗Read source document ↗Export metadata ↓

Abstract

Physical-layer network coding improves the throughput of the two-way relay channel by allowing multiple source terminals to transmit simultaneously to the relay. However, it is generally not feasible to align the phases of the multiple received signals at the relay, which motivates the exploration of noncoherent solutions. In this paper, turbo-coded orthogonal multi-tone frequency-shift keying (FSK) is considered for the two-way relay channel. In contrast with analog network coding, the system considered is an instance of digital network coding; i.e., the relay decodes the network codeword and forwards a re-encoded version. Crucial to noncoherent digital network coding is the implementation of the relay receiver, which is the primary focus of the paper. The relay receiver derived in this paper supports any modulation order that is a power of two, and features the iterative feedback of a priori information from the turbo channel decoder to the demodulator; i.e., it uses bit interleaved coded modulation with iterative decoding (BICM-ID). The performance of the receiver is investigated in Rayeligh fading channels through error-rate simulations and a capacity analysis. Results show that the BICM-ID receiver improves energy efficiency by 0.5-0.9 dB compared to a non-iterative receiver implementation.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Terry Ferrett, Matthew C. Valenti, Don Torrieri. 2013-02-26. An Iterative Noncoherent Relay Receiver for the Two-way Relay Channel. https://arxiv.org/abs/1302.6292

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗