Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1009.3642

MIMO Identical Eigenmode Transmission System (IETS) - A Channel Decomposition Perspective

M. Zeeshan Shakir·Tariq S. Durrani
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the past few years considerable attention has been given to the design of Multiple-Input Multiple-Output (MIMO) Eigenmode Transmission Systems (EMTS). This paper presents an in-depth analysis of a new MIMO eigenmode transmission strategy. The non-linear decomposition technique called Geometric Mean Decomposition (GMD) is employed for the formation of eigenmodes over MIMO flatfading channel. Exploiting GMD technique, identical, parallel and independent transmission pipes are created for data transmission at higher rate. The system based on such decomposition technique is referred to as MIMO Identical Eigenmode Transmission System (IETS). The comparative analysis of the MIMO transceiver design exploiting nonlinear and linear decomposition techniques for variable constellation is presented in this paper. The new transmission strategy is tested in combination with the Vertical Bell Labs Layered Space Time (V-BLAST) decoding scheme using different number of antennas on both sides of the communication link. The analysis is supported by various simulation results.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Zeeshan Shakir, Tariq S. Durrani. 2010-09-19. MIMO Identical Eigenmode Transmission System (IETS) - A Channel Decomposition Perspective. https://arxiv.org/abs/1009.3642

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↗