A Novel SLM Scheme for PAPR Reduction in OFDM Systems
| Autor: | Yu-Song Shi, Ying-Guan Wang, Tian-Ming Ma |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: |
Computational complexity theory
Article Subject Computer Networks and Communications Computer science Orthogonal frequency-division multiplexing business.industry Transmitter Communications system Multiplexing lcsh:QA75.5-76.95 Reduction (complexity) Transformation matrix Transmission (telecommunications) lcsh:Electronic computers. Computer science Telecommunications business Algorithm Information Systems |
| Zdroj: | Journal of Computer Networks and Communications, Vol 2011 (2011) |
| ISSN: | 2090-7141 |
| DOI: | 10.1155/2011/195740 |
| Popis: | Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitter's output signal. A novel selected mapping (SLM) scheme is proposed, which employs matrix transformation, cyclically shifting, and linear combining algorithm to generate new candidates. The novel scheme requires only one IFFT and gets more candidate transmission signals throughout the entire process. The complexity analysis and simulation results show that this algorithm can dramatically reduce computational complexity comparing with the conventional SLM scheme as in Hill et al., 2000; Yang et al., 2009; Wang and Ouyang, 2005; Li et al., 2010; and Heo et al., 2007 under the similar PAPR reduction performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text