一种新型自适应网络编码协作方案

自适应网络编码协作技术,将网络编码和跨层设计的概念引入到了用户协作中来,在利用低密度奇偶校验码的编码结构的基础上,改善了无线通信系统的性能。从低密度奇偶校验码的校验矩阵结构出发,通过充分利用中继过程中各个用户得到的信息,改良了接收端所形成的等效编码校验矩阵的结构,提出了一种新型自适应网络编码协作方案。其性能分析和仿真结果表明,在基本不提高系统开销的前提下,该方法实现了性能的进一步提升。     

协作通信网络中的合作编码技术

未来觅带无线通信系统要支持高达1 Gb／s的峰值无线传输速率,就必须考虑利用协作通信技术,充分复用频率、时间、空间等多维资源,改善网络覆盖性能。合作编码将协作信号处理和信道编码技术有机地结合在一起,是实现高性能合作通信的重要保障,合作编码将成为未来觅带无线通信技术的一项关键技术。合作编码技术必须适应节点的双工或半双工通信方式,采用适应不同的协同通信网络环境要求的合作编码技术方案。未来的合作编码技术的发展方向是自适应的合作编码技术和网络编码协作技术。     

协同通信中的分布式线性疏散码

该文提出一种分布式线性疏散码解决无线网络中协同节点不能确定时的空时编码问题。参与协同的节点采用独立的疏散矢量进行编码,推导协同节点减少时分布式线性疏散码的互信息损失,并以此建立一种分布式疏散码的编码准则。仿真结果验证了这种分布式线性疏散码的误比特性能及编码准则的可行性。     

无线Mesh网络中网络编码的文件共享模型

网络编码的基本思想是网络节点不仅参与数据转发,还参与数据处理,可大幅提高网络性能。传统文件传输系统存在文件分发时间的"瓶颈"问题,为此,提出一种在无线Mesh网络中网络编码的简化文件共享模型,采用理论分析和实验仿真的方法,研究节点间的4种合作机制。结果表明,在总分发时间上,基于网络编码转发机制比无网络编码的转发机制平均减少11.67%,显著地降低了文件传输系统的分发时间,从而提高了网络的吞吐量。     

基于Turbo码的机会编码协同策略

提出一种多中继协同无线网络的机会编码协同策略,该策略基于Turbo编码,利用信道条件信息机会选择最优协同节点。通过数学分析,给出了系统中断性能和瑞利衰落下的中断概率表达式,计算机仿真结果进一步揭示了机会编码协同相对于传统编码协同的优势。     

Space-time bit-interleaved coded modulation for OFDM systems

Space-time coding techniques significantly improve transmission efficiency in radio channels by using multiple transmit and/or receive antennas and coordination of the signaling over these antennas. Bit-interleaved coded modulation gives good diversity gains with higher order modulation schemes using well-known binary convolutional codes on a single transmit and receive antenna link. By using orthogonal frequency division multiplexing (OFDM), wideband transmission can be achieved over frequency-selective fading radio channels without adaptive equalizers. In this correspondence, we combine these three ideas into a family of flexible space-time coding methods. The pairwise error probability is analyzed based on the correlated fading assumption. Near-optimum iterative decoders are evaluated by means of simulations for slowly varying wireless channels. Theoretical evaluation of the achievable degree of diversity is also presented. Significant performance gains over the wireless local area network (LAN) 802.11a standard system are reported.     

基于SWIPT的Polar编码协作码的设计与系统性能研究

极化（Polar）编码协作可同时获得编码增益与分集增益,实现可靠通信。为了解决中继能量受限问题,本文研究了基于无线信息与能量同传（Simultaneous Wireless Information and Power Transfer, SWIPT）技术的Polar编码协作系统。首先,建立了基于SWIPT的Polar编码协作系统模型。其次,鉴于Polar码的Plotkin构造方法将一个长码分裂成两个短码,非常适用于编码协作场景,使用Plotkin构造方法联合设计信源节点和中继节点Polar码,并在目的节点对其进行联合串行相消（Successive Cancellation, SC）译码。相比传统点对点系统,基于SWIPT的Polar编码协作系统使得系统中断概率大幅度降低;与随机低密度奇偶校验（Low Density Parity Check, LDPC）编码协作系统相比,在译码迭代次数低时所提方案误码性能更佳。      

Interference‐resistant cooperative wireless networks based on complementary codes

Spatial diversity in wireless networks can be attained by exploiting the broadcast nature of wireless transmission without the need of multiple antennas in individual device, leading to the implementation of cooperative communication. While most prior works focused on the single source—destination scenario, it should be more realistic to consider how to induce cooperation among multiple source‐destination pairs assisted by multiple relays. In such a case, multiple access interference (MAI) may present due to asynchronous transmissions of the users and relays. In this paper, a cooperative network architecture based on orthogonal complementary (OC) codes inherently immune to MAI is proposed. To efficiently utilize the scarce radio spectrum and codes, a centralized medium access control (MAC) protocol is proposed to coordinate the code assignment and channel access among users and relays. We theoretically analyze the bit error rate (BER) performance of the proposed OC coded cooperative network over multipath Rayleigh fading channel. The performance gain resulted from different numbers of relays is investigated, and compared with a time division multiple access (TDMA) based cooperative scheme. We show that the proposed OC coded cooperative network performs well in the presence of timing offset, and thus is well suited for asynchronous uplink transmission with cooperative relaying. Copyright © 2009 John Wiley & Sons, Ltd.     

Network‐coded MIMO‐NOMA systems with FEC codes in two‐way relay networks

This paper assumes two users and a two‐way relay network with the combination of 2×2 multi‐input multi‐output (MIMO) and nonorthogonal multiple access (NOMA). To achieve network reliability without sacrificing network throughput, network‐coded MIMO‐NOMA schemes with convolutional, Reed‐Solomon (RS), and turbo codes are applied. Messages from two users at the relay node are network‐coded and combined in NOMA scheme. Interleaved differential encoding with redundancy (R‐RIDE) scheme is proposed together with MIMO‐NOMA system. Quadrature phase‐shift keying (QPSK) modulation technique is used. Bit error rate (BER) versus signal‐to‐noise ratio (SNR) (dB) and average mutual information (AMI) (bps/Hz) versus SNR (dB) in NOMA and MIMO‐NOMA schemes are evaluated and presented. From the simulated results, the combination of MIMO‐NOMA system with the proposed R‐RIDE‐Turbo network‐coded scheme in two‐way relay networks has better BER and higher AMI performance than conventional coded NOMA system. Furthermore, R‐RIDE‐Turbo scheme in MIMO‐NOMA system outperforms the other coded schemes in both MIMO‐NOMA and NOMA systems.     

Optimum subpacket transmission for hybrid ARQ systems

Hybrid automatic-repeat-request (ARQ) is a flexible and efficient technique for data transmissions. In hybrid ARQ, subpacket schemes are more attractive for systems with burst errors than complete packet schemes. Although subpacket schemes were proposed in ARQ systems, optimum subpacket transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes have properties of burst errors in decoding, the optimum subpacket can be applied to convolutional codes. This paper investigates the performance of subpacket transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of subpackets, and adaptive subpacket schemes, i.e., schemes that enable a system to employ different optimum numbers of subpackets under various conditions, are suggested to achieve the maximum throughput of the system. Numerical and simulation results show that the adaptive subpacket scheme is very effective for the convolutionally coded hybrid ARQ system, and it can provide higher throughput, smaller delay,and lower dropping rate than complete packet schemes. Moreover, the adaptive subpacket scheme can be flexibly used with packet combining techniques to further improve the system throughput.     

Minimum-cost multicast over coded packet networks

We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.     

Information Theoretic Foundations of Adaptive Coded Modulation

In wireless/mobile communications, terminals adapt their rate and transmit power or, more in general, their coding and modulation scheme, depending on the time-varying channel conditions. This paper presents, in a tutorial form, the information theoretic framework underlying such ldquoadaptive modulationrdquo techniques. First, we review fading channel models, channel state information assumptions, and related capacity results. Then, we treat the case of input power constraint, where the optimal input distribution is Gaussian. Finally, we address the case of discrete modulations. In order to treat the latter, we make use of the recently developed method of ldquomercury-waterfillingrdquo, based on the relationship between mutual information and minimum mean-square error (MMSE) estimation of the channel input from the channel output. While the traditional design of adaptive modulation schemes based on uncoded bit-error rate (BER) involves the optimization over a discrete set of signal constellations, when powerful (i.e., capacity approaching) coding schemes are used the corresponding adaptive coded modulation design becomes surprisingly simple. The regime of very powerful coding is justified by the use of modern coding schemes, such as turbo codes and low-density parity-check codes, able to perform close to channel capacity at very small BER.     

Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks

We consider large-scale wireless sensor networks with η nodes, out of which κ are in possession, (e.g., have sensed or collected in some other way) κ information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the η nodes stores one (possibly coded) packet so that the original κ source packets can be recovered, locally and in a computationally simple way from any κ(1 + ϵ) nodes for some small ϵ > 0. We develop decentralized Fountain codes based algorithms to solve this problem. Unlike all previously developed schemes, our algorithms are truly distributed, that is, nodes do not know η, κ or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables.     

Bandwidth- and power-efficient routing in linear wireless networks

The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and N-1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of O(logN) are achievable over linear wireless networks even without synchronous cooperation.     

基于多维乘积码的编码协作方案研究

多维乘积码是一种成熟的编码技术,其性能较好,且具有灵活的多维结构。本文提出一种基于多维乘积码的协作方案,利用不同维数的校验位进行协作,达到获取分集增益的目的。文中以分量码为扩展汉明码的多维乘积码为例,在慢衰落、快衰落瑞利信道下进行了理论性能分析和计算机仿真,仿真结果显示:慢衰落信道下,BER为10-3时,协作程度为50%,用户间信道SNR大于10dB时,增益大于8dB;在快衰落信道下,可以通过该协作方案可达到帮助上行信道较差的用户的目的。从实用性和良好性能的角度来看,该编码协作将具有较好的应用前景。      

Joint design of QC-LDPC codes for coded cooperation system with joint iterative decoding

In this paper, we investigate joint design of quasi-cyclic low-density-parity-check (QC-LDPC) codes for coded cooperation system with joint iterative decoding in the destination. First, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then we describe two types of girth-4 cycles in QC-LDPC codes employed by the source and relay. In the equivalent parity-check matrix corresponding to the jointly designed QC-LDPC codes employed by the source and relay, all girth-4 cycles including both type I and type II are cancelled. Theoretical analysis and numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded non-cooperation under the same conditions. Furthermore, the bit error rate performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.     

Optimal Pricing and User Cooperation for Utility-Efficient Wireless Powered Communications

Wireless Personal Communications - In this study, optimal pricing and user cooperation schemes are considered in a wireless powered communication network (WPCN), where multiple users harvest energy...     

极化码混合自动请求重传技术综述

极化码在有限码长下具有优异的性能,被3GPP采纳为5G控制信道编码方案。Beyond 5G(B5G)及6G对通信系统的可靠性和频谱效率有着更高的要求,需要解决逼近信道容量极限,提高系统性能的问题。为应对这一挑战,需要以极化码为基础,研究面向数据信道的极化编码传输技术。面对B5G及6G对通信系统的更高要求,总结了极化编码的链路自适应技术框架,介绍了几种典型的极化编码混合自动请求重传(Polar-Coded HARQ)技术方案。从性能、吞吐率、灵活性和复杂度等角度,对各种方案的优势与不足进行了综合对比。相较于传统HARQ方案,这些基于极化编码的新型HARQ方案能够显著提高无线传输性能,满足6G移动通信系统需求。归纳总结了极化编码HARQ的关键技术及未来研究方向,旨在为进一步研究提供有益的参考。     

一种基于网络编码协作的高能效无线传感器网络机制

Energy-efficient communications is crucial for wireless sensor networks (WSN) where energy consumption is constrained. The transmission and reception energy can be saved by applying network coding to many wireless communications systems. In this paper, we present a coded cooperation scheme which employs network coding to WSN. In the scheme, the partner node forwards the combination of the source data and its own data instead of sending the source data alone. Afterward, both of the system block error rates (BLERs) and energy performance are evaluated. Experiment results show that the proposed scheme has higher energy efficiency. When Noise power spectral density is -171dBm/Hz, the energy consumption of the coded cooperation scheme is 81.1% lower than that of the single-path scheme, 43.9% lower than that of the cooperation scheme to reach the target average BLER of 10-2. When the channel condition is getting worse, the energy saving effect is more obvious.     

Impact of Implicit Feedback Channel in Cooperative Relay Networks

In a multi-node network, cooperation among nodes is an effective means to enhance coverage and potentially increase the capacity. For such systems, schemes based on incremental relaying have great potential to improve the spectral efficiency by adapting the transmission to time varying channel conditions. The performance enhancement brought about by the presence of relays in such incremental relaying based cooperative systems is dependent on the level of cooperation (based on the relay information quality) and on coordination among the nodes. Coordination is achieved through the use of feedback channels, which incurs significant bandwidth penalty and brings down the spectral efficiency. In order to mitigate this, one can exploit an implicit feedback channel available due to broadcast nature of relay transmissions. Instead of using dedicated feedback channels, the implicit feedback channel is used to measure the relay information quality. Based on this information, the transmitter (source/relay) for the additional coded (redundancy) bits is determined. Such a mechanism enhances the reliability as it ensures the availability of correct information at the destination node for decoding. This paper studies the impact of such an implicit feedback channel by employing powerful codes which exhibit inherent incremental redundancy features, such as rate-compatible codes (rate-compatible punctured convolutional (RCPC) codes and punctured low-density parity-check (LDPC) codes) and rateless codes (Luby Transform (LT) codes). Theoretical analyses of the proposed scheme are presented, and supported with results from extensive simulation studies.