Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.1727

MIMO In Vivo

Chao He·Yang Liu·Thomas P. Ketterl·Gabriel E. Arrobo·Richard D. Gitlin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present the performance of MIMO for in vivo environments, using ANSYS HFSS and their complete human body model, to determine the maximum data rates that can be achieved using an IEEE 802.11n system. Due to the lossy nature of the in vivo medium, achieving high data rates with reliable performance will be a challenge, especially since the in vivo antenna performance is strongly affected by near field coupling to the lossy medium and the signals levels will be limited by specified specific absorption rate (SAR) levels. We analyzed the bit error rate (BER) of a MIMO system with one pair of antennas placed in vivo and the second pair placed inside and outside the body at various distances from the in vivo antennas. The results were compared to SISO simulations and showed that by using MIMO in vivo, significant performance gain can be achieved, and at least two times the data rate can be supported with SAR limited transmit power levels, making it possible to achieve target data rates in the 100 Mbps.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chao He, Yang Liu, Thomas P. Ketterl, Gabriel E. Arrobo, Richard D. Gitlin. 2014-06-03. MIMO In Vivo. https://doi.org/10.1109/wamicon.2014.6857757

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↗