Clipping Noise Cancelation for OFDM Systems Using Reliable Observations Based on Compressed Sensing
- Authors
- Kim, Kee-Hoon; Park, Hosung; No, Jong-Seon; Chung, Habong; Shin, Dong-Joon
- Issue Date
- Mar-2015
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Clipping noise; compressed sensing (CS); fast Fourier transform (FFT); orthogonal frequency division multiplexing (OFDM); peak-to-average power ratio (PAPR)
- Citation
- IEEE TRANSACTIONS ON BROADCASTING, v.61, no.1, pp.111 - 118
- Journal Title
- IEEE TRANSACTIONS ON BROADCASTING
- Volume
- 61
- Number
- 1
- Start Page
- 111
- End Page
- 118
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/10116
- DOI
- 10.1109/TBC.2014.2374222
- ISSN
- 0018-9316
- Abstract
- In this paper, a clipping noise cancelation scheme using compressed sensing (CS) technique is proposed for orthogonal frequency division multiplexing systems. The proposed scheme does not need reserved tones or pilot tones, which is different from the previous works using CS technique. Instead, observations of the clipping noise in data tones are exploited, which leads to no loss of data rate. Also, in contrast with the previous works, the proposed scheme selectively exploits the reliable observations of the clipping noise instead of using whole observations, which results in minimizing the bad influence of channel noise. From the selected reliable observations, the clipping noise in time domain is reconstructed and canceled by using CS technique. Simulation results show that the proposed scheme performs well compared to other conventional clipping noise cancelation schemes and shows the best performance in some cases.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electronic & Electrical Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/10116)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.