OFDM系统中稀疏信道的估计

为了提高信道估计的精确性,针对稀疏信道的稀疏特性,利用处理稀疏信号中的一种算法对稀疏信道进行了估计,与传统的最小二乘法的信道估计性能相比,此种算法有效地降低了多载波间的干扰和多普勒的扩展对信道估计的影响,其信道估计性能有所提高。此方法同最小二乘法相结合,信道估计的精确性和频谱利用率进一步得到了提高。通过计算机仿真验证了该算法的有效性。     

基于RLS算法的OFDM CFO与STO联合估计方法

针对OFDM载波频偏与采样时偏的联合估计问题,提出了一种基于递推最小二乘(RLS)算法的新方法.该估计方法采用递推计算方式,能方便实时地更新偏差量的估计值.仿真结果表明,这一方法与现有的同类方法相比,在相同的信道条件下具有更优的估计性能.     

自适应滤波算法LMS和RLS及其在应用中的性能

本文介绍了最小均方误差(LMS)算法和递推最小二乘(RLS)两种自适应滤波理论,并在自适应均衡和信道估计两个应用领域中进行了MATLAB仿真结果.     

时变参数估计的递推Householder变换渐消记忆法

就利用衰减因子通过指数加权对历史数据进行渐消记忆的时变参数估计问题,提出基于正交变换的递推最小二乘法,避免了传统方法因求解法方程而导致的病态加剧问题.同时降低了运算量,改善了收敛性,节省了存贮空间.此外,以本文递推最小二乘法为基础,还可构成相应的递推广义最小二乘.多级最小二乘、增广矩阵法、极大似然法等一系列时变参数渐消记忆估计方法.     

基于毫米波通信的混合MIMO系统的信道估计

作为5G的一项关键技术,毫米波通信要求提出专有的信道估计和预编码算法,为此,针对毫米波MIMO系统的窄带平坦衰落信道研究下行信道估计方案.由于毫米波系统的稀疏特性,将稀疏多径信道的信道估计转化为稀疏信号的重建,基于压缩感知设计适用于毫米波通信系统的信道估计方案,深入研究了正交匹配追踪算法.仿真结果显示,它可以高概率地恢复信号,与传统的最小二乘法比较,能获得更好的信道估计性能.     

改进离散傅里叶变换的协作通信系统信道估计

针对传统协作通信系统信息估计算法存在的不足,利用最小二乘算法和离散傅里叶变换算法的优点,提出一种改进离散傅里叶变换的信道估计算法。首先利用最小二乘算法估计出整体信道频域响应,然后利用离散傅里叶变换算法消除循环前缀长度外的噪声,并根据噪声方差设置一个阈值门限进一步消除循环前缀长度内的噪声,仿真结果表明,改进离散傅里叶变换算法的估计性能比传统离散傅里叶变换信道估计算法更优,具有很好的实用价值。     

一种改进的MIMO-OFDM的信道估计算法

针对频率选择性衰落信道下MIMO—OFDM的系统,基于瑞利衰落信道的模型,利用m序列的自相关性,提出了一种基于m序列做梳状导频的多输入多输出正交频分复用最小二乘算法,该算法可以避免对大矩阵求伪逆,以减少计算复杂度,从而提高了信道估计的计算性能。通过对该算法的误码率性能分析和计算复杂度分析,结果表明,相比传统经典最小二乘算法,所提出信道估计算法在中低信噪比下,有效提高了信道估计性能,适合于在实际应用中实现。     

用于自适应数字波束形成的稳健子阵异步RLS算法

提出了一种修正的递归最小二乘自适应算法--稳健子阵异步递推最小二乘算法(MSARLS)--用于自适应数字波束形成.该算法综合运用稳健估计和子阵异步递推技术.改进后的算法,不但大大减少了运算量,而且增强了算法抗突发强干扰的性能.另还给出了计算的理论分析和计算机仿真结果.     

基于整体最小二乘的联合信道估计及OFDM信号检测算法

针对现有的联合信道估计及OFDM信号检测算法性能不高的问题,该文提出一种基于整体最小二乘的联合信道估计及OFDM信号检测算法。该算法首先通过导频估计初始的信道信息,在此基础上不断地采用整体最小二乘进行OFDM信号检测及信道估计,有效缓解迭代模型误差的影响,加快了算法迭代的收敛速度,提高了信道估计的精度,从而降低了OFDM系统的误码率。该文推导的信道估计克拉美罗界及仿真结果均表明所提出的算法在时变信道环境下优于现有的联合信道估计及OFDM信号检测算法。     

MIMO系统中应用张量分解进行半盲信道估计的算法分析

针对多输入多输出系统半盲信道估计问题,提出一种基于张量分解的半盲联合信号检测和信道估计算法。其思想是利用张量分解的唯一性,对接收信号构造基于张量分解的平行因子模型,并利用正则交替最小二乘算法对信道和发送信号进行联合迭代估计。仿真结果表明:与传统基于导频信道估计方法相比,所提算法只需少量的导频序列即可获得较高的信道估计精度;与已有的交替最小二乘算法相比,所提算法消除了矩阵求伪逆时可能带来的病态问题,收敛速度较快。文章还详细的分析了正则系数和收敛条件等参数对正则交替最小二乘算法性能的影响。      

Starting-up roadmapping fast

This publication contains reprint articles for which IEEE does not hold copyright. You may purchase this article from the Ask*IEEE Document Delivery Service at http://www.ieee.org/services/askieee/     

NODIFS-simulating faults fast

This article introduces, perhaps for the first time, an asynchronous, distributed, circuit partitioned algorithm that is capable of fault simulating both combinational and sequential digital designs on parallel processors. In this approach, called NODIFS (NOvel asynchronous DIstributed algorithm for Fault Simulation), every circuit component is modeled as an asynchronous and concurrent entity that is checked for faults as soon as appropriate signal transitions and fault lists are asserted at its input ports. The circuit is partitioned such that components of every partition are allocated to a unique processor of the parallel processor system     

The fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm

We present a new fast algorithm for Recursive Least-Squares(rls) adaptive filtering that uses displacement structure and subsampled updating. Thefsu ftf algorithm is based on the Fast Transversal Filter(ftf) algorithm, which exploits the shift invariance that is present in therls adaptation of afir filter. Theftf algorithm is in essence the application of a rotation matrix to a set of filters and in that respect resembles the Levinson algorithm. In the subsampled updating approach, we accumulate the rotation matrices over some time interval before applying them to the filters. It turns out that the successive rotation matrices themselves can be obtained from a Schur type algorithm which, once properly initialized, does not require inner products. The various convolutions that thus appear in the algorithm are done using the Fast Fourier Transform(fft). For relatively long filters, the computational complexity of the new algorithm is smaller than the one of the well-known lms algorithm, rendering it especially suitable for applications such as acoustic echo cancellation.     

The fast Hartley transform

A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a time proportional to Nlog2N. The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied. A new timing diagram (stripe diagram) is presented to illustrate the overall dependence of running time on the subroutines composing one implementation; this mode of presentation supplements the simple counting of multiplies and adds. One may view the Fast Hartley procedure as a sequence of matrix operations on the data and thus as constituting a new factorization of the DFT matrix operator; this factorization is presented. The FHT computes convolutions and power spectra distinctly faster than the FFT.     

Photonic fast packet switching

Several approaches to photonic fast packet switching systems are presented. The wavelength-, time-, code-, and space-division approaches, including free-space photonic fast packet switching, are discussed. These approaches to photonic fast packet switching systems show that the research in this area is still in its infancy. Among various solutions, those based on a wavelength-division transport network and an electronic controller are most mature     

A fast overdrive-recovery amplifier

The design of an amplifier is presented which recovers from an overdrive within 0.005 percent in less than 30 ns after a /spl plusmn/10 V signal is applied to its input. The settling-time behavior of the amplifier is free from preshoot, overshoot, and ringing. Most importantly, the output of the amplifier remains unaffected by a capacitive load, if, for example, it is connected to an oscilloscope for visual display. The amplifier maintains a high gain linearity over its total dynamic range (/spl plusmn/0.1 percent), of which 80 percent is typically displayed on the screen of an oscilloscope. Such an amplifier, free from input and output interactions, is ideally suited for precise settling-time measurements of fast D/A converters and interface amplifier systems.