Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.7405

Performance evaluation on the basis of Bit error rate for different order of Modulation and different length of Subchannels in ofdm system

Sutanu Ghosh
View original source ↗Read source document ↗Export metadata ↓

Abstract

Today, we have required to accommodate a large number of users under a single base station. This can be possible only if we have some flexibility over the spectrum. Previously we have lots of multiplexing methods to accommodate large number of signals in time and frequency domain. But now we have required to accommodate a large number of users in the same bandwidth, without any fading over the received signal. So, orthogonality can be maintained over the frequency response. This technology is now more popular in the mobile communication domain, called Orthogonal Frequency Division Multiplexing (OFDM). Actually user data can be converted into the parallel form and then they are modulated using digital modulation techniques. Finally, they have followed by OFDM Modulator and cyclic prefix can be inserted into the OFDM symbols. Here, I have worked on the measurement of Bit error rate for different modulation techniques in OFDM technology. It has been considered that subchannel size is not constant. According to that I have concluded the overall idea regarding the performance under OFDM technology.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sutanu Ghosh. 2014-06-28. Performance evaluation on the basis of Bit error rate for different order of Modulation and different length of Subchannels in ofdm system. https://doi.org/10.5121/ijmnct.2014.4304

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↗