{"title":"利用有限字母属性的多径SISO信道环境中半盲符号估计的迭代过程","authors":"O. Rousseaux, G. Leus, M. Moonen","doi":"10.1109/IZSBC.2002.991761","DOIUrl":null,"url":null,"abstract":"In this paper, we present a maximum likelihood (ML) symbol detector for single-carrier block transmissions in the context of SISO channels with multipath. This ML detector is based on an iterative least squares with projection (ILSP) algorithm exploiting both finite alphabet properties of the transmitted signal and its cyclic prefixed structure in order to approach ML detection in a cheap way. Since the initial channel estimate is crucial for the convergence of the ILSP algorithm, we propose a computationally cheap stochastic method for computing an initial channel estimate using a variant of cyclic prefix only (CP-Only): the known symbol padding only (KSP-Only) technique. The resulting channel model is sufficiently accurate to be used as a starting point for the iterations. The final result is a computationally affordable direct symbol estimation method that yields promising results in terms of bit error rate (BER).","PeriodicalId":336991,"journal":{"name":"2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An iterative procedure for semi-blind symbol estimation in a multipath SISO channel context exploiting finite alphabet properties\",\"authors\":\"O. Rousseaux, G. Leus, M. Moonen\",\"doi\":\"10.1109/IZSBC.2002.991761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a maximum likelihood (ML) symbol detector for single-carrier block transmissions in the context of SISO channels with multipath. This ML detector is based on an iterative least squares with projection (ILSP) algorithm exploiting both finite alphabet properties of the transmitted signal and its cyclic prefixed structure in order to approach ML detection in a cheap way. Since the initial channel estimate is crucial for the convergence of the ILSP algorithm, we propose a computationally cheap stochastic method for computing an initial channel estimate using a variant of cyclic prefix only (CP-Only): the known symbol padding only (KSP-Only) technique. The resulting channel model is sufficiently accurate to be used as a starting point for the iterations. The final result is a computationally affordable direct symbol estimation method that yields promising results in terms of bit error rate (BER).\",\"PeriodicalId\":336991,\"journal\":{\"name\":\"2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IZSBC.2002.991761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IZSBC.2002.991761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An iterative procedure for semi-blind symbol estimation in a multipath SISO channel context exploiting finite alphabet properties
In this paper, we present a maximum likelihood (ML) symbol detector for single-carrier block transmissions in the context of SISO channels with multipath. This ML detector is based on an iterative least squares with projection (ILSP) algorithm exploiting both finite alphabet properties of the transmitted signal and its cyclic prefixed structure in order to approach ML detection in a cheap way. Since the initial channel estimate is crucial for the convergence of the ILSP algorithm, we propose a computationally cheap stochastic method for computing an initial channel estimate using a variant of cyclic prefix only (CP-Only): the known symbol padding only (KSP-Only) technique. The resulting channel model is sufficiently accurate to be used as a starting point for the iterations. The final result is a computationally affordable direct symbol estimation method that yields promising results in terms of bit error rate (BER).