Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0809.0908

Reduced Complexity Demodulation and Equalization Scheme for Differential Impulse Radio UWB Systems with ISI

Xudong Ma
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider the demodulation and equalization problem of differential Impulse Radio (IR) Ultra-WideBand (UWB) Systems with Inter-Symbol-Interference (ISI). The differential IR UWB systems have been extensively discussed recently. The advantage of differential IR UWB systems include simple receiver frontend structure. One challenge in the demodulation and equalization of such systems with ISI is that the systems have a rather complex model. The input and output signals of the systems follow a second-order Volterra model. Furthermore, the noise at the output is data dependent. In this paper, we propose a reduced-complexity joint demodulation and equalization algorithm. The algorithm is based on reformulating the nearest neighborhood decoding problem into a mixed quadratic programming and utilizing a semi-definite relaxation. The numerical results show that the proposed demodulation and equalization algorithm has low computational complexity, and at the same time, has almost the same error probability performance compared with the maximal likelihood decoding algorithm.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xudong Ma. 2009-03-02. Reduced Complexity Demodulation and Equalization Scheme for Differential Impulse Radio UWB Systems with ISI. https://arxiv.org/abs/0809.0908

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↗