Channel estimation and data detection with tracking channel variation in MIMO system using ZF-based SAGE algorithm

Takao Someya, T. Ohtsuki
{"title":"Channel estimation and data detection with tracking channel variation in MIMO system using ZF-based SAGE algorithm","authors":"Takao Someya, T. Ohtsuki","doi":"10.1109/GLOCOM.2005.1578298","DOIUrl":null,"url":null,"abstract":"In recent years, multiple-input multiple-output (MIMO) systems, which use several transmit and receive antennas, have attracted much attention for high performance radio systems. In MIMO systems, the channel estimation is important to distinguish transmit signals from multiple transmit antennas. While the space-alternating generalized expectation-maximization (SAGE) algorithm is known to offer good channel estimation and data detection. We proposed earlier the minimum mean square error (MMSE)-based SAGE algorithm for MIMO systems where the MMSE estimation is used for channel estimation. We showed that the proposed MMSE-based SAGE algorithm can achieve the better bit error rate (BER) than the maximum likelihood (ML) detection with training symbols. The MMSE channel estimation needs the knowledge of the maximum Doppler frequency Fd for deriving the covariance matrix of the channel and the variance sigma2 of additive white Gaussian noise (AWGN). Additionally, the computation of the MMSE channel estimation requires O(L3) operations where L is the transmitted frame length. Thus, its computational complexity is high. In this paper, we propose a zero-forcing (ZF)-based SAGE algorithm for channel estimation and data detection in MIMO systems that does not need the knowledge of Fd and sigma2. Since the computation of the proposed ZF-based SAGE algorithm requires O(N3) operations where N is the number of transmit antennas, its computational complexity is low. We show that the proposed ZF-based tracking SAGE algorithm with less computational complexity can achieve almost the same BER as that of the MMSE-based tracking SAGE algorithm","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2005.1578298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In recent years, multiple-input multiple-output (MIMO) systems, which use several transmit and receive antennas, have attracted much attention for high performance radio systems. In MIMO systems, the channel estimation is important to distinguish transmit signals from multiple transmit antennas. While the space-alternating generalized expectation-maximization (SAGE) algorithm is known to offer good channel estimation and data detection. We proposed earlier the minimum mean square error (MMSE)-based SAGE algorithm for MIMO systems where the MMSE estimation is used for channel estimation. We showed that the proposed MMSE-based SAGE algorithm can achieve the better bit error rate (BER) than the maximum likelihood (ML) detection with training symbols. The MMSE channel estimation needs the knowledge of the maximum Doppler frequency Fd for deriving the covariance matrix of the channel and the variance sigma2 of additive white Gaussian noise (AWGN). Additionally, the computation of the MMSE channel estimation requires O(L3) operations where L is the transmitted frame length. Thus, its computational complexity is high. In this paper, we propose a zero-forcing (ZF)-based SAGE algorithm for channel estimation and data detection in MIMO systems that does not need the knowledge of Fd and sigma2. Since the computation of the proposed ZF-based SAGE algorithm requires O(N3) operations where N is the number of transmit antennas, its computational complexity is low. We show that the proposed ZF-based tracking SAGE algorithm with less computational complexity can achieve almost the same BER as that of the MMSE-based tracking SAGE algorithm
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于zf - SAGE算法的MIMO系统信道估计和跟踪信道变化的数据检测
近年来,使用多个发射和接收天线的多输入多输出(MIMO)系统在高性能无线电系统中备受关注。在MIMO系统中,信道估计对于从多个发射天线中区分发射信号非常重要。而空间交替广义期望最大化(SAGE)算法具有良好的信道估计和数据检测性能。我们之前提出了基于最小均方误差(MMSE)的MIMO系统SAGE算法,其中MMSE估计用于信道估计。结果表明,基于mmse的SAGE算法比基于训练符号的最大似然检测具有更好的误码率(BER)。MMSE信道估计需要知道信道的最大多普勒频率Fd和加性高斯白噪声(AWGN)的方差sigma2的协方差矩阵。此外,MMSE信道估计的计算需要O(L3)次操作,其中L为传输帧长度。因此,其计算复杂度较高。在本文中,我们提出了一种基于零强迫(ZF)的SAGE算法,用于MIMO系统中的信道估计和数据检测,不需要Fd和sigma2的知识。由于本文提出的基于zf的SAGE算法计算需要O(N3)次运算,其中N为发射天线数,因此计算复杂度较低。结果表明,基于zf的跟踪SAGE算法与基于mmse的跟踪SAGE算法相比,具有较低的计算复杂度,可以获得几乎相同的误码率
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Route discovery and capacity of ad hoc networks An algorithm for exploiting channel time selectivity in pilot-aided MIMO systems Consistent proportional delay differentiation: a fuzzy control approach Quantization bounds on Grassmann manifolds of arbitrary dimensions and MIMO communications with feedback Hash-AV: fast virus signature scanning by cache-resident filters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1