Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1102.5442

Blind Adaptive Successive Interference Cancellation for Multicarrier DS-CDMA

Indu Shakya·Falah H. Ali·Elias Stipidis
View original source ↗Read source document ↗Export metadata ↓

Abstract

A new adaptive receiver design for the Multicarrier (MC) DS-CDMA is proposed employing successive interference cancellation (SIC) architecture. One of the main problems limiting the performance of SIC in MC DS-CDMA is the imperfect estimation of multiple access interference (MAI), and hence, the limited frequency diversity gain achieved in multipath fading channels. In this paper, we design a blind adaptive SIC with new multiple access interference suppression capability implemented within despreading process to improve both detection and cancellation processes. Furthermore, dynamic scaling factors derived from the despreader weights are used for interference cancellation process. This method applied on each subcarrier is followed by maximum ratio or equal gain combining to fully exploit the frequency diversity inherent in the multicarrier CDMA systems. It is shown that this way of MAI estimation on individual subcarrier provides significantly improved performance for a MC DS-CDMA system compared to that with conventional matched filter (MF) and SIC techniques at a little added complexity. Performance evaluation under severe nearfar, fading correlation and system loading conditions are carried out to affirm the gain of the proposed adaptive receiver design approach.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Indu Shakya, Falah H. Ali, Elias Stipidis. 2011-02-26. Blind Adaptive Successive Interference Cancellation for Multicarrier DS-CDMA. https://arxiv.org/abs/1102.5442

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↗