基于子空间的SFBC MC-CDMA盲信道估计算法研究

S. N. Nazar, I. Psaromiligkos
{"title":"基于子空间的SFBC MC-CDMA盲信道估计算法研究","authors":"S. N. Nazar, I. Psaromiligkos","doi":"10.1109/ACSSC.2005.1599927","DOIUrl":null,"url":null,"abstract":"The issue of blind channel estimation for the downlink of Space-Frequency Block Coded Multi-Carrier Code Division Multiple Access (SFBC MC-CDMA) systems is ad- dressed. Specifically, we consider an intuitive subspace-based channel estimation method and we investigate the corresponding necessary and sufficient conditions under which the channel estimate is unique (within a complex scalar). The derived identifiability conditions are used to highlight two interesting properties of SFBC MC-CDMA systems: (i) there is no antenna order ambiguity even when only one spreading code is assigned to each user, (ii) channel identifiablility is guaranteed, regardless of the channel zeros location. We also establish the unbiasedness of the channel estimates and we derive closed-form expressions for the mean-square-error (MSE) of the estimates as well as the corresponding Cramer-Rao bound (CRB). For the derivation of the CRB, we follow a novel approach which assumes the knowledge of only the spreading code of the desired user and results in a much tighter bound than the CRB derived based on the knowledge of all users' signatures. I. INTRODUCTION Transmit diversity techniques, and particularly Space- Time/Frequency Block Codes (STBC/SFBC) (1), are known to be very effective for combating multipath fading in broad- band wireless communications. These schemes are even more attractive when applied to a robust multiple access technique such as Multi-Carrier Code Division Multiple Access (MC- CDMA). However, the diversity and coding gains that are possible in such systems can only be realized if the underlying channels are accurately acquired at the receiver (4). The issue of blind channel estimation for STBC MC-CDMA systems has been addressed in the past (2), (3); however, to the authors best knowledge, no channel estimation method has been proposed or analyzed for SFBC MC-CDMA. In this work, as a first step in filling that void, we investigate the problem of blind channel estimation for SFBC MC-CDMA systems. We begin by presenting a system model for complex modulation schemes that enables us to treat the links between the multiple transmit antennas and the single receive antenna as a single channel and, thus, reduces the multichannel estima- tion problem to a single-input single-output (SISO) problem. This allows us to develop a simple, intuitive, subspace-based","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On Subspace-based Blind Channel Estimation Algorithms for SFBC MC-CDMA systems\",\"authors\":\"S. N. Nazar, I. Psaromiligkos\",\"doi\":\"10.1109/ACSSC.2005.1599927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The issue of blind channel estimation for the downlink of Space-Frequency Block Coded Multi-Carrier Code Division Multiple Access (SFBC MC-CDMA) systems is ad- dressed. Specifically, we consider an intuitive subspace-based channel estimation method and we investigate the corresponding necessary and sufficient conditions under which the channel estimate is unique (within a complex scalar). The derived identifiability conditions are used to highlight two interesting properties of SFBC MC-CDMA systems: (i) there is no antenna order ambiguity even when only one spreading code is assigned to each user, (ii) channel identifiablility is guaranteed, regardless of the channel zeros location. We also establish the unbiasedness of the channel estimates and we derive closed-form expressions for the mean-square-error (MSE) of the estimates as well as the corresponding Cramer-Rao bound (CRB). For the derivation of the CRB, we follow a novel approach which assumes the knowledge of only the spreading code of the desired user and results in a much tighter bound than the CRB derived based on the knowledge of all users' signatures. I. INTRODUCTION Transmit diversity techniques, and particularly Space- Time/Frequency Block Codes (STBC/SFBC) (1), are known to be very effective for combating multipath fading in broad- band wireless communications. These schemes are even more attractive when applied to a robust multiple access technique such as Multi-Carrier Code Division Multiple Access (MC- CDMA). However, the diversity and coding gains that are possible in such systems can only be realized if the underlying channels are accurately acquired at the receiver (4). The issue of blind channel estimation for STBC MC-CDMA systems has been addressed in the past (2), (3); however, to the authors best knowledge, no channel estimation method has been proposed or analyzed for SFBC MC-CDMA. In this work, as a first step in filling that void, we investigate the problem of blind channel estimation for SFBC MC-CDMA systems. We begin by presenting a system model for complex modulation schemes that enables us to treat the links between the multiple transmit antennas and the single receive antenna as a single channel and, thus, reduces the multichannel estima- tion problem to a single-input single-output (SISO) problem. This allows us to develop a simple, intuitive, subspace-based\",\"PeriodicalId\":326489,\"journal\":{\"name\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2005.1599927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2005.1599927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

研究了空频分组编码多载波码分多址(SFBC MC-CDMA)系统下行链路的信道盲估计问题。具体来说,我们考虑了一种直观的基于子空间的信道估计方法,并研究了信道估计是唯一的(在复标量内)的必要和充分条件。导出的可识别条件用于突出SFBC MC-CDMA系统的两个有趣特性:(i)即使只给每个用户分配一个扩展码,也没有天线顺序模糊;(ii)无论信道零点位置如何,信道可识别性都得到保证。我们还建立了信道估计的无偏性,并推导了估计的均方误差(MSE)的封闭表达式以及相应的Cramer-Rao界(CRB)。对于CRB的推导,我们采用了一种新颖的方法,该方法只假设期望用户的传播码的知识,并且比基于所有用户签名的知识推导的CRB的约束要严格得多。发射分集技术,特别是空时/频块码(STBC/SFBC)(1),被认为是对抗宽带无线通信中的多径衰落非常有效的技术。当这些方案应用于多载波码分多址(MC- CDMA)等鲁棒多址技术时,就更有吸引力了。然而,只有在接收器准确获取底层信道的情况下,才能实现这种系统中的分集和编码增益(4)。过去已经解决了STBC MC-CDMA系统的盲信道估计问题(2),(3);然而,据笔者所知,目前还没有针对SFBC MC-CDMA的信道估计方法被提出或分析。在这项工作中,作为填补这一空白的第一步,我们研究了SFBC MC-CDMA系统的盲信道估计问题。我们首先提出了一个复杂调制方案的系统模型,使我们能够将多个发射天线和单个接收天线之间的链接视为单个通道,从而将多通道估计问题减少到单输入单输出(SISO)问题。这允许我们开发一个简单的,直观的,基于子空间的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Subspace-based Blind Channel Estimation Algorithms for SFBC MC-CDMA systems
The issue of blind channel estimation for the downlink of Space-Frequency Block Coded Multi-Carrier Code Division Multiple Access (SFBC MC-CDMA) systems is ad- dressed. Specifically, we consider an intuitive subspace-based channel estimation method and we investigate the corresponding necessary and sufficient conditions under which the channel estimate is unique (within a complex scalar). The derived identifiability conditions are used to highlight two interesting properties of SFBC MC-CDMA systems: (i) there is no antenna order ambiguity even when only one spreading code is assigned to each user, (ii) channel identifiablility is guaranteed, regardless of the channel zeros location. We also establish the unbiasedness of the channel estimates and we derive closed-form expressions for the mean-square-error (MSE) of the estimates as well as the corresponding Cramer-Rao bound (CRB). For the derivation of the CRB, we follow a novel approach which assumes the knowledge of only the spreading code of the desired user and results in a much tighter bound than the CRB derived based on the knowledge of all users' signatures. I. INTRODUCTION Transmit diversity techniques, and particularly Space- Time/Frequency Block Codes (STBC/SFBC) (1), are known to be very effective for combating multipath fading in broad- band wireless communications. These schemes are even more attractive when applied to a robust multiple access technique such as Multi-Carrier Code Division Multiple Access (MC- CDMA). However, the diversity and coding gains that are possible in such systems can only be realized if the underlying channels are accurately acquired at the receiver (4). The issue of blind channel estimation for STBC MC-CDMA systems has been addressed in the past (2), (3); however, to the authors best knowledge, no channel estimation method has been proposed or analyzed for SFBC MC-CDMA. In this work, as a first step in filling that void, we investigate the problem of blind channel estimation for SFBC MC-CDMA systems. We begin by presenting a system model for complex modulation schemes that enables us to treat the links between the multiple transmit antennas and the single receive antenna as a single channel and, thus, reduces the multichannel estima- tion problem to a single-input single-output (SISO) problem. This allows us to develop a simple, intuitive, subspace-based
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信