多维量子超密编码可控信息传输

在量子信息传输过程中应减少作为量子信道的粒子数并尽量增加传输的信息,保证传输过程的安全和对传输信息过程进行有效控制,提出了多维量子编码的可控信息传输方案。首先Alice要和Bob对编码的信息制定一个规范,然后,Alice对粒子做幺正变换,接受者Bob对接收到的粒子进行测量,并根据控制者Charlie发来的测量信息就可以知道Alice要传输的信息,这种量子信息传输要传输粒子少,而且有一个控制者可对传输过程进行控制,所以易于实现,而且保证安全。     

无线异构网络中的低复杂度分级视频传输技术

针对无线异构网络中进行视频无线传输遇到的网络拥塞、传输丢失等问题,提出了低编码复杂度分级编解码传输方案,基于逐级优化理论和可分级编码理论,设计了视频分级编码策略:利用小波变换后的不同分解层不同子带构成基本层(Base Layer,BL)和三个增强层,获得了码率分级和质量分级的特性.实验结果证明,随着不同层的更新,视频分级系统的解码质量和整体率失真性能都逐级改善.该传输方案实现了在信道条件动态变化的无线网络环境下仍能流畅传输并接收到有用信息,适用于信道条件不稳定的无线异构网络.     

基于SVC网络多媒体系统客户端软件设计

提出了一种在局域网中,利用TS流对基于SVC的多媒体数据进行传输的应用方案.利用DirectShow开发了客户端软件和SVC解码过滤器.通过网络接收多媒体数据,进行解复用、解码,最终实现播放.测试结果表明,系统播放流畅,音视频同步效果较好.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

基于可信控制中心的量子密钥中继方案

提出了一种利用可信控制中心以及可信量子中继服务器进行量子密钥中继传输的实现方案。在设计可信中继点协议上采用了量子密钥一次一密的加密算法,在组建可信中继网络时,利用可信控制中心来保证接入中继的可信性与安全性,并把用户地址隐藏于已加密的量子信息数据中,只有合法的可信用户才能解密并进行信息传输。实验结果表明,用户之间即使没有量子信道直接相连,仍然可以利用可信中继网络进行量子密钥长距离的安全传输,该量子密钥中继方案是可行的。安全性分析表明,在传输过程中,攻击者无法获取到真正有用的量子密钥信息。     

N个接收方的同时密集编码协议

针对当前同时密集编码中接收方数量受限问题,通过引入n比特量子傅里叶变换,提出了具有多个接收方的非受控和受控同时密集编码协议。在非受控多方同时密集编码协议中,发送方在待传粒子上执行编码以及加锁操作,接收方只有联合执行解锁操作,才能同时获得最终的编码信息;在受控多方同时密集编码协议中,只有全体接收者在控制者的允许下通过协作才能完成信息的传输。通过对内部和外部攻击进行了分析,证实了同时密集编码协议的安全性。此外,所提出的方案中只使用Bell基测量,在实验条件下容易实现。     

量子移动互联通信传输及路由协议研究

构建了量子无线通信网络模型,通过中继点两端量子信道的建立获得源端所发出的信息,实现多级量子无线网络信息的传输;基于经典认证,采用量子隐形传态和纠缠交换技术传输携带信息的量子态,实现了无线通信网络的身份认证;结合Grover量子搜索算法,在限定跳数内搜索路由度量最大的路径作为目标解径,避免了量子信道因纠缠量子对的消耗而断开,保证了成功率,降低了量子通信网络的计算量,使路由搜索快速收敛.     

基于循环码和信息压缩融合的量子保密通信算法

针对经典保密通信中信息安全传输的问题,提出了一种基于循环码和信息压缩的量子保密通信算法。首先,发送端对传输的信息进行预处理,将其分割为长度不等的2组数据,分别用于循环编码和压缩编码。然后,发送端添加一串量子态传输至接收端,采用误码数作为信道安全检测的依据,若信道安全,则对预处理后的数据量子态处理,利用量子稳定子码编码分段并传输,依据稳定字码的特性克服环境引起的误码。最后,接收端接收到量子信息后进行解码,并解循环和解压缩从而获得数据。安全性分析表明,所提量子保密通信算法能较好地抵抗篡改和截断信息的攻击。仿真结果表明,对于数据压缩部分按5分段能获得较好的效果。     

基于身份认证的安全量子中继器网络编码方案

本文将量子一次一密通信方法引入到量子中继器网络中,提出了基于身份认证的安全量子中继器网络编码方案.针对编码过程中存在的主动攻击问题,用一次一密的方式实现任意相邻节点通信过程中的身份认证,优化编码算法,最终在源节点与目的节点间生成量子纠缠态作为信道,构成量子隐形传态网络.方案分析表明,这种方案可以实现高可靠性、高安全性的远程量子通信.     

基于PSK的非对称物理层网络编码

在非对称的双向中继传输中,传统的基于比特异或的网络编码方案并不能取得最好的性能。一个简单的例子就可以说明传统的补零异或方案的缺陷,而导致这种缺陷的原因是设计自由度的缺乏。一种基于PSK的网络编码方案,配合解调前解码的方案,能够取得良好的性能,并且大大的简化非对称物理层网络编码方案的设计。而且这种方案能够方便的被用于有信道编码的系统,仅仅给系统带来少量的额外负担。     

Secret Error Control Codes Against Malicious Attacks in Random Multisource Network Coding

This paper investigates the problem of constructing a secret error-correcting multisource network coding scheme against an adversary that can re-select the μ tapping links in different time slice and inject z erroneous packets into network, and the network suffers from ρ packet erasures. In our network scenario, multiple sources transmit information to one or more receivers and these receivers request the information from all the sources. Firstly, a necessary condition is derived for keeping the transmitted information from multisource nodes are secret from the eavesdropper, while the network is only subject to the eavesdropping attack. Subsequently, we provide two multisource network coding schemes for error and erasure correction which can decode the transmitted information correctly. After that, a secret and reliable multisource network coding is proposed. This scheme can retrieve the original information secretly and accurately from the corrupt and deficient information. Meanwhile, it can obtain an asymptotic achievable rate of k ? 2z ? ρ ? 3μ. Moreover, the intermediate nodes are oblivious to the concrete encoding and decoding algorithms implement in source and destination nodes. Finally, security and performance analyses illustrate the advantages of our proposed scheme.     

A Network Coding Approach to Cooperative Diversity

This paper proposes a network coding approach to cooperative diversity featuring the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two ldquopartnersrdquo - node A and node B - cooperate in transmitting information to a single destination; each partner transmits both locally generated information and relayed information that originated at the other partner. A key observation is that node B already knows node A's relayed information (because it originated at node B) and can exploit that knowledge when decoding node A's local information. This leads to an encoding scheme in which each partner transmits the algebraic superposition of its local and relayed information, and the superimposed codeword is interpreted differently at the two receivers i.e., at the other partner and at the destination node, based on their different a priori knowledge. Decoding at the destination is then carried out by iterating between the codewords from the two partners. It is shown via simulation that the proposed scheme provides substantial coding gain over other cooperative diversity techniques, including those based on time multiplexing and signal (Euclidean space) superposition.     

Matrix Coded Modulation: A New Non-coherent MIMO Scheme

This paper describes a new space-time coding scheme for non-coherent multi-antenna multi-input multi-output (MIMO) systems. This new MIMO scheme merges error-correcting and space-time coding functions by transmitting invertible matrices, so this scheme has been called “Matrix Coded Modulation” or “MCM”. Coherent systems require channel state information (CSI) at the transmitters and/or at the receivers, and their performances strongly depend on the channel estimation. For example, in systems using Orthogonal frequency division multiplexing, the channel estimation requires the insertion of pilot-symbols in the transmitted frame which implies a spectral efficiency loss of the global system that increase with the number of transmit antennas. The existing non-coherent schemes such as the differential space-time modulation leads to performance degradation compared to coherent systems in which perfect CSI is assumed. Decoding in the MCM scheme is performed iteratively, based on a specified detection criteria. In the proposed MCM scheme, decoding can be achieved with or without CSI at the receiving antennas. As the space-time coding function is merged with the error-correcting code, the euclidean distances distribution between modulated signals based on the detection criteria is strongly linked to the Hamming weights distribution of the channel error-correcting code used in the MCM scheme. Moreover, a low-complexity decoding algorithm is described and compared to the existing differential schemes.     

适合TCP的网络编码重传机制

通过理论分析,看出基于反馈的重传方法比定量重传的方法有更低的解码延迟。提出了一种新型的基于反馈的网络编码(FNC)重传机制,利用seen机制中的隐含信息来获取接收方解码所需的重传分组个数,并改变了编码规则使部分分组可以提前解码。该机制不仅可以处理有固定误码率的随机分组丢失,还可以有效地应对大量突发性分组丢失。仿真结果显示,该机制在高误码率下也能保持较高的吞吐量,且极大地减少了解码延迟,传输过程基本不受分组丢失的影响,有效地对拥塞控制协议隐藏了链路错误。算法简单有效,更适于在实际系统中应用。     

Performance analysis for collaborative decoding with least-reliable-bits exchange on AWGN channels

Collaborative decoding is an approach that can achieve diversity and combining gain by exchanging decoding information among a cluster of physically separated receivers. On AWGN channels, the least-reliable-bits (LRB) exchange scheme can achieve performance close to equal-gain combining (EGC) of all received symbols from all receivers, while reducing the amount of information that must be exchanged. In this paper, we analyze the error performance of collaborative decoding with the LRB exchange scheme when nonrecursive convolutional codes are used. The analysis is based on the observation that the extrinsic information generated in the collaborative decoding of these convolutional codes can be approximated by Gaussian random variables. A density-evolution model based on a single maximum a posteriori decoder is used to obtain the statistical characteristics of the extrinsic information. With the statistical knowledge of the extrinsic information, we develop an approximate upper bound for the error performance of the collaborative decoding process. Numerical results show that our analysis gives very good predictions of the bit error rate for collaborative decoding with LRB exchange. At high signal-to-noise ratios collaborative decoding with properly chosen parameters can achieve the same error performance as EGC of all received symbols from all receiving nodes.     

基于APD接收机的LDPC精确译码算法

从研究APD光电检测接收机被检测光场的量子统计模型出发,构造了一种适用于强度调制/直接检测的自由空间光通信系统中LDPC译码的精确实现方法.该方法在APD接收机输出统计模型(Webb-Gaussian模型)的基础上,推导了M-PPM的LDPC译码算法中初始似然比值的精确计算方法,并给出了详细的译码过程.理论分析和仿真结果表明,与目前普遍采用的APD近似非对称Gaussian统计模型下的译码性能相比较,在相同的信道条件下,该方法可以获得大约1~2 dB的性能增益.这为进一步提高自由空间光通信系统的性能提供了一定的理论依据.     

Combining network coding and compressed sensing for error correction in wireless sensor networks

As the spatial and temporal correlations of sensor readings are common in wireless sensor networks, motivated by these features and the drawbacks of network coding (NC), we introduce compressed sensing (CS) into NC scheme and construct a cooperating coding mechanism, which performs over different data fields with a compatible transformation measure for the combination of NC and CS. This cooperating coding scheme can reduce the amount of redundant information transmission significantly, because the temporal and spatial correlations are explored fully. Meanwhile, the erasures and errors are considered simultaneously in relay transmission process; a NC decoding for error control is proposed to correct the erasures and errors. Although the decoding error of NC is existent, this error can be further reduced by the reconstruction process of CS; as a result, the relative recovery error is small enough in the sink. Finally, the reliability and performance analyses confirm that the proposed cooperating coding scheme obtains considerable compression gain as compared with conventional coding scheme of NC and transmits information reliably with high recovery precision. Copyright © 2014 John Wiley & Sons, Ltd.     

Matrix Coded Modulation: A New Non-coherent MIMO Scheme

This paper describes a new space-time coding scheme for non-coherent multi-antenna Multi-Input Multi-Output (MIMO) systems. This new MIMO scheme merges error-correcting and space-time coding functions by transmitting invertible matrices, so this scheme has been called “Matrix Coded Modulation” or “MCM”. Coherent systems require Channel State Information (CSI) at the transmitters and/or at the receivers, and their performances strongly depend on the channel estimation. For example, in systems using Orthogonal Frequency Division Multiplexing, the channel estimation requires the insertion of pilot-symbols in the transmitted frame which implies a spectral efficiency loss of the global system that increase with the number of transmit antennas. The existing non-coherent schemes such as the Differential Space-Time Modulation leads to performance degradation compared to coherent systems in which perfect CSI is assumed. Decoding in the MCM scheme is performed iteratively, based on a specified detection criteria. In the proposed MCM scheme, decoding can be achieved with or without CSI at the receiving antennas. As the space-time coding function is merged with the error-correcting code, the euclidean distances distribution between modulated signals based on the detection criteria is strongly linked to the Hamming weights distribution of the channel error-correcting code used in the MCM scheme. Moreover, a low-complexity decoding algorithm is described and compared to the existing differential schemes.     

Reduce the decoding complexity： segment linear network coding

The throughput gain obtained by linear network coding （LNC） grows as the generation size increases, while the decoding complexity also grows exponentially. High decoding complexity makes the decoder to be the bottleneck for high speed and large data transmissions. In order to reduce the decoding complexity of network coding, a segment linear network coding （SLNC） scheme is proposed. SLNC provides a general coding structure for the generation-based network coding. By dividing a generation into several segments and restraining the coding coefficients of the symbols within the same segment, SLNC splits a high-rank matrix inversion into several low-rank matrix inversions, therefore reduces the decoding complexity dramatically. In addition, two coefficient selection strategies are proposed for both centrally controlled networks and distributed networks respectively. The theoretical analysis and simulation results prove that SLNC achieves a fairly low decoding complexity at a cost of rarely few extra transmissions.