2020
DOI: 10.1109/lcomm.2020.3011680
|View full text |Cite
|
Sign up to set email alerts
|

Sparsity-Learning-Based Iterative Compensation for Filtered-OFDM With Clipping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…In particular, we introduce a new analytical model of OFDM systems with CAF suitable for analyzing time-domain distortion compensation approach, and theoretically derive a closed-form upper bound on its achievable signal-to-noise plus distortion ratio (SNDR). Recent studies on clipping recovery techniques for OFDM include those based on compressed sensing [14]- [17], which may offer a better trade-off in terms of complexity and achievable performance compared to the pioneering work [11], [12]. Our results may also serve as performance bounds for these schemes depending on whether the compensation is performed based on TD or FD model.…”
Section: Introductionmentioning
confidence: 83%
“…In particular, we introduce a new analytical model of OFDM systems with CAF suitable for analyzing time-domain distortion compensation approach, and theoretically derive a closed-form upper bound on its achievable signal-to-noise plus distortion ratio (SNDR). Recent studies on clipping recovery techniques for OFDM include those based on compressed sensing [14]- [17], which may offer a better trade-off in terms of complexity and achievable performance compared to the pioneering work [11], [12]. Our results may also serve as performance bounds for these schemes depending on whether the compensation is performed based on TD or FD model.…”
Section: Introductionmentioning
confidence: 83%
“…However, most of these techniques have shortcomings, such as poor system performance (bit error rate [BER]) and/or computational complexity. Well-known examples are distortionless schemes (e.g., SLM and PTS families) [2][3][4][5][6][7], clipping and filtering schemes [8,9], tone injection (TI) [10], active constellation extension (ACE) [11], interleaving [12], encoding family schemes [13], and artificial intelligent families [13][14][15][16][17][18]. Unfortunately, none of these solutions can guarantee the achievement of all standards, that is, acceptable levels of PAPR, BER performance, and computational complexity.…”
Section: Introductionmentioning
confidence: 99%
“…However, a PAPR decompression module was required at the receiver to reconstruct the transmitted signal. Moreover, Jiang and others [9] proposed a sparsity-learning-based iterative algorithm for PAPR reduction to compensate for the distortion of clipped signals. Likewise, a deep neural network (DNN) architecture was provided by Vahdat to reduce the PAPR in autoencoder-based communication systems, and others in [13].…”
Section: Introductionmentioning
confidence: 99%
“…In [5], the author proposed the Hadamard recursive carrier interferometry (HRCI) codes and diagonal recursive carrier interferometry (DRCI) codes to suppress the PAPR under OFDM systems. Jiang in [6] provided the Iterative Compensation algorithm to PAPR suppression. In order to reduce the complexity, Cheng in [7] proposed C-DSLM algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…In order to reduce the complexity, Cheng in [7] proposed C-DSLM algorithm. It can be observed, from the studies recently [5][6][7], the communication scheme is still the DFT based OFDM system. However, the PAPR of DFT for wireless signals will be prohibitively high .…”
Section: Introductionmentioning
confidence: 99%