Ouahbi Rekik, K. Abed-Meraim, M. Pesavento, Anissa Zergaïnoh-Mokraoui
{"title":"Semi-blind Sparse Channel Estimation and Data Detection by Successive Convex Approximation","authors":"Ouahbi Rekik, K. Abed-Meraim, M. Pesavento, Anissa Zergaïnoh-Mokraoui","doi":"10.1109/spawc48557.2020.9154294","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to propose a semi-blind solution, for joint sparse channel estimation and data detection, based on the successive convex approximation approach. The optimization is performed on an approximate convex problem, rather than the original nonconvex one. By exploiting available data and system structure, an iterative procedure is proposed where the channel coefficients and data symbols are updated simultaneously at each iteration. Also an optimized step size, introduced according to line search procedure, is used for convergence improvement with guaranteed convergence to a stationary point. Simulation results show that the proposed solution exhibits fast convergence with very attractive channel and data estimation performance.","PeriodicalId":172835,"journal":{"name":"2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/spawc48557.2020.9154294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The aim of this paper is to propose a semi-blind solution, for joint sparse channel estimation and data detection, based on the successive convex approximation approach. The optimization is performed on an approximate convex problem, rather than the original nonconvex one. By exploiting available data and system structure, an iterative procedure is proposed where the channel coefficients and data symbols are updated simultaneously at each iteration. Also an optimized step size, introduced according to line search procedure, is used for convergence improvement with guaranteed convergence to a stationary point. Simulation results show that the proposed solution exhibits fast convergence with very attractive channel and data estimation performance.