异步DS-CDMA系统子空间盲特征波形估计算法的鲁棒性问题研究

 本文针对异步DS-CDMA系统,在理论上分析了信道阶、信道头和尾对子空间盲特征波形估计算法性能的影响,并进行了计算机仿真.首先提出了一个特征波形分解模型,将特征波形分解为m阶主要部分和次要部分,得到了相应的m阶子空间算法;然后运用矩阵扰动理论,证明了特征波形分解的可行性,即m阶子空间算法的特征波形估计逼近于m阶主要部分;最后从矩阵特征值分解的稳定程度出发,推导了特征波形分解准则,该准则指出应该避免考虑次要部分,采用尽可能小的信道阶.仿真结果验证了理论分析的正确性.     

一种改进的稀疏多径信道盲辨识算法

针对无线多径稀疏信道,利用信道有效近似思想,提出了一种改进的基于矩阵外积分解的信道盲辨识与盲均衡算法。算法首先利用改进的VIA信道阶数估计准则,对多径稀疏信道“有效部分”的阶数进行精确估计,然后利用改进的矩阵外积分解算法估计出信道冲激响应的“有效部分”,最后利用该估计结果对接收数据进行反卷积运算,恢复出发送信号。为了降低噪声以及信道冲激响应中的“零抽头”部分对信道盲辨识性能的影响,本算法对噪声方差估计方法进行了改进,提高了算法在中、低信噪比条件下的盲辨识性能。与现有算法相比,本算法不仅降低了对信噪比的要求,而且克服了基于LC准则的子空间算法(SSA, Subspace Algorithm)的相位偏转问题,其中噪声方差的估计方法也可应用于信噪比估计技术。仿真实验以及对SPIB微波信道测试结果验证了本文算法的有效性。      

基于子空间信道矩阵迭代的阶数估计算法

针对二阶统计量信道盲辨识算法中有效阶数估计问题,该文提出了一种基于子空间信道矩阵迭代的阶数估计(SS-CMR)算法.基于过估计条件下的Q矩阵特殊结构和其解空间向量可等价为真实信道冲激响应与公共零点信道的卷积,该算法首先利用子空间算法获得估计的信道矩阵,然后构建迭代形式的代价函数进行阶数估计.仿真表明,SS-CMR算法较CMR算法性能提升,且明显优于现有其他阶数估计算法;解析分析表明算法复杂度较CMR算法明显降低,对首尾系数很小的信道的阶数估计尤为有效.     

干扰距离最远的多用户多天线干扰对齐算法

针对多用户多天线中小区边缘用户同频干扰问题,提出了一种基于干扰距离最远准则的多用户MIMO干扰对齐优化算法,通过对等效干扰信道进行SVD分解,选择与等效干扰信道矩阵距离最大的特征子信道作为传输预编码矩阵,并分析了算法复杂度以及空间相关性对性能的影响,仿真结果显示系统频谱效率较原始算法在8天线下有31.57％的提高.     

基于子空间分解的信道阶数估计算法

提出一种新的基于子空间分解的信道阶数估计算法.首先基于子空间分解,将观测向量自相关矩阵的几何子空间按照某一正整数La分解为“信号”子空间和“噪声”子空间,由“噪声”子空间构建了一个特殊矩阵Gv,提出了Gv特征分析定理,该定理表明当且仅当La等于信道阶数时,Gv奇异并有唯一的零特征值,并进行了详细的理论和实验证明;然后根据该定理,不断修正“噪声”子空间的大小,判定Gv的奇异性,完成信道阶数的估计.仿真证明该算法不但在低信噪比条件下具有很好的估计性能,而且当信道具有较小的初始和结尾系数时,也能达到很好的效果.     

OFDM系统中的信道自适应估计与跟踪算法比较

传统的QR分解和投影逼近子空间（PAST）分解算法,可用于矩阵的奇异值分解和秩数的估计。讨论了在正交频分复用（OFDM）通信系统中基于这两种分解方法对导引信号的子空间进行分解,实现信道矩阵的自适应跟踪估计。采用这种算法,降低了矩阵运算的维数,使每个符号期间信道估计的运算量减少,信道估计的均方误差减小,接收机的误码性能得到改善,同时利用计算机模拟,对两种算法运用到信道估计中的跟踪性能进行了比较。     

基于累积量的空间特征估计算法及其在智能天线中的应用

在智能天线系统中,波达方向(DOA)估计是实现空分多址的关键问题之一.本文提出了一种基于累积量的多用户空间特征估计算法,并将该算法用于智能天线中的多用户相干源DOA估计.该算法利用累积量构造了空间特征矩阵,通过对空间特征矩阵的特征分解得到各用户信号的空间特征估计,并基于空间特征估计,利用前后平滑空间特征协方差矩阵估计共信道多用户信号的DOA.仿真实验验证了算法的有效性.     

一种DOA估计的快速子空间算法

MUSIC算法是一种属于特征结构的子空间超分辨方法，该算法性能优良，但需要估计协方差矩阵并对其进行特征分解，运算量大，很费计算时间。本文对波这方向估计问题进行了研究并提出了一种采取降维处理的快速子空间算法，该算法利用阵列协方差矩阵的一个子矩阵快速得到信号子空问，无需特征分解，且无需估计整个协方差矩阵，只需估计该子矩阵，故快速算法运算复杂度远低于MUSlC算法，而性能损失并不太大。理论分析和计算机仿真结果表明此方法是有效的。     

基于最大范数准则与矩阵特征分解的PN码估计方法

针对直扩信号伪随机序列(PN码)的估计问题,在基于协方差矩阵特征分解算法的基础上,利用最大范数准则加以改进,提出了基于最大范数准则与矩阵特征分解的伪码序列估计方法,并对其进行了理论分析和实验仿真.仿真结果表明,该算法能适用于低信噪比情况,并且与直接特征分解方法相比,估计性能更好.     

矩阵特征分解二阶修正算法

本文研究了时变协方差矩阵特征分解的自适应更新问题,提出了矩阵特征分解二阶修正算法。首先将矩阵秩-l更新与矩阵一阶扰动问题联系起来;然后利用矩阵扰动理论将当前时刻的协方差矩阵特征值和特征向量展开为无穷级数形式,当扰动项趋于零时它们分别趋于前一时刻对应特征值和特征向量;将扰动级数二阶以后的所有项省略得到二阶修正算法;特别地研究了最小特征值重合时信号子空间的更新问题;在系统平稳和非平稳两种条件下分别进行仿真验证算法的性能,并且和一阶修正算法比较,仿真结果表明本文提出的方法具有更高的估计精度。     

Robustness of the subspace method for blind signature waveform estimation with respect to channel order in asynchronous DS-CDMA systems

The robustness of the subspace method for blind signature waveform estimation with respect to channel order is analyzed in asynchronous DS-CDMA systems theoretically. Theoretical analysis and simulation results show that the overestimating of the channel order will lead to the degradation of the quality of the estimated signature waveform. So we should adopt the channel order as small as possible.     

Performance Analysis of Subspace Based Downlink Channel Estimation for W-CDMA Systems Using Chaotic Codes

This paper presents blind channel estimation for downlink W-CDMA system that employs chaotic codes and Walsh codes for spreading information bits of the multiple users. In a W-CDMA system, while transmitting over multipath channels, both intersymbol interference (ISI) as a result of Inter Chip Interference and multiple access interference (MAI) cannot be easily eliminated. Although it is possible to design multiuser detectors that suppress MAI and ISI, these detectors often require explicit knowledge of at least the desired users’ signature waveform. Earlier work focused on a subspace based channel estimation algorithm for asynchronous CDMA systems to estimate the multiple users’ symbols, where only AWGN channel was considered. In our work, we study a similar subspace-based signature waveform estimation algorithm for downlink W-CDMA systems, which use chaotic codes instead of pseudo random codes, that provide estimates of the multiuser channel by exploiting structural information of the data output at the base station. In particular, we show that the subspace of the (data+noise) matrix contains sufficient information for unique determination of channels, and hence, the signature waveforms and signal constellation. We consider Rayleigh and Rician fading channel model to quantify the multipath channel effects. Performance measures like bit error rate and root mean square error are plotted for both chaotic codes and Walsh codes under Rayleigh and Rician fading channels.     

循环前缀块传输系统中的一种MIMO盲信道估计算法

信道估计一直是无线通信领域的研究热点之一,信道参数估计的好坏对系统的整体性能有着至关重要的影响。针对采用循环前缀的多输入多输出(MIMO-CP)系统,本文提出了一种基于子空间的盲信道估计方法,该算法利用了循环前缀所引起的冗余信息。基于子空间的盲信道估计算法都是通过对接收块的自相关矩阵进行奇异值分解(SVD)来实现信道估计的,因此需要利用尽可能多的接收块来得到准确的自相关矩阵的估计值,这就意味着会产生过久的判决延迟以及不能准确对快变信道进行跟踪。利用MIMO-CP系统中系统矩阵特有的块循环特性,对于连续的两个接收数据块以及对应的循环前缀部分组成的向量,可以重新构造一组新的向量而不改变系统的信道矩阵,因此可以通过较少的接收块来得到准确的自相关矩阵的估计值,该方法十分适用于对快变信道的盲估计。文章通过仿真分析了在不同的重复系数以及不同的接收块下该算法的性能并且比较了该算法与现有的“预编码”、“虚拟子载波”等盲信道估计算法的性能。仿真结果表明,提出的算法利用较少的数据块个数就得到了一个可靠的信道估计值和很好的误码率性能。      

Blind multiuser detection: a subspace approach

A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimum-mean-square-error (MMSE) detector can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform and timing of the user of interest. The consistency and asymptotic variance of the estimates of the two linear detectors are examined. A blind adaptive implementation based on a signal subspace tracking algorithm is also developed. It is seen that compared with the previous minimum-output-energy blind adaptive multiuser detector, the proposed subspace-based blind adaptive detector offers lower computational complexity, better performance, and robustness against signature waveform mismatch. Two extensions are made within the framework of signal subspace estimation. First, a blind adaptive method is developed for estimating the effective user signature waveform in the multipath channel. Secondly, a multiuser detection scheme using spatial diversity in the form of an antenna array is considered. A blind adaptive technique for estimating the array response for diversity combining is proposed. It is seen that under the proposed subspace approach, blind adaptive channel estimation and blind adaptive array response estimation can be integrated with blind adaptive multiuser detection, with little attendant increase in complexity     

Robustness of least-squares and subspace methods for blind channelidentification/equalization with respect to effective channelundermodeling/overmodeling

The least-squares and the subspace methods are two well-known approaches for blind channel identification/equalization. When the order of the channel is known, the algorithms are able to identify the channel, under the so-called length and zero conditions. Furthermore, in the noiseless case, the channel can be perfectly equalized. Less is known about the performance of these algorithms in the practically inevitable cases in which the channel possesses long tails of “small” impulse response terms. We study the performance of the mth-order least-squares and subspace methods using a perturbation analysis approach. We partition the true impulse response into the mth-order significant part and the tails. We show that the mth-order least-squares or subspace methods estimate an impulse response that is “close” to the mth-order significant part. The closeness depends on the diversity of the mth-order significant part and the size of the tails. Furthermore, we show that if we try to model not only the “large” terms but also some “small” ones, then the quality of our estimate may degrade dramatically; thus, we should avoid modeling “small” terms. Finally, we present simulations using measured microwave radio channels, highlighting potential advantages and shortcomings of the least-squares and subspace methods     

信号DOA和极化参数的自适应估计

运用ESPRIT算法进行信号参数的估计,关键是对信号子空间的估计。在实际运用中,接收到的信号的参数往往是随时间变化的,因此要得到信号参数的实时估计值就需要根据阵列的接收数据对信号子空间进行更新。分析了如何运用ESPRIT算法得到信号的DOA和极化参数,并在矩阵扰动理论的基础上,利用矩阵特征分解一阶修正方法更新特征值和特征向量,从而使得ESPRIT算法能够自适应地估计信号DOA和极化参数。最后通过Matlab仿真验证了该方法的有效性。     

一种平坦衰落信道下的盲信噪比估计算法

针对基于子空间分解信噪比估计算法中信号子空间维数估计复杂度高、小样本条件下估计偏差大的问题,提出了一种改进的盲信噪比估计算法.该算法首先构造接收信号的自相关矩阵,然后从矩阵奇异值序列的尾部开始,间隔两项依次进行差分得到梯度序列,再以梯度序列相邻两项均值大干特定阈值为条件确定信号子空间的维数,最后求得信噪比.仿真结果表明:信噪比范围为-5～+15 dB时,平坦衰落信道下常用调制信号的信噪比估计标准差小于0.1 dB,与MDL,AIC方法相比,该算法计算量小,且能适应更低的信噪比和更短的数据长度.     

Deterministic linear prediction methods for blind channel estimation based on dual concept of zero-forcing equalization

This paper investigates a class of second-order blind channel estimation algorithms based on deterministic linear prediction, which includes double-sided as well as forward and backward single-sided, for single input multiple output (SIMO) finite impulse response (FIR) channels. By introducing the dual problem of well-known zero-forcing equalization concept, we first derive a double-sided deterministic linear prediction (D-DLP) algorithm that has, good channel estimation performance with the knowledge of exact channel order. By further exploiting the interference subspace cancellation technique and the triangular block-Toeplitz structure of a portion of the channel filtering matrix (upper-left or lower-right part), we obtain the forward and backward single-sided deterministic linear prediction (FS-DLP and BS-DLP) algorithms that can work in the absence of knowledge of channel order with a cost of relatively poor channel estimate. Moreover, a channel order estimation method is also studied based on results from both FS-DLP and BS-DLP. Simulation examples are finally presented to demonstrate the potential of the proposed methods.