.png){kind=icon}
.png){kind=icon}
Return
Efficient Receiver Algorithms for DFT-Spread OFDM Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2009.080941.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For the 3GPP LTE uplink transmissions, the DFT-spread OFDM technique has been adopted as the air interface in order to reduce the peak-to-average-power ratio (PAPR). In this scheme, each data symbol is spread over many tones by a Discrete Fourier Transform (DFT) operation at the transmitter before being sent to the Orthogonal Frequency Division Multiplexing (OFDM) modulator. Moreover, more than one user can be scheduled over the same frequency and time resource block (RB) via space-division multiple-access (SDMA). The conventional receiver technique for such DFT-spread OFDM systems involves tone-by-tone single-tap equalization followed by an inverse DFT operation. In this paper, we propose a more powerful receiver technique for DFT-spread OFDM systems that consists of an efficient linear pre-filter and a two-symbol soft output demodulator. The proposed method can be applied to both single-user per RB (DFT-S-OFDMA) and multiple users per RB (DFT-S-OFDM-SDMA) systems and it offers significant performance gains over the conventional method, especially in the high-rate regime, with little attendant increase in computational complexity.
Keywords:
DFT-spread OFDM
OFDMA
SDMA
log likelihood ratio
interference suppression
linear filter
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W