异步协同系统频选信道下基于线性预处理的DSTC结构设计

在协同中继系统中,应用分布式空时码(Distributed Space Time Coding, DSTC),可以在有效提高系统效率的同时获得全协同分集。但是,各中继节点的异步传输和节点间的多径衰落会破坏空时码字的结构,使之不能获得全分集。本文针对两中继的异步协同系统,提出了一种频率选择性信道下的基于线性预处理的DSTC传输结构。在此传输结构中,源节点对发送数据块进行预处理后发送给中继节点,中继节点对接收信号进行简单的共轭重排等处理,使得在目的节点形成DSTC的结构。其中,为抵抗异步传输和多径衰落引入的符号间干扰(Inter-symbol Interference, ISI),在源节点处和中继节点处均加入循环前缀(Cyclic Prefix, CP)。于是目的节点对接收到的信号进行DFT处理后,可以运用ML算法对数据信息进行检测。理论分析和仿真表明,当存在定时误差和节点间为频率选择性信道时,目的节点运用ML检测算法该传输结构可获得全空间分集和全多径分集。然后,本文考虑了信道各径延迟为整数倍符号周期的情况,并且证明了该传输结构的分集增益只与节点间信道的有效信道长度有关。      

快衰落瑞利信道下分布式线性卷积空时码的分集增益

在无线中继网络中,中继节点间的随机传输延迟将导致显著的性能下降。因此,针对慢衰落瑞利信道提出可容忍随机时延的分布式线性卷积空时码(DLC-STC),但该类空时码在快衰落信道下的分集性能尚未明确。该文从理论上证明了DLC-STC在快衰落瑞利信道下的分集增益。分析表明,DLC-STC虽然最初是在慢衰落信道下被提出的,但它在快衰落瑞利信道下通过利用最大似然(ML)接收机,仍可获得满异步协作分集增益,仿真结果验证了该理论分析,仿真结果同时表明:在快衰落瑞利信道下,DLC-STC采用MMSE-DFE接收机能够获得与ML接收机相同的分集增益。     

全数字线性调频信号产生及失真自适应接收机技术研究

对流层散射信道是一种随机多径信道,在该信道上传输数字信息时,首先要克服多径时散引起的码间干扰和快衰落导致的通信性能恶化。本文阐述了分离多径技术方案抗码间干扰、抗快衰落以及失真自适应接收的机理,研究了线性调频信号多径分集调制解调器的数字化实现,给出了系统性能测试的结果,积极有效地解决了散射信道存在的主要问题。     

编码协作MARC上全分集LDPC码的实现与性能分析

本文研究了多接入中继信道(MARC)上全分集LDPC码的实现与性能。首先,分析了MARC模型及其固有分集,然后构造了在MARC上能取得全分集的LDPC码,新构造的码字采用根校验节点把源节点传输与中继节点传输联系起来,从而获得全分集。接着,研究了所构造码字的密度演化过程,在密度演化的基础上,进一步分析了全分集LDPC码校验矩阵的结构,给出了通过提高全分集校验比特的比例,改善全分集LDPC码在MARC上编码增益的方法。仿真结果表明,本文所提算法在MARC信道上不仅能实现全分集,而且能取得较高的编码增益。     

基于机会OFDMA中继的协同分集系统性能分析

机会中继能够在多中继节点的情况下灵活方便地实现协同分集,与采用分布式空时编码(DSTC)实现协同分集相比大大简化了物理层的复杂度,并且能够获得相同的分集增益。鉴于OFDM技术可以有效地抗频率选择性衰落,在机会中继的基础上结合OFDM技术,研究多用户协同分集系统性能。提出了机会OFDMA中继的方法,理论上推导了此方法能够带来完全分集增益,并仿真验证了结论。     

异步OFDM空时协同分集方案

提出一种基于空时分组编码的异步正交频分复用（OFDM,Orthogonal Frequency Division Multiplexing）协同分集方案。提出的方案在中继节点实现OFDM调制及OFDM符号的时间反转和复共轭,信宿节点接收信号的每个OFDM子载波都具有Alamouti空时分组编码结构。信宿节点采用最大似然（ML,Maximum Likelihood）译码准则译码。仿真结果表明,提出的异步OFDM空时协同分集方案无需两个中继节点的同步可获得二阶分集增益,且与其它协同分集方案相比,该方案的误比特率和实现复杂度都更低。     

空时格码和OFDM系统联合建模及性能分析

发射端分集、编码和调制结合空时格码，可以有效地提高信号在无线衰落信道中传输的有效性和可靠性；在正交频分复用调制OFDM(Omiogonal Frequency Division Multiplexing)系统中应用空时格码可以有效地对抗多径干扰，提高系统容量，适合于在高速无线数据通信中采用。本文详细地说明了它们结合的基础，进而构造了一个基于空时格码的OFDM系统模型，并分析了在高斯信道下的系统性能。     

多径信道下的异步分布式线性卷积空时编码

分布式空时编码系统中,由于各个中继节点之间的传输不同步会造成分布式空时编码的性能损失。针对这一问题,该文设计了一种异步分布式线性卷积空时编码。通过一种具有特殊结构的生成矩阵的设计,该编码可以在多径信道和中继节点异步传输模型下获得满分集增益。另外,由于该编码的线性特性,因而可以使用迫零(ZF), 最小均方误差(MMSE)以及基于最小均方误差的判决反馈(MMSE-DFE)检测器检测。理论分析和仿真结果均表明,该文提出的异步分布式线性卷积空时编码可以在没有同步传输的假设下,采用次最优检测器来获得满分集增益。     

通信系统中多径衰落信道传输性能的改进

通信系统中多径衰落信道传输性能的改进是当前比较热门的研究课题.我国的通信系统中多径衰落信道传输性能还存在严重的劣势,还存在着诸多有待解决的问题.在实用瑞利衰落信道下,存在加性高斯白噪声,对直接序列扩频通信系统抑制码片内、外多径干扰的能力进行理论分析与计算机仿真.在多径衰落信道较强的条件下,与提高扩频增益相比,增加扩频码的码长对于提高移动通信系统的抗多径衰落性能更加有效,但是扩频增益并非越高越好,需合理选取;证实扩频通信系统在多径瑞利衰落信道中传输时能有效地克服多径衰落.本文简要分析了瑞利衰落信道模型,并深入的研究和探讨了扩频通信系统抗多径干扰性能.     

H-ARQ信道上高性能全分集LDPC码的构造与性能分析

为了提高混合自动重传请求(H-ARQ)系统的通信性能,研究了H-ARQ块衰落信道上全分集低密度奇偶校验(LDPC)码的构造与性能.首先分析了H-ARQ块衰落信道的中断概率及其固有分集,然后构造了在H-ARQ块衰落信道上能取得全分集的LDPC码,新构造的码字采用根校验节点把每次传输联系起来,从而获得全分集.在此基础上,分析了全分集LDPC码的结构,提出了通过提高全分集校验比特的比例,改善全分集LDPC码在H-ARQ信道上编码增益的方法.仿真结果表明,所提算法在H-ARQ信道上不仅能取得全分集,而且具有较高的编码增益     

Soft decode-and-forward cooperative communication with distributed space-time coding

In existing soft decode-and-forward (SDF) cooperative communication systems, the source node is idling in the second time phase while the relay transmits the soft information. In fact, the source can transmit the hard information that cooperates with the relay's soft information using distributed space-time block codes (DSTBC). In this paper, we theoretically derive the detection performance in the second time phase by either using or not using the DSTBC based on the assumption that the soft information can be approximated by Gaussian distribution. This result also enables the optimal power allocation between the source and the relay in the second time phase. Finally, we show via simulation that the advantage of using DSTBC in the second time phase leads to the overall performance improvement of the coded cooperative system.     

协作通信系统的中继选择算法研究

协作通信作为一种新颖的无线通信技术,它的主要思想是通过中继节点参与协作传输,在目的端获得两个或者多个在空间上独立的信号样本,实现空间分集,获得分集增益.因此如何合理选择中继节点成为协作通信的关键问题之一.本文在协作通信模型及原理的基础上,对基于信道状态信息的中继选择算法进行了介绍,并对具体的选择算法的性能进行了仿真.     

Near-optimum detection for distributed space-time block coding under imperfect synchronization

Significant performance gain can potentially be achieved by employing distributed space-time block coding (DSTBC) in ad hoc or mesh networks. So far, however, most research on D-STBC has assumed that cooperative relay nodes are perfectly synchronized. Considering the difficulty in meeting such an assumption in many practical systems, this paper proposes a simple and near-optimum detection scheme for the case of two relay nodes, which proves to be able to handle far greater timing misalignment than the conventional STBC detector.     

认知合作中继网络中的最优中继选择策略

认知合作中继通信可以有效提升无线通信网络的性能和频谱效率。在中继节点较多的情况下,最优中继选择是一个有待解决的问题,它是中继探测成本与合作通信的分集增益之间的一个折中。基于有限情形的最优停时理论给出了最优中继选择策略,进一步得到一个纯SNR（signal-to-noise ratio,信噪比）阈值结构的策略。数字仿真结果验证了其有效性,在待探测中继较多和每个中继探测成本较高情况下,该最优中继选择策略以最少的探测次数获得最大的收益增益。     

Lifetime maximization via cooperative nodes and relay deployment in wireless networks

Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative communications has recently emerged as a new communication paradigm that enables and leverages effective resource sharing among cooperative nodes. In this paper, a general framework for lifetime extension of battery-operated devices by exploiting cooperative diversity is proposed. The framework efficiently takes advantage of different locations and energy levels among distributed nodes. First, a lifetime maximization problem via cooperative nodes is considered and performance analysis for M-ary PSK modulation is provided. With an objective to maximize the minimum device lifetime under a constraint on bit-error-rate performance, the optimization problem determines which nodes should cooperate and how much power should be allocated for cooperation. Since the formulated problem is NP hard, a closed-form solution for a two-node network is derived to obtain some insights. Based on the two-node solution, a fast suboptimal algorithm is developed for multi-node scenarios. Moreover, the device lifetime is further improved by a deployment of cooperative relays in order to help forward information of the distributed nodes in the network. Optimum location and power allocation for each cooperative relay are determined with an aim to maximize the minimum device lifetime. A suboptimal algorithm is developed to solve the problem with multiple cooperative relays and cooperative nodes. Simulation results show that the minimum device lifetime of the network with cooperative nodes improves 2 times longer than the lifetime of the non-cooperative network. In addition, deploying a cooperative relay in a proper location leads up to 12 times longer lifetime than that of the non-cooperative network     

Contract design for relay incentive mechanism under dual asymmetric information in cooperative networks

Cooperative relay network can effectively improve the wireless spectrum efficiency and extend the wireless network coverage. However, due to the selfish characteristics of wireless nodes, spontaneous cooperation among nodes is challenged. Moreover, wireless nodes may acquire the different network information with the various nodes’ location and mobility, channels’ conditions and other factors, which results in information asymmetry between the source and relay nodes. In this paper, the incentive issue between the relay nodes’ cooperative service and the source’s relay selection is investigated under the asymmetric information scenarios. By modeling cooperative communication as a labour market, a contract-theoretic model for relay incentive is proposed to achieve the twin objectives of ability-discrimination and effort-incentive. Considering the feature of asymmetric information, the static and dynamic information of the relay nodes are systematically discussed. To effectively incentivize the potential relay nodes to participate in cooperative communication, the optimization problems are formulated to maximize the source’s utility under the multiple information scenarios. A sequential optimization algorithm is proposed to obtain the optimal wage-bonus strategy with the low computational complexity under the dual asymmetric information scenario. Simulation results show that the optimal contract design scheme is effective in improving the performance of cooperative communication.     

Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers’ market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.     

Selection Cooperation in Heterogeneous Cooperative Networks

Selection cooperation is an attractive cooperative strategy for wireless networks due to its simplicity and efficiency. In this paper, we consider a heterogeneous cooperative network consisting of different kinds of nodes with low-cost radios where the activities of one kind of nodes are triggered by the other kinds of nodes. This is a common scenario for many networks, such as wireless sensor networks. By exploiting the transmission relationship between heterogeneous nodes, we propose a selection cooperation protocol where inducing nodes can cooperate with the following nodes after their own transmissions for improving the communication reliability of the latter nodes. Through performance analysis, we show an interesting feature that the diversity-multiplexing tradeoff of the proposed protocol does not rely on the best relay selection method and the protocol always achieves the full diversity gain. We further develop an energy-efficient best relay selection method based on power control where the power consumption is minimized without decreasing the full diversity order. Simulation results demonstrate the good performance of the protocol and the remarkable energy reduction of the proposed best relay selection method.     

基于网络编码的无线网络分布式协作通信机制

 本文提出了一种基于无线网络编码的协作通信机制NCCC.无线网络编码能够在取得合作分集的性能增益的同时,降低网络中断概率.分布式中继节点选择算法是NCCC机制的核心,该算法根据即时信道状态,选择执行网络编码操作的最优中继节点.理论和仿真结果证明, NCCC机制可以提高无线网络双向多信源多信宿传输的性能和鲁棒性.