采用分组线性星座预编码OFDM的分层空时传送方式及其迭代接收

本文在设计多输入多输出系统时融合了分层空时结构和空时码的设计思想,在接收端联合采用了随机分层空时编码和分组线性星座预编码OFDM多载波发送方式;并在接收端采用了迭代接收机.仿真结果表明本文提出的方案能充分利用多输入多输出频率选择性信道提供的多径和空间分集度,同时保持了分层空时结构的高数据速率的特性.     

发射分集OFDM系统中子载波频域均衡接收机设计

针对发射分集下的OFDM系统,提出了一种子载波频域均衡接收机设计方法。在保持子载波数恒定的条件下减少循环前缀的长度,并推导出最优分集合并系数。仿真结果表明,在发射分集条件下,本文提出的子载波频域均衡器有效地抑制了OFDM系统中由于循环前缀小于信道最大时延扩展所造成干扰和各个信道信号之间的互干扰,获得了较好的系统性能。     

发射分集OFDM系统中一种基于Turbo迭代的判决反馈信道估计

本文对频率选择性衰落信道条件下发射分集OFDM系统的信道估计进行了研究,提出了一种基于Turbo迭代的判决反馈信道估计方法.该方法充分利用Turbo迭代信息来改善信道估计性能,且因无需求逆运算,使得整个系统的复杂度增加不多.仿真结果表明,所提方法在较高信噪比条件下,明显提高了系统信道估计的性能,且适合于高速移动的信道环境.     

非理想信道下编码-预编码OFDM迭代译码性能界

针对信道估计精度会影响迭代译码性能的问题,分析了非理想信道估计下信道编码与预编码结合的OFDM系统迭代接收机的性能。利用信道估计误差强度来表征信道估计质量,推导了信道参数不理想时系统误码率的一般上界,并给出了一种经验下界。理论分析及仿真表明,信道估计误差不损失系统的分集增益,只造成编码增益下降。在各种系统参数选取下,误码率仿真曲线均落入理论分析上下界之间,且两者间距仅为0.6 dB左右,表明所提出的上下界可有效预测实际系统的渐近误码率性能。     

一种适用于频率选择性衰落信道的Turbo-BLAST系统

该文提出了一种适用于频率选择性无线衰落信道的Turbo-BLAST方案。在发送端联合采用了随机分层空时编码和分组线性星座预编码OFDM以充分利用多径和空间分集;在接收端比较了两种类型的Turbo接收机,一种是基于最小均方误差准则的软输入软输出的检测模块,它有较低的计算复杂度;另一种采用了类似球形解码的检测模块,它有很好的性能但需要较高的计算复杂度。仿真结果表明该文提出的方案能在保持BLAST高数据速率的同时充分利用信道环境提供的多径和空间分集。     

衰落信道下基于线性预测的迭代解调及译码技术:Turbo DPSK

本文针对移动通信中常见的衰落信道的特点,提出了一种基于信道增益线性估计的Turbo DPSK解调、译码技术.其特点是在进行信道增益的线性估计时无需知道信道的自相关函数,可简化接收机的复杂度.同时在系统中引入Per-Survivor Process(PSP)和迭代译码技术,充分利用每次迭代后的信息进一步提高系统的性能.计算机仿真表明,采用这种基于线性信道估计的Turbo DPSK系统有很好的抗衰落性能.     

无线通信中的线性预编码技术应用与研究

为了研究单用户分组传输系统设计的问题，基于线性预编码技术下的无线频率选择性信道，证明在有限冲击响应滤波器信道中，采用线性预编码技术可以获得很好的信道均衡。分组传输中的线性预编码是指一个线性空间到另外一个线性空间的变换，以循环前缀或迫零方式的冗余码片可以消除分组间干扰。同时OFDM系统也可以采用线性预编码技术，结果表明在很多方面采用线性预编码技术的OFDM系统将优于传统的OFDM系统。     

频率选择性衰落信道下DS-CDMA系统发射分集技术

本文研究多径频率选择性衰落信道下,DS-CDMA系统开环发射分集技术.提出了一种将线性多用户检测与发射分集相结合的新方法,该方法能在克服信道衰落的同时抑制多址干扰和码间串扰.针对两种不同的扩频码分配方式,本文分别给出了盲和半盲的信道估计和检测算法.仿真结果表明,本文所提方法的性能优于基于空时分组码的RAKE接收机,特别是存在远近效应时性能改善更大.     

OFDM系统迭代信道估计初始值预测的改进算法

为了得到更精确的迭代信道估计中的信道初始频响值,在基于二次曲线拟合预测的OFDM系统联合迭代信道估计与符号检测算法的基础上,提出一种基于MMSE准则的加窗线性预测方法对信道的初始频率响应值进行估计.仿真结果表明,在较高信噪比下,文中提出的基于MMSE准则的加窗线性预测的估计方法所得到的系统误码性能明显优于采用二次曲线拟合预测的信道估计方法.在复杂度增加不大的情况下,该方法是一种有效的改进算法.     

V-BLAST OFDM系统的频率选择性信道盲估计

研究下行频率选择性衰落环境中垂直分层空时正交频分复用(V-BLAST OFDM)系统的信道盲估计问题。为V-BLAST OFDM系统提出了一种新颖的贴标签型延迟分集结构。该结构能够巧妙赋予V-BLAST OFDM系统以旋转不变性性质。利用上述旋转不变性，进一步为下行V-BLAST OFDM系统提出了一种多输入多输出(MIMO)频率选择性无线信道的盲估计方法。仿真结果表明了新颖贴标签型延迟分集结构的有效性和信道盲估计方法的性能。     

Survivable traffic grooming with path protection at the connection level in WDM mesh networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risk-link-group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.     

一种用于光网络的高效业务疏导辅助图及动态业务疏导算法

利用辅助图,研究了光网络中的业务疏导技术。为解决传统的辅助图存在着模型复杂、波长通道的带宽利用率不高等问题,提出一种新的业务疏导辅助图,能够更有效地利用已有波长通道,避免低效的路由;为了降低动态业务疏导算法的复杂度,提出了一种简化的k最短路径算法,并以此为基础提出了多种疏导策略。仿真结果表明,本文提出的辅助图及其业务疏导算法,可以有效地减少阻塞率。     

IP over WDM网络中能耗自感知的混合疏导专有保护算法

针对绿色生存性IP over WDM网络中资源开销大、网络阻塞率高的问题,提出一种能耗自感知的混合疏导专有保护(HG-PA-DPP)算法。首先在IP层的核心路由器对低粒度业务请求集中疏导;然后通过实时感知WDM层的链路负载和双层器件带来的链路能耗状态定义链路权值,基于分层图在不同波长平面上为各业务请求寻找权值小且链路分离的工作路径和保护路径,同时在业务的中间节点处对不需要光-电-光转换的光路进行光旁路处理;最后,将空闲或保护资源设置为休眠模式以实现节能。仿真结果表明,所提算法在高负载时有着更好的节能效果,且在大网络拓扑下资源开销(RO)为传统算法的76.5%,阻塞率(BP)仅为传统算法的61.1%。     

Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath traffic-grooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.     

Traffic grooming for survivable WDM networks - shared protection

We investigate the survivable traffic-grooming problem for optical mesh networks employing wavelength-division multiplexing (WDM). In the dynamic provisioning context, a typical connection request may require bandwidth less than that of a wavelength channel, and it may also require protection from network failures, typically fiber cuts. Based on a generic grooming-node architecture, we propose three approaches for grooming a connection request with shared protection: protection-at-lightpath level (PAL); mixed protection-at-connection level (MPAC); separate protection-at-connection level (SPAC). In shared-mesh protection, backup paths can share resources as long as their corresponding working paths are unlikely to fail simultaneously. These three schemes explore different ways of backup sharing, and they trade-off between wavelengths and grooming ports. Since the existing version of the problem for provisioning one connection request with shared protection is NP-complete, we propose effective heuristics. Under today's typical connection-bandwidth distribution where lower bandwidth connections outnumber higher bandwidth connections, we find the following: 1) it is beneficial to groom working paths and backup paths separately, as in PAL and SPAC; 2) separately protecting each individual connection, i.e., SPAC, yields the best performance when the number of grooming ports is sufficient; 3) protecting each specific lightpath, i.e., PAL, achieves the best performance when the number of grooming ports is moderate or small.     

WDM疏导网络的共享子通路保护算法

研究了WDM疏导网络中的生存性问题,提出一种支持多粒度业务的共享子通路保护算法(GSSP)。GSSP首先根据网络当前状态动态调整链路权值,在此基础上选择一条最短路作为工作通路;然后将该通路分为互不重叠的等长子通路,分别找出它们的保护通路,并且允许共享保护资源。GSSP可以保证业务连接的可靠性,又允许网络管理者根据不同的优化策略调整子通路长度,可以在恢复时间和资源利用率之间进行折中。最后对GSSP进行了仿真研究,给出了仿真结果。     

Novel disjoint path selection scheme based on link availability in ASON

Risk-disjoint routing is an efficient way to improve network survivability.In this article, a partial risk-disjoint routing algorithm based on link availability (PRDRA-LA) is proposed based on the complete risk-disjoint routing algorithm (CRDRA).While calculating the protection path with PRDRA-LA, the links that share risks with the links in the working path are filtered by link availability.In addition, the risk disjoint degree between the protection path and the working path can be adjusted freely.Simulation results showed that when compared with CRDRA, routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.     

WDM网络中静态流量的最少费用疏导策略

为了解决WDM网状网络中的静态流量疏导问题,基于收发器节约辅助图模型,该文提出了一种最少费用疏导策略。它同时考虑收发器和波长链路两种网络资源的费用,为每条流量计算出一条费用最少的路径,以获得网络总费用最少的解决方案。根据两种资源费用的比值关系,给辅助图中的每条边分配不同的权值,使得路径的总权值最小代表了该路径的费用最少,从而就能够轻易地实现该策略。仿真结果证明,不管两种资源的费用比值如何变化,该策略的网络总费用始终是最少的。     

WDM疏导网络中一种新的多播业务路由算法

研究了波分复用(WDM)网状网中动态多播业务量疏导,提出一种新的辅助疏导模型,其可以描述当前网络资源状况和节点分光特点,并动态更新.进而提出一种有效的多播业务量疏导启发式算法(MGA),将业务的多播选路和波长分配同时完成.仿真表明,该算法在波长连续性限制、网络波长和节点收发器数目有限的情况下,具有较低网络阻塞率.     

Partial SRLG-disjoint shared path protection with differentiated reliability in survivable WDM network

This paper addresses the problem of shared path protection algorithm in survivable wavelength-division-multiplexing (WDM) optical networks, taking into consideration of differentiated reliability (DiR) under Shared-Risk-Link-Group (SRLG) constraint. A subset of network links that share the risk of failure at the same time are said to be in a common SRLG. Rather than the conventional complete SRLG-disjoint shared path protection, we introduce a heuristic Partial SRLG-disjoint Shared Path Protection algorithm (Pd-SPP) based on the concept of SRLG conditional failure probability, to provide differentiated reliability protection. The main target of our work is to improve the network resource utilization ratio under the DiR constraint. We adopt the ideas of partial SRLG-disjoint and the K-shortest paths algorithm such we can efficiently solve the “trap” problem. The experimental results show that our algorithm outperforms the complete SRLG-disjoint shared path protection in both blocking probability ratio and network resource utilization, i.e. the results are found to be promising.