{"title":"OFDM包传输系统中移动平均滤波器的迭代信道估计","authors":"Se-Bin Im, Hyung-Jin Choi, B. Yoon","doi":"10.1109/APCC.2006.255831","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a computationally efficient iterative channel estimation algorithm for orthogonal frequency division multiplexing (OFDM) systems. The minimum mean square error (MMSE) algorithm known for optimal channel estimation or the iterative maximum a-posteriori (MAP) channel estimation algorithm has an excellent performance but their complexities are very high because of the calculation of inverse matrix and covariance matrix. On the other hand, the discrete Fourier transform (DFT)-based channel estimation algorithm is inferior to MMSE algorithm but it has the advantage of a relatively low complexity. We particularly focus on improving this DFT-based estimator by combing in iterative channel update with turbo decoding. The proposed algorithm uses a novel moving average filter in order to minimize the estimation error of the updated channel. Simulation results show that the proposed algorithm gives better performance compared with the original DFT-based algorithm","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Iterative Channel Estimation with Moving Average Filter in OFDM Packet Transmission System\",\"authors\":\"Se-Bin Im, Hyung-Jin Choi, B. Yoon\",\"doi\":\"10.1109/APCC.2006.255831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a computationally efficient iterative channel estimation algorithm for orthogonal frequency division multiplexing (OFDM) systems. The minimum mean square error (MMSE) algorithm known for optimal channel estimation or the iterative maximum a-posteriori (MAP) channel estimation algorithm has an excellent performance but their complexities are very high because of the calculation of inverse matrix and covariance matrix. On the other hand, the discrete Fourier transform (DFT)-based channel estimation algorithm is inferior to MMSE algorithm but it has the advantage of a relatively low complexity. We particularly focus on improving this DFT-based estimator by combing in iterative channel update with turbo decoding. The proposed algorithm uses a novel moving average filter in order to minimize the estimation error of the updated channel. Simulation results show that the proposed algorithm gives better performance compared with the original DFT-based algorithm\",\"PeriodicalId\":205758,\"journal\":{\"name\":\"2006 Asia-Pacific Conference on Communications\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2006.255831\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2006.255831","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative Channel Estimation with Moving Average Filter in OFDM Packet Transmission System
In this paper, we propose a computationally efficient iterative channel estimation algorithm for orthogonal frequency division multiplexing (OFDM) systems. The minimum mean square error (MMSE) algorithm known for optimal channel estimation or the iterative maximum a-posteriori (MAP) channel estimation algorithm has an excellent performance but their complexities are very high because of the calculation of inverse matrix and covariance matrix. On the other hand, the discrete Fourier transform (DFT)-based channel estimation algorithm is inferior to MMSE algorithm but it has the advantage of a relatively low complexity. We particularly focus on improving this DFT-based estimator by combing in iterative channel update with turbo decoding. The proposed algorithm uses a novel moving average filter in order to minimize the estimation error of the updated channel. Simulation results show that the proposed algorithm gives better performance compared with the original DFT-based algorithm