2011
DOI: 10.1515/joc.2011.022
|View full text |Cite
|
Sign up to set email alerts
|

Frequency-Domain Chromatic Dispersion Equalization Using Overlap-Add Methods in Coherent Optical System

Abstract: The frequency domain equalizers (FDEs) employing two types of overlap-add zero-padding (OLA-ZP) methods are applied to compensate the chromatic dispersion in a 112-Gbit=s non-return-to-zero polarization division multiplexed quadrature phase shift keying (NRZ-PDM-QPSK) coherent optical transmission system. Simulation results demonstrate that the OLA-ZP methods can achieve the same acceptable performance as the overlapsave method. The required minimum overlap (or zeropadding) in the FDE is derived, and the optim… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0
1

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 25 publications
(18 citation statements)
references
References 10 publications
0
17
0
1
Order By: Relevance
“…Therefore, a comprehensive comparison with the benchmark FD-CDE is mandatory to assess the merits of the proposed D-FIR-CDE algorithm. Firstly, it should be noted that for each value of N there is an optimal value of N FFT that provides the highest computational efficiency (lowest complexity per processed sample) for FD-CDE [10]. However, considering a fully parallel FFT implementation, it should be noted that the total number of hardware resources (instead of the number of operations per equalized sample) becomes the primary computational effort indicator, since it ultimately dictates the chip area.…”
Section: B Computational Effort and Latencymentioning
confidence: 99%
“…Therefore, a comprehensive comparison with the benchmark FD-CDE is mandatory to assess the merits of the proposed D-FIR-CDE algorithm. Firstly, it should be noted that for each value of N there is an optimal value of N FFT that provides the highest computational efficiency (lowest complexity per processed sample) for FD-CDE [10]. However, considering a fully parallel FFT implementation, it should be noted that the total number of hardware resources (instead of the number of operations per equalized sample) becomes the primary computational effort indicator, since it ultimately dictates the chip area.…”
Section: B Computational Effort and Latencymentioning
confidence: 99%
“…The standard TD equalization is performed by a finite-impulse response (FIR) filter, whose tap coefficients can be determined from the inverse CD transfer function [1]. In FD the equalization exploits the computational efficiency of fast Fourier transform (FFT) in conjunction with overlap-save/add algorithms [3]. Aiming to reduce implementation the complexity, several optimized CDE algorithms have been proposed, including the use of sub-band processing [4] and coefficient quantization [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…In such a case, the filtering can be done more efficiently in frequency domain ( (log ) c N ) [32]. To implement frequency domain equalizer (FDE) either overlap-save method [33,34] or overlap-add method [35] has been investigated for CD compensation with former one having less complexity. The CD compensating FDE based on overlap-save method is illustrated in Fig.…”
Section: ) Frequency Domain Equalizermentioning
confidence: 99%