Pith. sign in

REVIEW

Cyclic Prefix Adaptation with Constant Overall Symbol Time for DFT-spread-OFDM and OFDM

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 1910.03057 v1 pith:UDCMO2MW submitted 2019-10-07 cs.NI

classification cs.NI
keywords durationdft-spread-ofdmofdmsymboloveralltimeadaptationchanging
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

For DFT-spread-OFDM or OFDM, if the delay spread varies in a wide range and the symbol duration is relatively short, adapting the cyclic prefix (CP) duration rather than using a fixed one may significantly improve the spectral efficiency while preventing inter-symbol interference (ISI). In practice, it may be beneficial to have a constant overall DFT-spread-OFDM/OFDM symbol time, which is the sum of the duration of a CP and the duration of a data portion. We propose to adapt the CP duration to the delay spread without changing the overall symbol time for DFT-spread-OFDM or OFDM, and address implementation challenges. In particular, we propose changing the clocking rate of ADC and DAC or using a Farrow filter to reduce the computational complexity of arbitrary-size DFT/IDFT resulting from the adaptation.

Discussion (0). Continue with ORCID to comment.

Pith tools