Selected mapping (SLM) schemes are commonly employed to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. It has been shown that the computational complexity of the traditional SLM scheme can be substantially reduced by adopting conversion vectors obtained by using the inverse fast Fourier transform (IFFT) of the phase rotation vectors in place of the conventional IFFT operations. To ensure that the elements of these phase rotation vectors have an equal magnitude, conversion vectors should have the form of a perfect sequence. This study firstly presents three novel classes of perfect sequence, each of which comprises certain base vectors and their cyclically shifted versions. Three novel low-complexity SLM schemes are then proposed based upon the unique structures of these perfect sequences. It is shown that while the PAPR reduction performances of the proposed schemes are marginally poorer than that of the traditional SLM scheme, the three schemes achieve a substantially lower computational complexity. Since the three proposed PAPR reduction schemes cannot be utilized in the orthogonal frequency division multiple access (OFDMA) system. A low-complexity scheme for PAPR reduction in OFDMA uplink systems using either an interleaved or a sub-band sub-carrier assignment strategy is also proposed in the second part of this study. The proposed scheme requires just one IFFT operation. The PAPR reduction performance of the proposed scheme is only marginally poorer than that of the traditional SLM scheme. However, the proposed schemes have significantly lower computational complexities. Besides, multiple-input multiple-output (MIMO) OFDM systems with space-frequency block coding (SFBC) are well-known for their robust performance in time selective fading channels. However, SFBC MIMO-OFDM systems have a high computational complexity since the number of IFFTs required scales in direct proportion to the number of antennas at the transmitter. Furthermore, SFBC MIMO-OFDM systems have a high PAPR. Accordingly, a low-complexity PAPR reduction scheme for SFBC MIMO OFDM systems with the Alamouti encoding scheme is proposed in this study. Extending this scheme obtains two low-complexity transmitter architectures for SFBC MIMO-OFDM systems with a general encoding matrix and an arbitrary number of transmitter antennas. The proposed schemes achieve a significant reduction in computational complexity by fully exploiting the time-domain signal properties of the transmitted signal. In addition, a PAPR reduction scheme is presented based on the proposed transmitter schemes. It is shown that the PAPR reduction performance of the proposed scheme is almost as good as that of the traditional SLM scheme, but is achieved with a substantially lower computational complexity.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0823110-141203 |
| Date | 23 August 2010 |
| Creators | Wang, Sen-Hung |
| Contributors | Chin-Liang Wang, Char-Dir Chung, Chih-Peng Li, Yu T. Su, Tsang-Yi Wang, Chao-Kai Wen, Yu-Chao Tang, Ding-Bing Lin, Chua-Chin Wang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-141203 |
| Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0201 seconds