Please use this identifier to cite or link to this item: http://hdl.handle.net/10266/1822
Full metadata record
DC FieldValueLanguage
dc.contributor.supervisorSandha, Karamjeet-
dc.contributor.authorSingh, Sumeet-
dc.date.accessioned2012-08-03T12:16:19Z-
dc.date.available2012-08-03T12:16:19Z-
dc.date.issued2012-08-03T12:16:19Z-
dc.identifier.urihttp://hdl.handle.net/10266/1822-
dc.descriptionM.E. (Electronics and Communication Engineering)en
dc.description.abstractWireless communications have been developed widely and rapidly in the modern world especially during the last decade. Recent advances in wireless communication systems have increased the throughput over wireless channels. The reliability of wireless communication has also been increased. But still the bandwidth and spectral availability demands are endless. The need to achieve reliable wireless systems with high spectral efficiency, low complexity and good error performance results in continued research in this field. In this thesis, reduction of the Peak-to-Average Power Ratio (PAPR) of Orthogonal Frequency Division Multiplexing (OFDM) is studied. A PAPR reduction method is proposed that is based on block coding the input data and modifying the codeword. The method makes use of the error correction capability of the block code employed. The performance of the algorithm has been investigated through theoretical models and computer simulations. The algorithm performance is examined through computer simulations and it is found that power reductions are obtained.en
dc.description.sponsorshipElectronics and Communication Engineering Department, Thapar University, Patialaen
dc.format.extent23040 bytes-
dc.format.extent1536023 bytes-
dc.format.mimetypeapplication/msword-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectOFDMen
dc.subjectPAPRen
dc.titleOFDM Papr Reduction with Linear Codingen
dc.typeThesisen
Appears in Collections:Masters Theses@ECED

Files in This Item:
File Description SizeFormat 
1822.pdf1.46 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.