共查询到19条相似文献,搜索用时 93 毫秒
1.
根据蜂窝移动通信信道的统计模型,分析了同频干扰的统计特性,得到了以同信道小区复用因子、智能天线波束数目、旁瓣电平、同频干扰均值、方差以及射频保护比为参数的中断概率的表达式.计算表明,在现有蜂窝移动通信系统中采用智能天线,可以显著改善系统的载波干扰比,增加系统容量. 相似文献
2.
MIMO无线传输技术综述 总被引:2,自引:0,他引:2
MIMO无线传输技术是通信领域的一项重要技术突破,它能在不增加带宽与功率的情况下成倍地提高无线通信系统的容量和频谱效率,堪称新一代无线通信系统中的关键技术之一,近年来引起了人们的广泛关注与研究兴趣。回顾无线移动通信的发展历程,概述天线分集技术与智能天线技术,剖析MIMO无线传输技术的原理与国内外研究现状:传统单天线系统向多天线系统演进、智能天线向多天线系统演进、MIMO无线传输技术的原理、MIMO系统中的分集与复用、MIMO无线信道建模、MIMO系统中的多天线设计等,为深入认识与进一步研究MIMO无线传输技术奠定基础。 相似文献
3.
分析了TD-SCDMA系统中引入智能天线后空分信道的分配问题,根据空间角度相近且与基站之间的距离相差悬殊的用户使用不同的传统信道的准则,讨论了一种高效的基于信干比的空分信道分配搜索算法,用于解决传统信道复用中的组合寻优问题。最后针对该搜索算法进行仿真,分析结论并说明系统性能的改善。 相似文献
4.
5.
6.
多天线可以用来增加通信系统的分集增益或者复用增益,二者之间存在着基本的折衷关系。相关瑞利信道的折衷性能差于i.i.d瑞利衰落信道,并且相关矩阵降秩时,折衷性能进一步下降。本文给出了相关瑞利信道下分集增益和复用增益的最优折衷关系。 相似文献
7.
8.
9.
10.
11.
The application of genetic algorithm (GA) techniques to the problem of overloaded arrays, in which the number of transmitted narrowband signals is greater than the number of receiver array elements, is explored. A new receiver algorithm is presented, which achieves nearly optimal performance but requires significantly less complexity than the maximum-likelihood joint detection (MLJD) receiver. It uses GA techniques with soft-biased initialization, which is efficiently generated using spatial filtering, providing dramatic convergence improvements compared with other initialization schemes. Simulations using both idealized channel models and measured channel responses are used to investigate the impact of spatial correlation and imperfect channel state information (CSI). 相似文献
12.
为了解决目前复杂环境下电力线提取精度及鲁棒性低的问题,提出了一种基于激光点云的电力线自动提取方法。通过主成分分析确定输电线路的主方向,将长距离输电走廊划分为多个空间网格,以应对地形起伏变化时植被点云对提取算法的干扰;再通过一种自顶向下的全新滤波算法剔除每个空间网格的地物点,根据点云密度分布差异实现电力线和电塔的自动分离;另外, 提出半径搜索算法对分离后的结果进行处理,得到单条电力线的激光点云数据。结果表明,所提出的方法对电力线的提取精度高达99.69%,针对不同连接塔型和不同地形都具有很好的鲁棒性。该研究在输电通道空间结构的自动分析领域以及智能巡检领域具有良好的工程应用价值。 相似文献
13.
14.
智能天线系统中上行多用户相干信号的分离与DOA估计方法研究 总被引:3,自引:0,他引:3
本文研究了平主道中的窨特征估计问题。提出了一种工于循环累量的多用户空间牲针该算法用于智能天线中的SDMA实现。该算法构造了循环累量域四,通过对空间特征循环矩阵的特征分解可以得到用户信号的空间特征估计。并以此为基础,设计了用于上行多波束成形的窨滤波器组实现了上行多用户信号的分离,利用空间滤波器的空间频率响应确定共信道多用户信号的DOA《 相似文献
15.
16.
Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode 下载免费PDF全文
Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward (AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one. 相似文献
17.
18.
Kil‐Woong Jang 《International Journal of Communication Systems》2012,25(4):427-446
The channel scheduling problem is to decide how to commit channels for transmitting data between nodes in wireless networks. This problem is one of the most important problems in wireless sensor networks. In this problem, we aim to obtain a near‐optimal solution with the minimal energy consumption within a reasonable time. As the number of nodes increases in the network, however, the amount of calculation for finding the solution would be too high. It can be difficult to obtain an optimal solution in a reasonable execution time because this problem is NP‐hard. Therefore, most of the recent studies for such problems seem to focus on heuristic algorithms. In this paper, we propose efficient channel scheduling algorithms to obtain a near‐optimal solution on the basis of three meta‐heuristic algorithms; the genetic algorithm, the Tabu search, and the simulated annealing. In order to make a search more efficient, we propose some neighborhood generating methods for the proposed algorithms. We evaluate the performance of the proposed algorithms through some experiments in terms of energy consumption and algorithm execution time. The experimental results show that the proposed algorithms are efficient for solving the channel scheduling problem in wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
19.
空间数据集中的点普遍由空间信息及描述文本信息组成.空间近似关键字反远邻查询(Approximate String Reverse Furthest Neighbors Search,ASRFNS)问题是在一个空间数据集中搜索所有以给定查询点为最远邻,且满足文本相似度条件的目标.基于现有的空间反远邻查询算法以及近似关键字查询算法,我们提出了两个基本的解决算法:凸包最远单元交集(CHFCsJoin)算法和凸包最远单元近似字符串串行查询(CHFCASSS)算法;我们又设计了一种包含空间和关键字信息的外存索引结构Filter-Rtree,并给出了相应的凸包最远单元过滤R树(CHFilterRtree)高效算法.通过真实数据集的实验测试,验证这三种算法的有效性,并分析比较了其性能与效率. 相似文献