Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1210.3953

Wireless Network-Coded Four-Way Relaying Using Latin Hyper-Cubes

Srishti Shukla·B. Sundar Rajan
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper deals with physical layer network-coding for the four-way wireless relaying scenario where four nodes A, B, C and D wish to communicate their messages to all the other nodes with the help of the relay node R. The scheme given in the paper is based on the denoise-and-forward scheme proposed first by Popovski et al. Intending to minimize the number of channel uses, the protocol employs two phases: Multiple Access (MA) phase and Broadcast (BC) phase with each phase utilizing one channel use. This paper does the equivalent for the four-way relaying scenario as was done for the two-way relaying scenario by Koike-Akino et al., and for three-way relaying scenario in [3]. It is observed 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. These network coding maps are so chosen so that they satisfy a requirement called exclusive law. We show that when the four users transmit points from the same M-PSK constellation, every such network coding map that satisfies the exclusive law can be represented by a 4-fold Latin Hyper-Cube of side M. The network code map used by the relay for the BC phase is explicitly obtained and is aimed at reducing the effect of interference at the MA stage.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Srishti Shukla, B. Sundar Rajan. 2012-10-15. Wireless Network-Coded Four-Way Relaying Using Latin Hyper-Cubes. https://arxiv.org/abs/1210.3953

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↗