Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2103.00186

Burst-Error Propagation Suppression for Decision-Feedback Equalizer in Field-Trial Submarine Fiber-Optic Communications

Ji Zhou·Chengkun Yang·Dawei Wang·Qi Sui·Haide Wang·Shecheng Gao·Yuanhua Feng·Weiping Liu·Yuelin Yan·Jianping Li·Changyuan Yu·Zhaohui Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present a field-trial C-band 72Gbit/s optical on-off keying (OOK) system over 18.8km dispersion-uncompensated submarine optical cable in the South China Sea. Chromatic dispersion (CD) of 18.8km submarine optical cable causes four spectral nulls on the 36GHz bandwidth of 72Gbit/s OOK signal, which is the main obstacle for achieving an acceptable bit-error-rate (BER) performance. Decision feedback equalizer (DFE) is effective to compensate for the spectral nulls. However, DFE has a serious defect of burst-error propagation when the burst errors emerge due to the unstable submarine environment. Weighted DFE (WDFE) can be used to mitigate the burst-error propagation, but it cannot fully compensate for the spectral nulls because only a part of feedback symbols is directly decided. Fortunately, maximum likelihood sequence estimation (MLSE) can be added after the WDFE to simultaneously eliminate the resisting spectral distortions and implement optimal detection. Compared to the joint DFE and MLSE algorithm, the joint WDFE and MLSE algorithm can effectively suppress the burst-error propagation to obtain a maximum 2.9dB improvement of $\boldsymbol{Q}$ factor and eliminate the phenomenon of BER floor. In conclusion, the joint WDFE and MLSE algorithm can solve the burst-error propagation for the field-trial fiber-optic communications.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ji Zhou, Chengkun Yang, Dawei Wang, Qi Sui, Haide Wang, Shecheng Gao, Yuanhua Feng, Weiping Liu, Yuelin Yan, Jianping Li, Changyuan Yu, Zhaohui Li. 2021-02-27. Burst-Error Propagation Suppression for Decision-Feedback Equalizer in Field-Trial Submarine Fiber-Optic Communications. https://doi.org/10.1109/jlt.2021.3076822

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↗