下一代移动通信中的空时编码技术

为了满足下一代移动通信的要求，提出一种结合分集发送、调制和编码的空时编码技术。为此介绍了空时码的原理以及空时分层编码、空时栅格编码和空时分组编码的编译码方案，以及分析了空时编码在IMT-2000、OFDM等下一代移动通信系统中的应用前景等。     

ESAS—功能强大的大区联网集群系统

本文分析了ＥＳＡＳ集群系统的信令格式，硬件结构和软件特点，并介绍了该系统灵活的组网特性，丰富的移动台功能和广域调度功能等。     

A Low Complexity Decoding Algorithm for STBC under Non-Constant Module Modulation

This paper presents a low complexity algorithm for the decoding of space-time block codes （STBC） under non-constant module modulation. Simulation results show that in most cases of non-constant module modulation the new algorithm results in more than 50% reduction in computation complexity comparing to the original maximum likelihood algorithm without any loss of BER performance.     

第三代移动通信系统中的软件无线电

阐述了软件无线电的发展动态、基本结构,分析了其关键技术,并对第三代移动通信系统中软件无线电技术的应用和发展作了初步的探讨。     

On the impact of IQI on cooperative NOMA with direct links in the presence of imperfect CSI

Cooperative non-orthogonal multiple access (CNOMA) is considered as a promising technique to improve network coverage, reliability and transmission for future wireless communication networks. Meanwhile, transceivers can suffer from a number of hardware imperfections that will significantly reduce their performance, such as phase noise and in-phase/quadrature-phase imbalance (IQI). In this paper, we investigate the effect of in-phase and quadrature-phase imbalance (IQI) on CNOMA with direct links in the presence of imperfect channel state information (ICSI). The outage probability (OP) and throughput expressions are derived to evaluate the performance behaviors of the CNOMA with direct links under the IQI and ICSI imperfections. Theoretical analyzes are verified by Monte Carlo simulation. The effect of the IQI on the CNOMA with the direct links has been studied with different parameters (image rejection ratio (IRR), power allocation) and compared with conventional NOMA to clearly observe the degrading effects of imperfections on the systems. The simulation results demonstrate that the IQI and ICSI have a negative impact on the outage and throughput performance.     

Proportional fair scheduling using water-filling technique for SC-FDMA based D2D communication

The resource allocation in SC-FDMA is constrained by the condition that multiple subchannels should be allocated to a single user only if they are adjacent. Therefore, the scheduling scheme of a D2D-cellular system that uses SC-FDMA must also conform to the so-called adjacency constraint. This paper proposes a heuristic algorithm with low computational complexity that applies proportional fair (PF) scheduling in the D2D-cellular system. The proposed algorithm consists of two main phases: (i) subchannel allocation and (ii) adjustment of data rates, which are executed for both CUEs and DUEs. In the subchannel allocation phase for CUEs (or D2D pairs), the users’ data rates are maximized via optimal power allocation to frequency-contiguous subchannels. In the second phase, a PF scheduling problem is solved to decide the modulation and coding scheme (MCS) of both CUEs and D2D pairs. Both phases of the proposed algorithm benefit from the Water-Filling (WF) technique. The simulation results suggest that the proposed scheme performs similar to optimal PF scheduling from the perspective of users’ data rate and their logarithmic sum. An additional benefit of the proposed scheme is its low computational overhead.     

基于水声信道传播时延排序的分层空时信号检测

基于分层空时编码的多输入多输出技术是一种极具潜力的高速水声通信技术, 但要实现这种潜力需要复杂的空时信号处理方法, 以抵消来自水声信道的多径干扰和异步到达干扰, 以及叠加在接收端的各层信号之间的干扰. 对低复杂度的空时信号处理方案进行了研究, 提出了一种基于子信道传播时延排序的有序连续干扰抵消信号检测算法, 利用子信道间的传播时延差, 实现可使差错概率最小的最佳检测排序; 给出了利用信道估计, 以极低的计算量确定排序的方法, 从而可以大幅降低信号检测的计算复杂度. 采用低复杂度的单载波频域均衡来抵消水声信道中的码间干扰和异步到达干扰. 仿真结果表明, 基于时延排序的信号处理算法可以获得检测性能的改善, 而且性能增益在高数据率时更加显著. 研究结果表明, 采用有效的信号处理方法可使水声信道中造成信号检测干扰的传播时延成为改善系统性能的有利因素.     

一种分布式喷泉码在协作通信中的应用

为了减少基于数字喷泉码的协作传输系统中的计算复杂度和传输延迟,提出了一种基于分布式喷泉码的协作通信传输方案,给出了两层数字喷泉编码的度分布函数的设计过程;以各链路的丢包率为参量分析了系统传输时延,并与其他数字喷泉码传输方案进行了比较.理论分析和仿真结果表明,在各链路丢包率较大时采用这种分布式喷泉码的协作传输机制能在传输时延上显著改善系统性能,而且各链路删除概率越大时优势越明显.     

Incentive analysis for cooperative interactive multiview video streaming

In interactive multiview video streaming (IMVS), users can periodically select one out of many captured views available for observation. In single-view video streaming, cooperative strategies where peers share received packets of the same video have proven to be effective in reducing server׳s upload burden, and incentive mechanisms are designed to stimulate user cooperation. However, exploiting user cooperation in higher dimensional IMVS is difficult, since users watching different views makes it difficult to establish partnership, and users switching views frequently and independently makes it difficult to maintain partnership over time. In this paper, we use a multiview video frame structure for IMVS to support cooperative view-switching, where peers may help each other even if they are observing different views. We then model peers׳ interaction as an indirect reciprocity game, where each user is assigned a reputation level. To gain a higher reputation level, users help others, which in turn leads to a higher likelihood to receive others׳ help later. In this work, we focus on how view switching, the key feature of IMVS, affects user cooperation. By modeling users׳ decision making as a Markov decision process, our analysis shows that users tend to cooperate at some views but not others: given peers can predict their future view navigation paths probabilistically, for a peer who is likely to enter a view-switching path not requiring others׳ help, he also has less incentive to cooperate. Furthermore, we observe that the game may have multiple Nash Equilibria corresponding to different cooperation levels, e.g., users cooperate at all views in the full cooperation equilibrium, while users only cooperate at certain views in the partial cooperation equilibrium. The particular equilibrium the game will converge to depends on the initial cooperation level of the game. To stimulate user cooperation at all views, we propose a Pay-for-Cooperation (PfC) scheme at the beginning of the game to drive the game to the full cooperation equilibrium to improve system efficiency. Our simulation results show the effectiveness of PfC.     

Cross-layer optimization for 3-D video transmission over cooperative relay systems

The rate budget constraint and the available instantaneous signal-to-noise ratio of the best relay selection in cooperative systems can dramatically impact the system performance and complexity of video applications, since they determine the video distortion. By taking into account these constrained factors, we first outline the signal model and formulate the system optimization problem. Next, we propose a new approach to cross-layer optimization for 3-D video transmission over cooperative relay systems. We propose procedures for estimation of the end-to-end instantaneous signal-to-noise ratio using an estimate of the available instantaneous signal-to-noise ratios between the source–destination, and source–relay–destination before starting to send the video signal to the best relay and destination. A novel approach using Lagrange multipliers is developed to solve the optimum bit allocation problem. Based on the rate budget constraint and the estimated the end-to-end instantaneous signal-to-noise ratio, the proposed joint source–channel coding (JSCC) algorithm simultaneously assigns source code rates for the application layer, the number of high and low priority packets for the network layer, and channel code rates for the physical layer based on criteria that maximize the quality of video, whilst minimizing the complexity of the system. Finally, we investigate the impact of the estimated the end-to-end instantaneous signal-to-noise ratio on the video system performance and complexity. Experimental results show that the proposed JSCC algorithm outperforms existing algorithms in terms of peak signal-to-noise ratio. Moreover, the proposed JSCC algorithm is found to be computationally more efficient since it can minimize the overall video distortion in a few iterations.