Ahirwar, V. ; Rajan, B. S. (2005) Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems In: Proceedings of the International Symposium on Information Theory, 2005. ISIT 2005, 4-9 Sept. 2005, Adelaide, SA, Australia.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/1523543/
Related URL: http://dx.doi.org/10.1109/ISIT.2005.1523543
Abstract
It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the Peak-to-average Power Ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices and show that appropriate block-IDFT matrices give lower PAPR as well as lower decoding complexity compared to using Hadamard transform. Moreover, we present a detailed study of the tradeoff between PAPR reduction and the ML decoding complexity when using block-IDFT matrices with various sizes of the blocks.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111186 |
| Deposited On: | 08 Dec 2017 10:31 |
| Last Modified: | 08 Dec 2017 10:31 |
Repository Staff Only: item control page
