Search arXivSearch

arXiv · 1102.1498

On Rate-Splitting by a Secondary Link in Multiple Access Primary Network

Abstract

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is established assuming that the secondary link performs rate-splitting. The achievable rate region is the union of two types of achievable rate regions. The first type is a rate region established assuming that the secondary receiver cannot decode any primary signal, whereas the second is established assuming that the secondary receiver can decode the signal of one primary receiver. The achievable rate region is determined first assuming discrete memoryless channel (DMC) then the results are applied to a Gaussian channel. In the Gaussian channel, the performance of rate-splitting is characterized for the two types of rate regions. Moreover, a necessary and sufficient condition to determine which primary signal that the secondary receiver can decode without degrading the range of primary achievable sum rates is provided. When this condition is satisfied by a certain primary user, the secondary receiver can decode its signal and achieve larger rates without reducing the primary achievable sum rates from the case in which it does not decode any primary signal. It is also shown that, the probability of having at least one primary user satisfying this condition grows with the primary signal to noise ratio.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Tadrous, Mohammed Nafie. 2011-02-08. On Rate-Splitting by a Secondary Link in Multiple Access Primary Network. https://arxiv.org/abs/1102.1498

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