Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCyclic Prefix Adaptation with Constant Overall Symbol Time for DFT-spread-OFDM and OFDM
360
0
0.0
(
0
)
Added by
Liangping Ma
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
In this study, we propose a framework for chirp-based communications by exploiting discrete Fourier transform-spread orthogonal frequency division multiplexing (DFT-s-OFDM). We show that a well-designed frequency-domain spectral shaping (FDSS) filter for DFT-s-OFDM can convert its single-carrier nature to a linear combination of chirps circularly translated in the time domain. Also, by exploiting the properties of the Fourier series and Bessel function of the first kind, we analytically obtain the FDSS filter for an arbitrary chirp. We theoretically show that the chirps with low ripples in the frequency domain result in a lower bit-error ratio (BER) via less noise enhancement. We also address the noise enhancement by exploiting the repetitions in the frequency. The proposed framework offers a new way to efficiently synthesize chirps that can be used in Internet-of-Things (IoT), dual-function radar and communication (DFRC) or wireless sensing applications with existing DFT-s-OFDM transceivers.
The fifth generation (5G) wireless standard will support several new use cases and 10 to 100 times the performance of fourth generation (4G) systems. Because of the diverse applications for 5G, flexible solutions which can address conflicting requirements will be needed. In this paper, we propose a solution which enables the use of discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) and OFDM, which address different requirements, using a common reference symbol (RS) design. In this solution, the DFT-s-OFDM symbol contains RSs in the frequency domain that may be shared by a subsequent OFDM symbol. The proposed scheme is generated by puncturing the output of a DFT-spread block and replacing the punctured samples with RSs in frequency. We prove that puncturing the interleaved samples at the output of the DFT-spread operation equivalently introduces a periodic interference to the data symbols at the input of the DFT-spread operation. We show that the interference due to the puncturing can be removed with a low-complexity receiver by exploiting the zeros inserted to certain locations before the DFT-spread block at the transmitter. Simulation results support that the proposed scheme removes the error floor caused by the puncturing and achieves lower peak-to-average-power ratio than OFDM.
In this paper, we study the equalization design for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems with insufficient cyclic prefix (CP). In particular, the signal detection performance is severely impaired by inter-carrier interference (ICI) and inter-symbol interference (ISI) when the multipath delay spread exceeding the length of CP. To tackle this problem, a deep learning-based equalizer is proposed for approximating the maximum likelihood detection. Inspired by the dependency between the adjacent subcarriers, a computationally efficient joint detection scheme is developed. Employing the proposed equalizer, an iterative receiver is also constructed and the detection performance is evaluated through simulations over measured multipath channels. Our results reveal that the proposed receiver can achieve significant performance improvement compared to two traditional baseline schemes.
This paper proposes a novel maximum Doppler spread estimation algorithm for OFDM systems with the comb-type pilot pattern. By tracking the drifting delay subspace of the multipath channel, the time correlation function is measured at a high accuracy, which accordingly improves the estimation accuracy of the maximum Doppler spread considerably.
We propose a multicast scheduling scheme to exploit content reuse when there is asynchronicity in user requests. A unicast transmission setup is used for content delivery, while multicast transmission is employed opportunistically to reduce wireless resource usage. We then develop a multicast scheduling scheme for the downlink multiple-input multiple output orthogonal-frequency division multiplexing system in IEEE 802.11 wireless local area network (WLAN). At each time slot, the scheduler serves the users by either unicast or multicast transmission. Out-sequence data received by a user is stored in users cache for future use.Multicast precoding and user selection for multicast grouping are also considered and compliance with the IEEE 802.11 WLAN transmission protocol. The scheduling scheme is based on the Lyapunov optimization technique, which aims to maximize system rate. The resulting scheme has low complexity and requires no prior statistical information on the channels and queues. Furthermore, in the absence of channel error, the proposed scheme restricts the worst case of frame dropping deadline, which is useful for delivering real-time traffic. Simulation results show that our proposed algorithm outperforms existing techniques by 17 % to 35 % in term of user capacity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
