基于BP网络的稀疏信道估计算法的改进

为了在稀疏信道下有效地降低传统信道估计算法的复杂度,提出了一种基于反向传播(BP,back propagation)网络的正交匹配追踪后接消除(OMPC,orthogonal matching pursuit cancellation)信道估计改进算法.首先通过OMPC算法确定各个非零抽头的位置,其次设置BP网络的权值...     

压缩采样匹配追踪在水声MIMO-OFDM信道估计的应用

针对水声MIMO-OFDM系统,利用水声多径信道冲激响应的稀疏特性,提出一种基于压缩采样匹配追踪 (Compressive Sampling Matching Pursuit, CoSaMP)的信道估计方法。该算法首先利用观测矩阵构建一个向量代替信道,然后采用匹配追踪思想确定这个向量的非零抽头系数位置,最后利用最小二乘法对非零抽头系数进行估计,通过对该向量的估计实现信道响应的估计。与传统最小二乘法（least square, LS）相比,信道估计性能得到很大的提高,与正交匹配追踪（Orthogonal Matching Pursuit,OMP)相比,提高信道估计性能的同时,降低了计算复杂度。通过仿真分析,不但验证了该算法的有效性,还比较了该算法在不同通信系统中的信道估计性能。      

一种改进的稀疏信道估计算法

文中在匹配跟踪算法的基础上实现了一种稀疏信道估计的改进算法。该算法首先通过正交匹配跟踪得到信道非零抽头的粗略估计,并依此来设置自适应均衡器的权重系数的初始值,进行自适应的调整和校正,最终实现对实际信道冲激响应的精确逼近。这样不仅避免了对无谓零抽头的估计,而且提高了信道估计的性能。     

一种基于信道缩短的MB-OFDM UWB稀疏信道估计算法

在MB-OFDMUWB系统中,利用UWB信道的稀疏簇特性,提出一种基于信道缩短的MB-UWB稀疏信道估计算法。首先利用信道缩短滤波器来消除由于循环前缀长度不足造成信道间干扰和码间干扰,然后基于信道缩短后的接收信号,利用UWB信道的稀疏性,探测出非零值抽头的位置,避免了无谓的零值抽头估计,改善了算法的性能。仿真结果表明:当循环前缀CP长度小于信道长度时,LS算法和DFT算法逐渐失效,而新算法可以获得较好的估计性能。     

一种基于匹配追踪的OFDM稀疏信道估计算法

针对OFDM系统,利用信道冲激响应的稀疏特性,提出了一种新的OFDM信道估计算法.首先利用匹配追踪思想确定出非零抽头系数的位置,然后再采用最小二乘算法完成对非零系数值的二次估计,从而通过减少信道估计参数的个数降低算法复杂度.在低信噪比和导频数较少情况下,该算法具有良好的归一化均方误差性能,特别是当因信噪比低而引起GAIC算法性能恶化的时候,新算法具有更好的稳健性.仿真结果验证了算法的有效性.     

基于FBMP算法的水声信道估计

设计了一种基于贝叶斯压缩感知(bayesian compressing sensing,BCS)的水声信道(underwater acoustic channel,UWAC)估计方法,并具体采用快速贝叶斯匹配追踪算法(fast bayesian matching pursuit,FBMP)对水声正交频分复用(OFDM)通信系统下的信道脉冲响应进行估计。在水声信道中,信道的抽头的位置及系数通常分别服从伯努利和复高斯分布,利用这一先验知识,首先对抽头的位置进行检测,然后通过最小均方误差准则得到准确的信道估计。仿真分析了导频数量、信噪比对FBMP、正交匹配追踪(orthogonal matching pursuit,OMP)、变换域(discrete fourier transform,DFT)、最小二乘法(least square,LS)信道估计算法的性能的影响,仿真结果表明,在稀疏信道下,基于FBMP的信道估计方法明显优于OMP、DFT、LS信道估计方法。     

数字电视系统中OFDM稀疏信道估计算法

针对采用OFDM调制技术的数字电视传输系统，利用信道的稀疏特性提出一种基于子空间拟合的信道估计算法。该算法首先利用参考矩阵列向量与观测向量的相关性来确定信道的非零抽头位置，然后再采用最小二乘算法完成对非零系数值的二次估计，避免了无谓的零抽头估计，改善了算法性能。在低信噪比和导频数较少的情况下，算法仍具有稳健的性能，仿真结果验证了该算法的有效性。     

基于压缩感知的OFDM系统信道估计方法

针对无线信道的时域稀疏性以及稀疏度未知的问题,文章将压缩感知技术应用到正交频分复用(OFDM)系统信道估计中,提出了一种稀疏度自适应正交匹配追踪信道估计算法。算法利用离散傅里叶变换(DFT)信道估计算法对循环前缀内和外的噪声进行处理,估计得到的信道频率响应作为正交匹配追踪(OMP)算法稀疏迭代终止的判断条件,实现稀疏度自适应信号重建。同时在原子预选阶段,采用Dice系数准则代替内积准则作为相关性度量准则,可达到更优的估计性能。仿真结果表明,该算法相比于传统的压缩感知信道估计算法具有较好的性能,可以提高系统的归一化均方误差(NMSE)和误码率(BER)性能。     

采用残差变化控制的自适应稀疏信道估计

针对传统压缩感知信道估计对稀疏度信息依赖和稀疏度自适应信道估计在低信噪比时抗噪能力较差的问题,提出了一种采用残差变化控制的稀疏度自适应的压缩感知信道估计算法。该算法在传统的压缩感知信道估计的基础上引入残差变化控制,通过比较每次迭代下的残差变化的幅度来控制信道估计的迭代次数,提高信道估计的自适应性和鲁棒性。同时,为解决传统稀疏度自适应压缩感知信道估计抗噪能力较差的问题,利用正交匹配追踪提高算法的抗噪声性能。相比于传统的稀疏度自适应匹配追踪(Sparsity Adaptive Matching Pursuit,SAMP)算法,所提算法约有4 dB的性能优势,且算法复杂度更低。     

基于改进SAMP算法的UWB多径信道估计

稀疏度自适应匹配追踪（SAMP）算法重构过程中存在其迭代终止条件设置不够合理的情况,需要对SAMP算法进行改进.在信道稀疏度未知时,改进SAMP算法依据残差之差的相对能量小于设定的停止门限来终止迭代过程,通过自适应调整可变步长逐步逼近信道的稀疏度,从而实现了重构UWB信道.仿真结果表明,改进SAMP算法低信噪比时重构精度高于SAMP算法,具有更好的重构性能和广泛的实用性.     

Estimation of frequency-selective CDMA channels with large possible delay and Doppler spreads

The problem of estimating channels with a large number of unknown coefficients is considered. A matching pursuit (MP) followed by cancellation (MPC) algorithm is presented. The algorithm consists of two steps. In the first step, a basic MP algorithm that identifies the strongest channel taps and successively cancels them is used. The second step of the algorithm uses the already identified channel taps to estimate the channel coefficients more accurately. The algorithm has several benefits: low complexity, significantly improved performance over conventional least squares (LS) in sparse channels, and handling of time-varying channels including carrier offsets. Methods to successfully terminate the MP step of the algorithm are presented and are shown to perform well. The statistical behavior of MPC is studied. The MPC estimator is found to achieve a performance close to the Cramer-Rao lower bound. Further, MPC is found to outperform conventional LS in terms of bit error rate when low training overhead is used.     

LMS estimation via structural detection

We consider the LMS estimation of a channel that may be well approximated by an FIR model with only a few nonzero tap coefficients within a given delay horizon or tap length n. When the number of nonzero tap coefficients m is small compared with the delay horizon n, the performance of the LMS estimator is greatly enhanced when this specific structure is exploited. We propose a consistent algorithm that performs identification of nonzero taps only. The results are illustrated via a simulation study     

Enhanced detection-guided NLMS estimation of sparse FIR-modeled signal channels

In various signal-channel-estimation problems, the channel being estimated may be well approximated by a discrete finite impulse response (FIR) model with sparsely separated active or nonzero taps. A common approach to estimating such channels involves a discrete normalized least-mean-square (NLMS) adaptive FIR filter, every tap of which is adapted at each sample interval. Such an approach suffers from slow convergence rates and poor tracking when the required FIR filter is "long." Recently, NLMS-based algorithms have been proposed that employ least-squares-based structural detection techniques to exploit possible sparse channel structure and subsequently provide improved estimation performance. However, these algorithms perform poorly when there is a large dynamic range amongst the active taps. In this paper, we propose two modifications to the previous algorithms, which essentially remove this limitation. The modifications also significantly improve the applicability of the detection technique to structurally time varying channels. Importantly, for sparse channels, the computational cost of the newly proposed detection-guided NLMS estimator is only marginally greater than that of the standard NLMS estimator. Simulations demonstrate the favourable performance of the newly proposed algorithm.     

一种降低复杂度的压缩感知水声信道估计方法

针对浅海的水声信道稀疏特性,提出了一种降低复杂度的前向回溯正交匹配追踪(RC-LABOMP)信道估计方法。首先计算正交匹配追踪和子空间追踪信道估计算法的两类支撑集,接着根据两类支撑集的交集和并集,预处理先验信息,最后利用先验信息完成前向回溯正交匹配追踪信道估计。该算法经过先验信息的预处理,能够减少原LABOMP算法的迭代次数,同时缩小原子的索引范围,因此能够显著降低原LABOMP算法的计算复杂度。此外,将提出的算法与水声Turbo均衡系统相结合,更适用于水声通信系统。仿真结果表明,所提算法在随机信道和水声信道条件下,具有估计精度高、误码率低的特点,同时能够显著降低LABOMP算法的计算复杂度,是一种适用于浅海水声信道的有效估计方法。     

Channel estimation for multi-panel millimeter waveMIMO based on joint compressed sensing

Channel state information (CSI) is essential for downlink transmission in millimeter wave( mmWave) multipleinput multiple output (MIMO) systems. Multi-panel antenna array is exploited in mmWave MIMO system due to itssuperior performance. Two channel estimation algorithms are proposed in this paper, named as generalized jointorthogonal matching pursuit (G-JOMP) and optimized joint orthogonal matching pursuit (O-JOMP) for multi-panelmmWave MIMO system based on the compressed sensing (CS) theory. G-JOMP exploits common sparsity structureamong channel response between antenna panels of base station ( BS) and users to reduce the computationalcomplexity in channel estimation. O-JOMP algorithm is then developed to further improve the accuracy of channelestimation by optimal panel selection based on the power of the received signal. Simulation results show that theperformance of the proposed algorithms is better than that of the conventional orthogonal matching pursuit (OMP)based algorithm in multi-panel mmWave MIMO system.     

RIS辅助无线系统中基于压缩感知的稀疏度自适应级联信道估计方法研究

为了解决可重构智能超表面（Reconfigurable Intelligent Surface, RIS）辅助无线通信系统中级联信道的估计问题,本文提出了一种基于压缩感知（Compressive Sensing, CS）的自适应双结构稀疏正交匹配追踪算法（Adaptive Double-Structured Orthogonal Matching Pursuit, ADS-OMP）。已有的双结构稀疏正交匹配追踪算法（Double-Structured Orthogonal Matching Pursuit, DS-OMP）利用级联信道的双结构稀疏特性即行稀疏特性和列稀疏特性来提高算法估计性能,但需要已知相关信道稀疏度信息。本文提出的ADS-OMP算法在现有的DS-OMP算法基础上设计合理的判决准则和迭代阈值来估计相关稀疏度,从而能在角域级联信道的行稀疏度和列稀疏度均未知的情况下完成级联信道估计,有效克服了现有DS-OMP算法对相关信道稀疏度的依赖,算法实用性更强。仿真结果表明,本文提出的ADS-OMP算法和已有DS-OMP算法估计性能一致,算法复杂度在同一数量级上,前者复杂度略微提升。      

长时延扩展水声信道的联合稀疏恢复估计

对具有长时延扩展的水声信道,传统的信道估计算法如最小二乘法将在大量零值抽头产生严重的估计噪声,导致估计性能下降,同时信道估计时所需的较高估计器阶数大大提高了运算复杂度。压缩感知信道估计方法可有效利用多径稀疏特性改善性能,但需采用较大的训练序列长度以保证稀疏恢复精度,由此导致额外的系统开销。利用水声信道多径稀疏结构在数据块间存在的相关性,建立基于分布式压缩感知的长时延水声信道联合稀疏模型,从而可利用同步正交匹配追踪算法进行联合重构,以进一步减小系统的训练序列开销,提高估计性能。最后通过仿真和海上实验验证了所提方法的有效性。