Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1604.05053

Frequency-Domain Response Based Timing Synchronization: A Near Optimal Sampling Phase Criterion for TDS-OFDM

Zhen Gao·Chao Zhang·Yu Zhang·Hang Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In time-domain synchronous OFDM (TDS-OFDM) system for digital television terrestrial multimedia broadcasting (DTMB) standard, the baseband OFDM signal is upsampled and shaping filtered by square root raised cosine (SRRC) filter before digital-to-analog converter (DAC). Much of the work in the area of timing synchronization for TDS-OFDM focuses on frame synchronization and sampling clock frequency offset recovery, which does not consider the sampling clock phase offset due to the upsampling and SRRC filter. This paper evaluates the bit-error-rate (BER) effect of sampling clock phase offset in TDS-OFDM system. First, we provide the BER for M-order quadrature amplitude modulation (M-QAM) in uncoded TDS-OFDM system. Second, under the condition of the optimal BER criterion and additive white Gaussian noise (AWGN) channel, we propose a near optimal sampling phase estimation criterion based on frequency-domain response. Simulations demonstrate that the proposed criterion also has good performance in actual TDS-OFDM system with channel coding over multipath channels, and it is superior to the conventional symbol timing recovery methods for TDS-OFDM system.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhen Gao, Chao Zhang, Yu Zhang, Hang Zhang. 2016-04-23. Frequency-Domain Response Based Timing Synchronization: A Near Optimal Sampling Phase Criterion for TDS-OFDM. https://doi.org/10.1109/vtcfall.2014.6965989

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↗