Search arXivSearch

arXiv · 1002.1447

PAPR reduction of space-time and space-frequency coded OFDM systems using active constellation extension

Abstract

Active Constellation Extension (ACE) is one of techniques introduced for Peak to Average Power Ratio (PAPR) reduction for OFDM systems. In this technique, the constellation points are extended such that the PAPR is minimized but the minimum distance of the constellation points does not decrease. In this paper, an iterative ACE method is extended to spatially encoded OFDM systems. The proposed methods are such that the PAPR is reduced simultaneously at all antennas, while the spatial encoding relationships still hold. It will be shown that the original ACE method can be employed before Space Time Block Coding (STBC). But in case of Space Frequency Block Coding (SFBC), two modified techniques have been proposed. In the first method, the OFDM frame is separated by several subframes and the ACE method is applied to these subframes independently to reduce their corresponding PAPRs. Then the low PAPR subframes are recombined based on SFBC relationships to yield the transmitted signals from different antennas. In the second method, for each iteration, the ACE is applied to the antenna with the maximum PAPR, and the signals of the other antennas are generated from that of this antenna. Simulation results show that both algorithms converge, but the second method outperforms the first one when the number of antennas is increased.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahmoud Ferdosizadeh Naeiny, Farokh Marvasti. 2010-02-07. PAPR reduction of space-time and space-frequency coded OFDM systems using active constellation extension. https://arxiv.org/abs/1002.1447

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