Title page for etd-0731112-173855


[Back to Results | New Search]

URN etd-0731112-173855
Author Yung-Fu Liu
Author's Email Address No Public.
Statistics This thesis had been viewed 5355 times. Download 285 times.
Department Communications Engineering
Year 2011
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A suboptimal SLM based on symbol interleaving scheme for PAPR reduction in OFDM systems
Date of Defense 2012-07-27
Page Count 62
Keyword
  • complementary cumulative distribution function
  • peak-to-average power ratio
  • Orthogonal frequency division multiplexing
  • symbol interleaving.
  • selected mapping
  • Abstract Orthogonal frequency division multiplexing (OFDM) system is the standard of next generation mobile communication, one of the major drawbacks of OFDM systems is the peak-to-average power ratio (PAPR). In this paper, we proposed a low complexity Selected mapping (SLM) scheme to reduce PAPR. In [27], Wang proposed a low complexity SLM scheme by utilizing conversion vectors having
    the form of a perfect sequence to solve the problem that phase rotation vectors of the conversion vectors do not usually have an equal magnitude in frequency domain. This paper proposed a low complexity SLM scheme based on perfect sequence and consider the symbol interleaving to reduce the correlation between signals in time domain. It is shown that the (Complementary Cumulative Distribution Function, CCDF) of our proposed scheme are closer to the
    traditional SLM scheme than Wang’s in [27] but with additional complexity. And the computational complexity is much lower than traditional SLM.
    Advisory Committee
  • Jin-Fu Chang - chair
  • Chin-Liang Wang - co-chair
  • Yu T. Su - co-chair
  • Szu-Lin Su - co-chair
  • Char-Dir Chung - co-chair
  • Chih-Peng Li - advisor
  • Files
  • etd-0731112-173855.pdf
  • Indicate in-campus at 2 year and off-campus access at 2 year.
    Date of Submission 2012-07-31

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys