Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 7 Oct 2019 in cs.NI | (1910.03057v1)

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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.