Pith. sign in

REVIEW

Chromatic Dispersion Compensation Using Filter Bank Based Complex-Valued All-Pass Filter

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1403.1732 v2 pith:2R7E6SYR submitted 2014-03-07 cs.IT math.IT

Chromatic Dispersion Compensation Using Filter Bank Based Complex-Valued All-Pass Filter

classification cs.IT math.IT
keywords filterall-passbankchannelcompensationcomplex-valuedcostframework
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

A long-haul transmission of 100 Gb/s without optical chromatic-dispersion (CD) compensation provides a range of benefits regarding cost effectiveness, power budget, and nonlinearity tolerance. The channel memory is largely dominated by CD in this case with an intersymbol-interference spread of more than 100 symbol durations. In this paper, we propose CD equalization technique based on nonmaximally decimated discrete Fourier transform (NMDFT) filter bank (FB) with non-trivial prototype filter and complex-valued infinite impulse response (IIR) all-pass filter per sub-band. The design of the sub-band IIR all-pass filter is based on minimizing the mean square error (MSE) in group delay and phase cost functions in an optimization framework. Necessary conditions are derived and incorporated in a multi-step and multi-band optimization framework to ensure the stability of the resulting IIR filter. It is shown that the complexity of the proposed method grows logarithmically with the channel memory, therefore, larger CD values can be tolerated with our approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.