Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems

Ahirwar, V and Rajan, BS (2005) Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems. In: IEEE International Symposium on Information Theory, SEP 04-09, 2005, Adelaide, SA.

PDF trade.pdf - Published Version Restricted to Registered users only Download (189kB) | Request a copy

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 precoding 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 Paper
Publisher:	IEEE
Additional Information:	Copyright 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	04 Jun 2010 10:46
Last Modified:	19 Sep 2010 06:01
URI:	http://eprints.iisc.ac.in/id/eprint/27518

Actions (login required)

View Item