Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/2162
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandrasekhar, P. S.-
dc.date.accessioned2014-09-26T13:23:39Z-
dc.date.available2014-09-26T13:23:39Z-
dc.date.issued2002-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/2162-
dc.guideMehra, D. K.-
dc.description.abstractTurbo codes are error correction codes which approach Shannon's limit very closely. They involve parallel concatenation of recursive systematic convolutional codes and are decoded using an iterative decoding algorithm. The decoding strategy used to decode turbo codes is the basis of `turbo principle', which connotes the iterated exchange of soft information between different blocks of a communication receiver. The potential importance and applicability of this principle has been found to extend to a wide range of problems in communication. In this dissertation, simulation of turbo coding and decoding has been carried out in MATLAB environment. The performance of turbo codes has been evaluated using the MAP (maximum aposteriori probability) algorithm and its reduced state variant, the threshold-BOJR algorithm and finally, using soft output viterbi algorithm (SOYA).en_US
dc.language.isoenen_US
dc.subjectDECODERSen_US
dc.subjectDIGITAL CIRCUITen_US
dc.subjectCOMMUNICATIONen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titleIMPLEMENTATION OF TURBO DECODERSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG10885en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECDG10885.pdf2.75 MBAdobe PDFView/Open


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