Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14972
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANDRA, MUDITA-
dc.date.accessioned2016-07-21T11:39:19Z-
dc.date.available2016-07-21T11:39:19Z-
dc.date.issued2016-07-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14972-
dc.description.abstractTurbo codes belong to the class of convolutional error correcting codes used in wireless data transmission applications like mobile communications, deep-sea communications, satellite communications and other power constrained fields. Turbo Decoder consists of concatenation of decoders based on Maximum a posteriori algorithm. Turbo decoding is an iterative principle where the constituent decoders pass extrinsic information to each other with an interleaver or deinterleaver in between. The performance of turbo codes approaches the Shannon limit making them most sought after in current wireless applications. Simulations of Turbo code performance under different parameters and different situations like number of iterations, different encoder structures, interleaver types, puncturing has been done. The performance of turbo codes was simulated in Rayleigh and Rician fading channels. The turbo codes have shown a considerably remarkable performance with variations in parameters and environments.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTD NO.1655;-
dc.subjectTURBO CODESen_US
dc.subjectFADING ENVIRONMENTSen_US
dc.subjectPOSTERIORI ALGORITHMen_US
dc.subjectSIMULATIONen_US
dc.subjectPARAMETERSen_US
dc.titlePERFORMANCE ANALYSIS OF TURBO CODES IN FADING ENVIRONMENTSen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Electronics & Communication Engineering

Files in This Item:
File Description SizeFormat 
Cover_page.pdf23.88 kBAdobe PDFView/Open
Mudita_Chandra_2K12_SPD_11_THESIS_REPORT.pdf1.94 MBAdobe PDFView/Open


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