Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/13527
DC FieldValue
dc.titleDecoupled maximum likelihood channel estimator for space-time block coded system
dc.contributor.authorSHENG JIANGUO
dc.date.accessioned2010-04-08T10:33:55Z
dc.date.available2010-04-08T10:33:55Z
dc.date.issued2003-12-15
dc.identifier.citationSHENG JIANGUO (2003-12-15). Decoupled maximum likelihood channel estimator for space-time block coded system. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/13527
dc.description.abstractA computationally efficient channel estimation scheme based on the decoupled maximum likelihood (DEML) algorithm is introduced for space-time block coded (STBC) system. The BER performance of the STBC system with the DEML channel estimator is obtained under spatially uncorrelated and correlated flat Rayleigh fading channels. It is shown that the DEML channel estimator could perform well only under uncorrelated fading channels. When the fading channels are correlated, a decorrelation algorithm is applied on the correlated signals before the DEML channel estimator is used. A general procedure on the generation of correlated Rayleigh fading envelops is also introduced in such case. In addition, an iterative ML detector is introduced to improve the system performance with the DEML channel estimator, both under uncorrelated and correlated fading channels.
dc.language.isoen
dc.subjectSpace-Time Coding, Estimation, DEML Estimator
dc.typeThesis
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.contributor.supervisorNALLANATHAN, ARUMUGAM
dc.contributor.supervisorTJHUNG TJENG THIANG
dc.description.degreeMaster's
dc.description.degreeconferredMASTER OF ENGINEERING
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis.pdf966.27 kBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


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