共查询到19条相似文献,搜索用时 656 毫秒
1.
信道估计一直是无线通信领域的研究热点之一,信道参数估计的好坏对系统的整体性能有着至关重要的影响。针对采用循环前缀的多输入多输出(MIMO-CP)系统,本文提出了一种基于子空间的盲信道估计方法,该算法利用了循环前缀所引起的冗余信息。基于子空间的盲信道估计算法都是通过对接收块的自相关矩阵进行奇异值分解(SVD)来实现信道估计的,因此需要利用尽可能多的接收块来得到准确的自相关矩阵的估计值,这就意味着会产生过久的判决延迟以及不能准确对快变信道进行跟踪。利用MIMO-CP系统中系统矩阵特有的块循环特性,对于连续的两个接收数据块以及对应的循环前缀部分组成的向量,可以重新构造一组新的向量而不改变系统的信道矩阵,因此可以通过较少的接收块来得到准确的自相关矩阵的估计值,该方法十分适用于对快变信道的盲估计。文章通过仿真分析了在不同的重复系数以及不同的接收块下该算法的性能并且比较了该算法与现有的“预编码”、“虚拟子载波”等盲信道估计算法的性能。仿真结果表明,提出的算法利用较少的数据块个数就得到了一个可靠的信道估计值和很好的误码率性能。 相似文献
2.
3.
4.
5.
6.
双循环相关复倒谱的多用户盲信道辨识方法 总被引:5,自引:2,他引:3
该文针对多用户系统提出了一种新颖的盲辨识方法.它利用了调制引入的循环平稳性,可以识别出不同的用户不同的传感器(天线)各自的传输信道.利用循环复倒谱的方法可以给出信道的估计,方法简单明了,与现有的方法相比有一定的优势,适合于多用户上行链路信道.文中还给出了信道可辨识性的条件和证明,提出了辨识算法,并对算法进行了模拟. 相似文献
7.
基于正交多相序列的OFDM信道估计算法 总被引:1,自引:0,他引:1
提出了一种基于正交多相序列的OFDM信道估计算法。该算法采用相关性能良好的正交多相序列作为发送信号的循环前缀,在接收端,提取循环前缀,进行相关计算,最终得到系统频域响应的估计值。通过仿真,验证了在多径衰落信道中,提出的算法比频域梳状导频插入的时域滤波算法及采用小m序列作为循环前缀的信道估计算法具有更高的信道估计精度。 相似文献
8.
9.
10.
基于DFT的OFDM系统信道估计改进算法 总被引:2,自引:0,他引:2
基于DFT的信道估计算法计算复杂度比MMSE算法低,性能比LS算法好.但是传统的基于DFT的信道估计只消除了信道冲击响应估计中循环前缀长度之外的噪声,循环前缀长度内的噪声并没有得到抑制,因此算法性能还有提高的空间.本文提出了一种改进的基于DFT的信道估计算法.算法首先估计出噪声方差,然后利用噪声方差设定一个门限,通过此门限对循环前缀内的信道时域冲击响应值进行阈值,进一步消除噪声的干扰.仿真证明,本文的改进信道估计算法性能优于原算法. 相似文献
11.
This paper deals with a blind channel estimation method for space-time coded block transmission system. By concatenating the
real part and imaginary part of the received signal to form an elongated vector, we derive an equivalent input–output system
model. Then channel state information (CSI) is blindly estimated using subspace method, utilizing only the redundancy inherent
in space-time block coding (STBC) and cyclic prefix (CP). The estimation ambiguity, which is common to all blind methods,
is analyzed in detail and we prove that there only exist four scalar indeterminacies. Three effective methods to eliminate
the ambiguities are also proposed. Compared with other blind channel estimation methods for space time systems, this method
needs neither redundant precoding nor oversampling, and thus has higher data rate. Besides, this method is robust to channel
order overestimation, which is effectively demonstrated by numerical simulations.
This work was supported by NSFC (60496310, 60672093), NSFJS(BK2005061) and BK2005061. 相似文献
12.
In time varying channels, symbol recovery for single carrier cyclic prefix (SCCP) systems becomes complicated, because the orthogonality of channel frequency response (CFR) matrix is destroyed. In response, we propose a block turbo equalization algorithm in the time domain for SCCP to cope with channel time variations. In particular, the band structure of the channel time response (CTR) matrix is exploited to reduce the computational complexity of matrix inversion. In order to use this equalization scheme, accurate channel state information (CSI) must be available. Accordingly, we present a doubly selective channel estimation method for SCCP block transmissions with the aid of a Karhunen-Loeve basis expansion model (KL-BEM). In this method, the channel estimates are firstly obtained by using the cyclic prefix (CP) of each block, and then further refined by employing an expectation maximization (EM) based iterative algorithm. Combining the iterative estimator with the proposed equalizer naturally results in a doubly iterative receiver, the performance of which is shown to come close to the performance with perfect CSI. 相似文献
13.
Hideyuki Moroga Tetsuya Yamamoto Fumiyuki Adachi 《Wireless Personal Communications》2014,74(4):1163-1177
QR decomposition and M-algorithm based near maximum likelihood block detection (QRM-MLBD) significantly improves the single-carrier (SC) multiple-input multiple-output (SC-MIMO) transmission performance in a frequency-selective fading channel. In the conventional QRM-MLBD, the cyclic prefix (CP) is inserted in order to avoid the inter-block interference (IBI). However, CP insertion reduces the transmission efficiency. In this paper, an iterative overlap QRM-MLBD is proposed for SC-MIMO transmission with no CP insertion. It is confirmed by computer simulation that the iterative overlap QRM-MLBD with no CP insertion provides improved throughput performance while reducing the computational complexity over the conventional QRM-MLBD with CP insertion. 相似文献
14.
Liang Dong 《Wireless Personal Communications》2014,77(3):1833-1845
Single-carrier block transmission is an alternative scheme to orthogonal frequency-division multiplexing (OFDM) for wireless broadband communications. In this paper, a receiver is designed for single-carrier block transmission with cyclic prefix for mobile broadband communications. As the wireless transmission is over doubly selective channels, a basis expansion model is used to capture both the time- and frequency-selectivity of the channel and is parameterized for the receiver design. The receiver estimates the channel model coefficients in the time domain and uses these coefficients for equalization in the frequency domain. The channel estimation is assisted by time-domain pilot insertion. The structure of the frequency-domain channel matrix is exploited and a linear minimum mean-square error equalizer is used for the equalization. When the basis expansion model well matches the physical channel, simulation results show superior receiving performance of the proposed system compared with the OFDM system with a similar complexity. 相似文献
15.
Reliable channel estimation is indispensable for orthogonal frequency-division multiplexing (OFDM) systems employing coherent detection and adaptive loading in order to achieve high data rate communications. Several options exist in practical OFDM systems-including training symbols, cyclic prefix, virtual carriers, pilot tones, and receiver diversity-to facilitate channel estimation. In this paper, a subspace blind channel estimation method based on exploiting the presence of virtual carriers is proposed for OFDM systems over a time-dispersive channel. The method can be applied to conventional OFDM systems with cyclic prefix as well as OFDM systems with no cyclic prefix. The reduction/elimination of cyclic prefix thereby provides the OFDM systems the potential to achieve higher channel utilization than most previously reported cyclic prefix based estimators. Sufficient channel identifiability condition is developed as well. Comparison with two other recently reported subspace methods is presented via computer simulations to support the effectiveness of the proposed method. 相似文献
16.
17.
在无线光正交频分复用(FSO-OFDM)系统中,因需要加入循环前缀而消耗近20%的带宽,降低了数据传输效率。为了进一步减少带宽损耗,改善系统性能,采用小波包变换代替FSO-OFDM中的傅里叶变换,设计了一种基于小波变换的无线光正交频分复用(FSO-WOFDM)系统。该系统无需加入循环前缀,利用小波基函数的正交性来抑制子载波间的干扰。根据FSO-WOFDM系统原理,研究了信道估计方法、湍流强度、小波基对FSO-WOFDM系统误码率的影响,对比分析了FSO-WOFDM与FSO-OFDM的系统性能,并通过实验验证了FSO-WOFDM系统的可行性及其优良的抗混合噪声干扰能力。 相似文献
18.
Yuan-Pei Lin See-May Phoong 《Signal Processing, IEEE Transactions on》2001,49(11):2702-2712
The design of optimal DMT transceivers for distorted channel with colored noise has been of great interest. Of particular interest is the class of block based DMT, where the transmitter and the receiver consist of constant matrices. Two types of block- based DMT transceivers are considered: the DMT system with zero padding (ZP-DMT) and the DMT system with general prefix (GP-DMT). We derive the bit allocation formula. For a given channel and channel noise spectrum, we design the ISI-free optimal transceiver that minimizes the transmission power for a given transmission rate and probability of error. For both ZP-DMT and GP-DMT systems, the optimal ISI-free transceiver can be given in closed from. We will see that for both classes, the optimal transceiver has an orthogonal transmitter. Simulation shows that the optimal DMT system can achieve the same transmission rate and the same probability of error with a much lower transmission power compared with other existing DMT systems 相似文献
19.
一种基于P2P协作的代理缓存流媒体调度算法 总被引:3,自引:0,他引:3
该文根据流媒体系统中缓存空间不足及服务延迟的问题,提出一种基于P2P协作的代理缓存流媒体调度算法PCSPC(Proxy-Caching Scheduler based on P2P Cooperation)。首先按照流行度高的数据占用较大存储空间的原则,利用媒体文件的存储效率为每个前缀分配相应的存储空间。然后按传输成本将前缀降序排列,代理服务器升序排列,将前缀依次分配到代理服务器上,并且通过理论证明该方法能够有效地减少传输成本。PCSPC算法能够兼顾存储效率与传输成本。仿真实例说明了算法的有效性。 相似文献