Search arXivSearch

arXiv · 0905.4700

Cross-Layer Design of FDD-OFDM Systems based on ACK/NAK Feedbacks

Abstract

It is well-known that cross-layer scheduling which adapts power, rate and user allocation can achieve significant gain on system capacity. However, conventional cross-layer designs all require channel state information at the base station (CSIT) which is difficult to obtain in practice. In this paper, we focus on cross-layer resource optimization based on ACK/NAK feedback flows in OFDM systems without explicit CSIT. While the problem can be modeled as Markov Decision Process (MDP), brute force approach by policy iteration or value iteration cannot lead to any viable solution. Thus, we derive a simple closed-form solution for the MDP cross-layer problem, which is asymptotically optimal for sufficiently small target packet error rate (PER). The proposed solution also has low complexity and is suitable for realtime implementation. It is also shown to achieve significant performance gain compared with systems that do not utilize the ACK/NAK feedbacks for cross-layer designs or cross-layer systems that utilize very unreliable CSIT for adaptation with mismatch in CSIT error statistics. Asymptotic analysis is also provided to obtain useful design insights.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zuleita Ka Ming Ho, Vincent K. N. Lau, Roger S. K. Cheng. 2009-05-28. Cross-Layer Design of FDD-OFDM Systems based on ACK/NAK Feedbacks. https://arxiv.org/abs/0905.4700

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