Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0809.2148

Cognitive Beamforming Made Practical: Effective Interference Channel and Learning-Throughput Tradeoff

Rui Zhang·Feifei Gao·Ying-Chang Liang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies the transmit strategy for a secondary link or the so-called cognitive radio (CR) link under opportunistic spectrum sharing with an existing primary radio (PR) link. It is assumed that the CR transmitter is equipped with multi-antennas, whereby transmit precoding and power control can be jointly deployed to balance between avoiding interference at the PR terminals and optimizing performance of the CR link. This operation is named as cognitive beamforming (CB). Unlike prior study on CB that assumes perfect knowledge of the channels over which the CR transmitter interferes with the PR terminals, this paper proposes a practical CB scheme utilizing a new idea of effective interference channel (EIC), which can be efficiently estimated at the CR transmitter from its observed PR signals. Somehow surprisingly, this paper shows that the learning-based CB scheme with the EIC improves the CR channel capacity against the conventional scheme even with the exact CR-to-PR channel knowledge, when the PR link is equipped with multi-antennas but only communicates over a subspace of the total available spatial dimensions. Moreover, this paper presents algorithms for the CR to estimate the EIC over a finite learning time. Due to channel estimation errors, the proposed CB scheme causes leakage interference at the PR terminals, which leads to an interesting learning-throughput tradeoff phenomenon for the CR, pertinent to its time allocation between channel learning and data transmission. This paper derives the optimal channel learning time to maximize the effective throughput of the CR link, subject to the CR transmit power constraint and the interference power constraints for the PR terminals.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rui Zhang, Feifei Gao, Ying-Chang Liang. 2009-08-03. Cognitive Beamforming Made Practical: Effective Interference Channel and Learning-Throughput Tradeoff. https://arxiv.org/abs/0809.2148

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↗