共查询到20条相似文献,搜索用时 437 毫秒
1.
2.
3.
4.
5.
基于DFT的OFDM系统信道估计改进算法 总被引:2,自引:0,他引:2
基于DFT的信道估计算法计算复杂度比MMSE算法低,性能比LS算法好.但是传统的基于DFT的信道估计只消除了信道冲击响应估计中循环前缀长度之外的噪声,循环前缀长度内的噪声并没有得到抑制,因此算法性能还有提高的空间.本文提出了一种改进的基于DFT的信道估计算法.算法首先估计出噪声方差,然后利用噪声方差设定一个门限,通过此门限对循环前缀内的信道时域冲击响应值进行阈值,进一步消除噪声的干扰.仿真证明,本文的改进信道估计算法性能优于原算法. 相似文献
6.
7.
基于正交多相序列的OFDM信道估计算法 总被引:1,自引:0,他引:1
提出了一种基于正交多相序列的OFDM信道估计算法。该算法采用相关性能良好的正交多相序列作为发送信号的循环前缀,在接收端,提取循环前缀,进行相关计算,最终得到系统频域响应的估计值。通过仿真,验证了在多径衰落信道中,提出的算法比频域梳状导频插入的时域滤波算法及采用小m序列作为循环前缀的信道估计算法具有更高的信道估计精度。 相似文献
8.
9.
10.
11.
基于导频序列推导了频率平坦多输入多输出(MIMO)信道下的最小二乘信道估计(LS)误差;将信道估计误差等效为高斯噪声,推导了信道估计条件下系统的等效信噪比,提出了用系统的等效信噪比来分析和评估在信道估计误差条件下系统的误码性能;最后用等效信噪比的方法评估了ZF-V-BLAST算法在信道估计下的性能,结果表明和计算机仿真结果基本相吻合。 相似文献
12.
13.
Channel Coding: The Road to Channel Capacity 总被引:1,自引:0,他引:1
《Proceedings of the IEEE. Institute of Electrical and Electronics Engineers》2007,95(6):1150-1177
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance versus complexity for practical applications, particularly on the additive white Gaussian noise channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes. Finally, we sketch some of the practical applications of these codes. 相似文献
14.
Watanabe Y. Kamoi K. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2009,55(5):2083-2096
The necessary and sufficient condition of the channel capacity is rigorously formulated for the N -user discrete memoryless multiple-access channel (MAC). The essence is to invoke an elementary MAC where sizes of input alphabets are not greater than the size of output alphabet. The main objective is to demonstrate that the channel capacity of an MAC is achieved by an elementary MAC included in the original MAC. The proof is quite straightforward by the very definition of the elementary MAC. The second objective is to prove that the Kuhn-Tucker conditions of the elementary MAC are sufficient (obviously necessary) for the channel capacity. The latter proof requires two distinctive properties of the MAC: Every solution of the Kuhn-Tucker conditions is a local maximum on the domain of all possible input probability distributions (IPDs), and then particularly for the elementary MAC a set of IPDs for which the value of the mutual information is not smaller than the arbitrary positive number is connected on the domain. As a result, in respect of the channel capacity, the MAC in general can be regarded as an aggregate of a finite number of elementary MACs. 相似文献
15.
16.
主要研究了MIMO-OFDM系统中快速时变信道的信道估计问题,将3种自适应信道估计算法: RLS,QRD-RLS,IQRD-RLS,应用于快速时变信道进行比较研究,并对其进行计算机仿真。仿真结果表明,3种算法性能相似,其中,QRD-RLS和IQRD-RLS算法的收敛速度要快于RLS算法,对于实时系统而言,这两种算法的效率更高。因此,QRD-RLS和IQRD-RIS算法更适合于快速时变信道。 相似文献
17.
Adriana Dapena José A. García-Naya Paula M. Castro Vicente Zarzoso 《Circuits, Systems, and Signal Processing》2014,33(8):2605-2623
In current digital communication systems, channel information is typically acquired by supervised approaches that use pilot symbols included in the transmit frames. Given that pilot symbols do not convey user data, they penalize throughput spectral efficiency, and transmit energy consumption of the system. Unsupervised channel estimation algorithms could be used to mitigate the aforementioned drawbacks although they present higher computational complexity than that offered by supervised ones. This paper proposes a simple decision method suitable for slowly varying channels to determine whether the channel has suffered a significant variation, which requires to estimate the matrix of the recently changed channel. Otherwise, a previous estimate is used to recover the transmitted symbols. The main advantage of this method is that the decision criterion is only based on information acquired during the time frame synchronization, which is carried out at the receiver. We show that the proposed criterion provides a considerable improvement of computational complexity for both supervised and unsupervised methods, without incurring in a penalization in terms of symbol error ratio. Specifically, we consider systems that make use of the popular Alamouti code. Performance evaluation is accomplished by means of simulated channels as well as making use of indoor wireless channels measured using a testbed. 相似文献
18.
19.
在多天线多用户下行系统中,当信道为莱斯(Rician)衰落时,基于瑞利(Rayleigh)信道假设设计出的有限反馈方法将会导致系统反馈开销的浪费。该文提出了一种适用于Rician信道的自适应反馈方案。该方案根据各用户信道的均值信息计算出相应的信道方向分布函数,然后利用其函数设计判决门限来调整各用户的量化反馈码本,使各用户量化码本中的码字矢量更加集中在用户信道矢量方向周围。另外,该方案可以自适应于不同的信道分布,在保证一定的量化误差下,根据信道均值的大小自适应调节各用户的反馈比特数,显著减少了用户的反馈量。仿真结果表明,与基于Rayleigh信道假设的有限反馈方案相比,该文提出的自适应反馈方案在不降低系统的吞吐率性能的前提下显著降低了用户的反馈开销。 相似文献