Computationally efficient asymptotic and accurate approximate expressions for the matched filter bound for (un)coded MPSK transmission on multipath fading channels
{"title":"Computationally efficient asymptotic and accurate approximate expressions for the matched filter bound for (un)coded MPSK transmission on multipath fading channels","authors":"K. Wuyts, M. Moeneclaey","doi":"10.1109/ICC.1994.369034","DOIUrl":null,"url":null,"abstract":"Uncoded and trellis-coded MPSK transmission over multipath Rayleigh fading channels with explicit antenna diversity is investigated. The bit error rate performance of the MLSE-receiver is considered, based on the matched filter bound on the pairwise error event probability. The authors derive an exact asymptotic expression and two accurate approximate expressions for the matched filter bound, the evaluation of which requires much less computational effort than the evaluation of the exact matched filter bound, especially for large diversity orders.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1994.369034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Uncoded and trellis-coded MPSK transmission over multipath Rayleigh fading channels with explicit antenna diversity is investigated. The bit error rate performance of the MLSE-receiver is considered, based on the matched filter bound on the pairwise error event probability. The authors derive an exact asymptotic expression and two accurate approximate expressions for the matched filter bound, the evaluation of which requires much less computational effort than the evaluation of the exact matched filter bound, especially for large diversity orders.<>