一种低复杂度的MIMO—OFDM信道估计阈值算法

本文分析了现有的基于导频的MIMO—OFDM信道估计技术，提出了一种低复杂度的信道估计闽值算法，这种算法与采用维纳滤波器的估计技术相比较，具有计算复杂度低，适应性好的特点。在“B3G”系统仿真平台上进行了仿真验证，仿真曲线充分表明该算法具有良好的跟踪信道变化的能力。     

一种OFDM系统最大似然信道估计的改进算法

针对传统的信道估计算法中算法性能与复杂度的矛盾,研究了一种低复杂度的最大似然信道估计算法。仿真结果表明,该算法与传统的信道估计算法相比较,具有较低的复杂度和较好的估计性能。     

一种简化的OFDM信道估计方法

OFDM（JE交频分复用）技术是无线通信领域的重要技术,研究信道估计精度对系统性能有着直接的影响。提出了基于导频插入的LS（最小二乘法估计）、MMSE（最小均方误差估计）和SVD（奇异值分解）信道估计方法。并针对MMSE算法有很好的性能但复杂度大,LS算法复杂度低但性能受到限制,提出了一种改进方法。采用广义平稳非相关散射下的多径时变瑞利信道模型,对各个算法进行了仿真试验,得出不同算法的信道估计中误比特曲线,比较了各个算法的性能。仿真结果表明：改进的算法有好的性能和低的复杂度。     

MIMO-OFDM系统的低阶信道估计的改进

在慢衰落信道条件下,MMSE估计有较好的估计性能但复杂度较高。为了降低信道估计的运算复杂度,分析并总结了原有的MMSE信道估计算法以及其改进算法,提出一个基于MIMO-OFDM系统的OLR-MMSE信道估计算法。OLR-MMSE估计是结合了MMSE算法的低秩近似以及SVD分解,大大降低了大矩阵的阶数,有效地降低运算复杂度并可以保持良好的估计性能。通过计算机模拟仿真验证了提出的信道估计可以达到系统性能和复杂度之间较好的权衡。     

MIMO-OFDM 系统角域LS 信道估计算法

当信道估计算法利用先验信息进行MIMO-OFDM 信道辨识时,计算复杂度将显著增加．针对这一问 题,设计一种无需先验信息且计算复杂度低的相移正交角域LS 算法．该算法的基本思想是：在保证LS 算法均方 误差（MSE）性能达到最小的前提下,根据角域内不同发送和接收天线间信道的空间独立特性,采用最有用抽头系 数（MST）技术来提高信道估计性能．仿真结果表明,所提算法具有良好的估计性能．     

一种适用于OFDM—UWB系统的低复杂度信道估计器

提出一种新的虚拟导频辅助信道估计(PPACE)算法,可适用于多带正交频分复用超宽带系统(MB-OFDM UWB),该方法具有低的实现复杂度,且能有效地抵抗多径信道带来的符号间干扰.在不知道信道和噪声的统计信息的情况下,基于离散傅立叶变换(DFT)的信道估计方法通常被用来提高最小二乘(LS)算法的性能.但由于基于DFT的信道估计器中需要使用额外的FFT/TFFT对,这会带来较高的计算复杂度以及相应的较大的面积和功耗.本文作者提出的PPACE算法仅使用了32点的DFT,大大降低了实现复杂度.仿真结果表明,低复杂度的PPACE算法要优于传统的基于DFT的算法,甚至优于线性最小均方差(LMMSE)方法,另外,本文作者根据UWB信道模型的参数提出了一种通用加窗技术,该技术能提高基于DFT的信道估计算法的均方误差(MSE)性能.     

低压电力基于PLC的信道估计算法仿真

研究优化低压电力信道问题,针对低压电力线信道噪声污染严重,由于信道环境恶劣,造成误码率高。为了解决上述问题,采用OFDM系统中对低压电力信道的信道估计算法。传统LS(最小二乘法估计)算法复杂度低但性能受到限制,受噪声影响大。在综合考虑性能和复杂度,提出了新的改进的方法,并针对FFT的时域插值算法的缺陷,采用改进的算法进行仿真。仿真结果表明,改进算法使误码率降低,且减小了噪声的影响,证明信道估计算法提高了信噪比和估计的精度。     

基于频域RLS的UWB信道估计算法研究*

为了提高超宽带接收机性能,提出一种适用于TH-PPM调制方式的超宽带信道估计算法,并对其误码率性能及复杂度进行了分析。算法基于信道频域特性,结合递归最小二乘（RLS）计算,达到信道参数估计的目的。算法可同时对多路信道进行估计,而且对幅度和相位不存在模糊因子。通过计算机仿真和与最大似然法信道估计算法的对比表明,该算法在误码率为10-4时,信噪比增益约为2 dB。通过对该算法性能的理论分析及计算机仿真实验表明,该算法在保证信道估计性能的前提下具有低复杂度,易于工程实现的优点。     

基于MIMO-OFDM系统的低复杂度LS改进算法

本文建立了MIMO-OFDM系统的Matlab仿真模型,在此基础上研究了STBC(Space Time Block Code)空时编码和基于块状导频的信道估计算法.对基于块状导频的LS(Least Square)信道估计算法做了低复杂度的改进,改进后的算法称为LLS(Low complexity LS)算法.经过计算机仿真显示,在传送大量信息时,该算法的运算复杂度及运算时间相较于其他的信道估计算法都大大降低,并且提高了信道估计的误码率性能.     

基于正交字典的全反馈信道函数估计

为解决传统均衡算法和匹配算法在低信噪比情况下水声稀疏信道估计准确率低和计算量大的问题,提出一种基于正交字典的全反馈信道函数估计方法。通过信道参数估计公式分析,当训练序列与信道函数分量卷积构成正交字典集时,利用匹配算法便可获得最佳匹配结果,结合全反馈结构将信道参数反馈迭代计算,用数学归纳法证明该结构可进一步提高信道函数估计准确率。仿真结果表明,在低信噪比条件下,相比均衡类算法和匹配类算法,提出的信道估计算法可获得更高的估计准确率,具有更低的时间复杂度。     

A preliminary study of a diagonal channel-routing model

The layout of two-terminal nets in a VLSI channel is realized in a new diagonal channel-routing model (DCRM), where the tracks are segments respectively displayed at +45 ° and –45 ° on the two layers of the channel. A new definition of channel density is introduced, and a lower bound to the channel width is derived by the application of an algorithm, whose complexity is evaluated as a function of the channel density, and other parameters of the problem.A simple linear-time algorithm is proposed, which produces an optimal layout (i.e., it requires a channel of minimum width) if the length of the longest net equals the lower bound for the channel width. In any case, the number of vias is at most one for each net. Some particular solutions are proposed for problems with long nets.Specific problems are much easier in DCRM than in the classical Manhattan model. For example, any shift-by-i can be realized in DCRM in a channel of widthi.This work has been supported by Consiglio Nazionale delle Ricerche of Italy under a research grant.     

数字电视接收机的新结构--"机道分离"

由于目前"机卡分离"机顶盒仅将条件接收分离出去,而信道解码和信源解码仍被集成在一起,不利于发展数字电视一体机,因此将机顶盒的信道解码部分独立出来,作为"道",将机顶盒的其他部分(主要包括信源解码)作为"机",在"机卡分离"的基础上,进一步提出一种新的数字电视机顶盒结构--"机道分离".     

基于邻频干扰的802.11干扰机设计与实现

基于无线网络交叠信道邻频间干扰及802.11 DCF机制,在合理挑选干扰频道、尽量减少网卡跳变次数的基础上,设计并实现一种高效灵活的全频道干扰机。该干扰机配置有2个网卡,网卡a进行信道监测,网卡b根据网卡a返回的信道号差值数据,跳转到预置的干扰频道发送干扰信号,通过调节干扰信号发送速率实现不同的干扰概率。实验结果表明,该干扰机具有灵活、节能,可覆盖全13个频道的特点。     

Dynamics of capillary flow in an open superoleophilic microchannel and its application to sensing of oil

We report the dynamics of capillary flow of oil in an open superoleophilic channel. The superoleophilic surface is fabricated by spin coating a layer of PDMS?+?n-hexane followed by candle sooting. The occurrence of various flow regimes, including the inertial, visco-inertial, and Lucas–Washburn regimes, are studied using analytical modelling as well as experiments. In case of a superoleophilic channel, much shorter inertial regime is observed as compared to that in an oleophilic channel due to the wicking of oil into the micro-roughness grooves ahead to moving bulk liquid meniscus. The study of the effect of channel aspect ratio \(\varepsilon\) on the mobility parameter \(k~\)showed that the mobility parameter \(k\) is maximum for an aspect ratio of \(\varepsilon =1.6\), which is attributed to the balance between the capillary and viscous forces. Finally, we demonstrate the application of the superoleophilic channel integrated with electrodes for impedance-based sensing of oil from an oil–water emulsion.     

Randomized mutual exclusion on a multiple access channel

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n processes execute a concurrent program that occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to design a distributed algorithm to control entries and exits to/from the shared resource (also called a critical section), in such a way that at any time, there is at most one process accessing it. In our considerations, the shared resource is the shared communication channel itself (multiple access channel), and the main challenge arises because the channel is also the only mean of communication between these processes. We consider both the classic and a slightly weaker version of mutual exclusion, called \(\varepsilon \)-mutual-exclusion, where for each period of a process staying in the critical section the probability that there is some other process in the critical section is at most \(\varepsilon \). We show that there are channel settings, where the classic mutual exclusion is not feasible even for randomized algorithms, while the \(\varepsilon \)-mutual-exclusion is. In more relaxed channel settings, we prove an exponential gap between the makespan complexity of the classic mutual exclusion problem and its weaker \(\varepsilon \)-exclusion version. We also show how to guarantee fairness of mutual exclusion algorithms, i.e., that each process that wants to enter the critical section will eventually succeed.     

基于接收方信道质量的Ad Hoc网络多信道MAC协议

在分析当前Ad Hoc网络多信道MAC协议的基础上,提出了一个衡量信道质量的度量参数CQ（Channel Quality）作为信道选择的依据。并提出了一个基于接收方信道质量的多信道MAC协议MMCQ（Multi-channel MAC protocol with Channel Quality of receiver）,以解决多信道MAC协议常见的控制信道瓶颈和信道分配公平性问题。仿真表明：该协议在降低控制信道开销的前提下,能显著增加网络的平均吞吐量,并降低端到端平均时延。     

层次化的侧信道攻击风险量化评估模型

随着攻击的多元化发展,在多种泄露条件下,密码芯片的安全风险评估问题以及优化的攻防策略选择问题成为目前研究盲点。针对多种泄露,从信息泄露的角度出发,利用信息熵对密码芯片的信息进行量化,并将互信息作为安全风险的衡量指标,提出了一种基于层次化的风险评估模型。该模型采用“自下而上,先局部后整体”的分析方法,将不同类型的泄露和攻击方法进行划分,并将互信息作为泄露风险的量化指标,通过模糊综合分析方法对安全风险进行有效的评估。     

异构无线传感器网络中基于选择分集的节点协作策略*

为提高无线传感器网络在大量节点参与协作情形下的能量效率,提出一种带有反馈信道的虚拟协作簇间传输方案。此方案利用选择分集算法,在一定的服务质量要求下,能获得较大的选择分集增益,从而进一步降低了单位比特能耗。仿真结果表明,此方案能在很大程度上节省单位比特能耗,延长网络生命周期摘要内容。     

Ad Hoc网络基于地理位置的双信道功率退避策略

在地理位置信息的基础上,提出一种双信道功率退避的Ad Hoc网络节能方案。基本思想是控制信道功率由大到小退避,数据信道功率由小到大“退避”。并利用地理位置提供的便利,较好地解决了链路的不对称问题。此外,介绍了功率退避算法,简要分析了成功传输的概率。仿真结果表明,该协议能够满足Ad Hoc网络近距离节点优先通信的设计需求。     

UpdateSearch: A New Dynamic Channel Allocation Scheme for Mobile Networks That Can Adjust to System Loads

Distributed dynamic channel allocation techniques are an integral part of distributed mobile computing systems where nodes communicate among themselves via wireless radio channels. The channel allocation schemes can be broadly categorized as search based or update based. Search based techniques have low messaging complexity and are suited for high system load and low request rates. On the other hand update based schemes have higher messaging complexity but are more suitable for low system load and high request rates. This paper presents a combined scheme, called UpdateSearch, which provides the advantages of both types of schemes. UpdateSearch is parameterized by the number of channel classes k, 1kn, where n is the total number of channels in the system. The parameter k can be adjusted to control the number of concurrent searches and degree of contention between cells competing for channels in the system. For k=1 and k=n the scheme respectively behaves as basic search and basic update scheme [2]. A simple analytical model is used to compare the performance of UpdateSearch for various values of k with the basic update and search techniques in terms of channel allocation time and number of simultaneous channel selections allowed in the system under different system loading conditions.