Search arXivSearch

arXiv · 1410.6795

Transmit antenna subset selection in MIMO OFDM system using adaptive mutation Genetic algorithm

Abstract

Multiple input multiple output techniques are considered attractive for future wireless communication systems, due to the continuing demand for high data rates, spectral efficiency, suppress interference ability and robustness of transmission. MIMO-OFDM is very helpful to transmit high data rate in wireless transmission and provides good maximum system capacity by getting the advantages of both MIMO and OFDM. The main problem in this system is that increase in number of transmit and receive antennas lead to hardware complexity. To tackle this issue, an effective optimal transmit antenna subset selection method is proposed in paper with the aid of Adaptive Mutation Genetic Algorithm (AGA). Here, the selection of transmit antenna subsets are done by the adaptive mutation of Genetic Algorithm in MIMO-OFDM system. For all the mutation points, the fitness function are evaluated and from that value, best fitness based mutation points are chosen. After the selection of best mutation points, the mutation process is carried out, accordingly. The implementation of proposed work is done in the working platform MATLAB and the performance are evaluated with various selection of transmit antenna subsets. Moreover, the comparison results between the existing GA with mutation and the proposed GA with adaptive mutation are discussed. Hence, using the proposed work, the selection of transmit antenna with the maximum capacity is made and which leads to the reduced hardware complexity and undisturbed data rate in the MIMO-OFDM system

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nidhi Sindhwani, Manjit Singh. 2014-09-11. Transmit antenna subset selection in MIMO OFDM system using adaptive mutation Genetic algorithm. https://doi.org/10.5121/ijmnct.2014.4402

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

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

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

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