Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6589
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPatel, Akhilesh Kumar-
dc.date.accessioned2014-11-03T09:48:19Z-
dc.date.available2014-11-03T09:48:19Z-
dc.date.issued2011-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/6589-
dc.guideTyagi, Anshul-
dc.description.abstractWe study the optimum maximum-likelihood (ML) detection and sub-optimum detection for a multi-branch dual-hop Amplify-and-Forward cooperative diversity network with limited channel state information (CSI). Compared to the full CSI strategy, the signalling overhead at each relay involved with the limited. CSI is reduced by 50%. Since optimum ML detection with the limited CSI, involves numerical integral evaluations so that we have studied two closed-form sub-optimum detection rules of low complexity. It is shown that the first sub-optimum detection has almost identical performance to the optimum ML detection when Gaussianity in the added noise dominates, and the second sub-optimum detection has almost identical performance to the optimum ML detection when Non-Gaussianity dominates. Finally, we study a hybrid sub-optimum detection and demonstrate that its performance is almost identical to that of the optimum ML detection for general casesen_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectSUB-OPTIMUM DETECTION SCHEMESen_US
dc.subjectCOOPERATIVE RELAY NETWORKSen_US
dc.subjectOPTIMUM MAXIMUM-LIKELIHOOD DETECTIONen_US
dc.titleOPTIMUM I SUB-OPTIMUM DETECTION SCHEMES FOR COOPERATIVE RELAY NETWORKSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG21218en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECED G21218.pdf2.18 MBAdobe PDFView/Open


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