遥测系统中喷泉码的低延时改进算法

针对喷泉码应用于遥测系统时存在较大系统延时的问题,在对其延时特性进行分析的基础上,提出了一种改进的编译码算法.当编码器接收到部分数据符号时,按照预先制定的度选取策略和符号选取策略,选择当前编码符号的度和生成该编码符号的数据符号进行编码.该算法以减小编码延时为目标,通过分析编码符号发送速率的稳定性和可容忍的最长信号闪断时间可确定合理的编码延时.仿真得到了不同丢符号率下的编码延时、系统延时和所需的编码冗余,结果表明,与传统方案相比,改进方案的编码延时减小了一半以上.通过理论分析和仿真验证,得出了改进算法可明显减小基于喷泉码的遥测系统延时的结论.     

大容量光通信系统中规则LDPC码的研究

为研究规则LDPC码在大容量光通信系统的性能,对不同列重和不同迭代次数的短规则LDPC码在大容量光信道中的误码率性能进行了数据仿真。发现确定码长的规则LDPC码,存在最优的列重,使得在相同的冗余度时,最大程度地改善大容量光通信系统的性能;此外,误码率随迭代次数的增加具有收敛的特性,LDPC码译码时应合理地选取迭代次数。     

基于纠删码的遥测链路丢帧恢复技术

针对遥测系统在恶劣天气条件、航天器姿态调整、天线指向偏离、脉冲干扰等各种因素影响下出现的遥测信号闪断以至接收机丢帧问题,提出一种适用于闪断信道的纠删码技术,用于恢复丢失的数据帧.首先介绍LDPC（低密度奇偶校验）纠删码的编译码算法,然后构造一种以短码长的随机码为外码、IRA（不规则重复累积）LDPC码为内码的级联纠删码,最后给出纠删码的应用策略和实现纠删码所需的CCSDS（空间数据系统咨询委员会）协议扩展.通过仿真实验和分析,得到了LDPC纠删码和级联纠删码的纠删性能,得出级联纠删码与LDPC纠删码均可获得接近理想的纠删性能的结论,且级联纠删码的构造更为灵活,可适应不同的应用环境,对CCSDS协议进行适当扩展后即可支持纠删码在CCSDS遥测链路中的应用.     

认知无线电网络中的喷泉编译码技术研究

针对认知无线电网络（CRN）中授权信号时间和频率的不确定性导致CR用户工作频率甚至链路质量具有严重的时变性等特点,提出利用喷泉码的编解码技术解决上述问题。阐述了喷泉码的编解码原理,对喷泉码应用于认知无线电的系统性能进行了仿真分析．仿真结果表明．由于喷泉码无需反馈以及编解码复杂度低的特性,在CRN网络的时变信道环境下能实现链路维持,提高了系统的传输性能。     

TPC编码在高码率数传中的应用

介绍了TPC码(Turbo Product Code)研究的意义、TPC码在高码率数传中的应用前景以及高速TPC编码模块及译码模块设计,并给出了常用码长的TPC码的性能指标。TPC码在译码性能上能够非常接近香农门限,并具有较高的编码效率,同时算法复杂度较低,适合并行处理,易于用FPGA等器件实现,在高码率数传应用中具有广阔的应用前景。     

空间通信中的一种滑动窗口BATS码传输方案研究

针对空间通信中链路传播时延大、丢包率高、中继节点多的问题,在具有良好多级中继传输性能的BATS码基础上,提出一种滑动窗口传输方案,以提高空间传输的可靠性和时效性。利用小度值Batch对滑动窗口的非重叠区域进行编码传输,并采用不等滑动步长,实现了对滑动窗口的重叠部分和非重叠部分的均衡保护,使传输既具有较高可靠性,又具有较高的传输效率。仿真结果表明,在维持与传统的连续重叠滑窗相近可靠性的同时,传输效率提高约20%。     

航空通信系统中的LDPC编译码研究

低密度奇偶校验码(LDPC)是目前最优秀的码字之一,其接近香农传输极限的性能使其成为第五代通信系统(5G)唯一的数据信道编码。介绍了LDPC码的编译码原理和迭代译码结构,并对码长为4096,码率为1/2的LDPC码进行MATLAB仿真和FPGA工程实现。仿真结果和工程实现结果均表明:所选取的LDPC码实现简单,性能优异,对航空通信系统中信道编码的选取具有重要的指导意义。     

一种全速率协作通信系统传输方案

针对协作通信带来链路传输效率降低的问题,在译码转发中继方案的基础上,提出一种新的全速率协作通信传输方案。首先给出全速率协作通信系统的接收信号模型,并利用矩函数方法理论推导给出全速率协作通信系统最大似然接收机的链路成对差错概率及链路分集增益,理论分析表明：全速率协作通信传输方案可获得1符号/时隙的传输效率,且最大似然接收机可获取4重分集增益。计算机仿真结果证明理论分析的正确性。     

一种适用于FPGA的LDPC编码设计

与Turbo码相比,LDPC码有更好的性能和更低的解码复杂度,但其缺点是编码复杂。根据Richardson和Urbanke(RU)建议的编码方案,本文提出了一种适于在FPGA上实现的LDPC编码方案,其复杂度随码长呈线性增长。该方案可灵活应用于不同的校验矩阵H,码长和码率的系统中。     

Turbo乘积码编译码算法研究

介绍了基于Chase算法[1,3]的Turbo乘积码软入软出(SISO)迭代译码算法。对Turbo乘积码在加性高斯白噪声(AWGN)信道下的性能进行了仿真和分析,结果表明:Turbo乘积码译码复杂度较低,在编码效率较高时,仍具很好的译码性能。     

Achieving the capacity of half-duplex degraded relay channels using polar coding

In this paper, a novel transmission protocol based on polar coding is proposed for the half-duplex degraded relay channel. In the proposed protocol, referred to as the partial message relaying, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. Theoretically, it is proved that the scheme can achieve the capacity of the half-duplex relay channel under the decode-and-forward （DF） cooperation strategy while enjoying low encoding/decoding complexity. Practically, in order to minimize the global transmission power, the optimization of the power allocation is performed between the source and the relay by using information theoretic tools. Furthermore, a joint iterative soft parallel interference cancellation receiver structure is developed to suit to the proposed scheme. Simulation results show that the proposed scheme outperforms the conventional scheme designed by low-density parity-check （LDPC） codes.     

Generalized Feedback Decoding of Convolutional Codes

The use of convolutional codes with feedback decoding is a common error-correction technique in simple communication systems. A drawback of conventional feedback decoding is the limitation to a class of self-orthogonal codes which, in general, are nonoptimum. Based on distance properties of the utilized code and test-error pattern analysis, we propose generalized feedback decoding which does not have the abovementioned limitation. This is minimum distance decoding and can be applied to any convolutional code while still maintaining its simplicity. Therefore, it has the advantage of being easily adopted in existing systems. We can use the relatively complicated Viterbi or sequential decoders in larger terminals and, with the same code, use the proposed decoders in smaller terminals; otherwise, both large and small terminals must utilize the same type of decoder. The proposed decoding scheme could also be used to simplify and speed up sequential decoding. In addition, comparisons of the proposed decoder with other feedback decoders are presented.     

Cross-layer design of LT codes and LDPC codes for satellite multimedia broadcast/multicast services

According to large coverage of satellites, there are various channel states in a satellite broadcasting network. In order to introduce an efficient rateless transmission method to satellite multimedia broadcasting/multicast services with finite-length packets, a cross-layer packet transmission method is proposed with Luby transform （LT） codes for efficiency in the network layer and low density parity check （LDPC） codes for reliability in the physical layer jointly. The codewords generated from an LT encoder are divided into finite-length packets, which are encoded by an LDPC encoder subsequently. Based on noise and fading effects of satellite channels, the LT packets received from an LDPC decoder either have no error or are marked as erased, which can be mod- eled as a binary erasure channels （BECs）. By theoretical analysis on LT parameters and LDPC parameters, the relationships between LDPC code rates in the physical layer and LT codes word lengths in the network layer are investigated. With tradeoffs between the LT codes word lengths and the LDPC code rates, optimized cross-layer solutions are achieved with a binary search algorithm. Verified by simulations, the proposed solution for cross-layer parameters design can provide the best transmission mode according to satellite states, so as to improve throughput performance for satellite multimedia transmission.     

High Hardware Utilization and Low Memory Block Requirement Decoding of QC-LDPC Codes

This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check (QC-LDPC) codes, which not only achieves high hardware utility efficiency (HUE), but also brings about great memory block reduction without any performance degradation. The main idea is to split the check matrix into several row blocks, then to perform the improved message passing computations sequentially block by block. As the decoding algorithm improves, the sequential tie between the two-phase computations is broken, so that the two-phase computations can be overlapped which bring in high HUE. Two overlapping schemes are also presented, each of which suits a different situation. In addition, an efficient memory arrangement scheme is proposed to reduce the great memory block requirement of the LDPC decoder. As an example, for the 0.4 rate LDPC code selected from Chinese Digital TV Terrestrial Broadcasting (DTTB), our decoding saves over 80% memory blocks compared with the conventional decoding, and the decoder achieves 0.97 HUE. Finally, the 0.4 rate LDPC decoder is implemented on an FPGA device EP2S30 (speed grade -5). Using 8 row processing units, the decoder can achieve a maximum net throughput of 28.5 Mbps at 20 iterations.     

Further studies on efficient AFEC schemes for Ka-bandsatellite systems

Adaptive fade margin is required to counter the severe but varying rain attenuation in Ka satellite communications. In searching for a suitable rain countermeasure, the effectiveness of the adaptive forward error control (AFEC) scheme is studied. Two AFEC schemes using convolutional codes and concatenated codes are proposed and their performance analyzed. The schemes can provide a progressively adaptive fade margin of 10.1 and 10.4 dB, respectively, in excess of the systems fixed fade margin. To improve the efficient use of shared resources of the system, an AFEC scheme using double coding is introduced, and its performance is analyzed. In this scheme a single codec is used repeatedly, and as a result the hardware cost is reduced and the utilization increased. The effective usable capacity of a conceptual AFEC resource sharing scheme using Golay double coding is also analyzed     

适用于空间通信的LDPC码GPU高速译码架构

鉴于目前空间通信对高速、可重配置信道译码器的需求,利用图形处理器(GPU)的并行化运算特点,提出了一种低密度奇偶校验(LDPC)码软件高速译码架构。通过优化Turbo消息传递译码(TDMP)算法节点更新运算线程块内和块间并行度、减少非规则行重造成的线程分支、降低线程对节点更新信息存储资源的访问延时以及合理量化译码器存储信息来提升译码内核函数的执行效率。并在此基础上引入异步统一计算设备构架(CUDA)流处理机制,设计优化的译码器输入输出数据传输和内核函数之间的执行调度方式以及CUDA流上的译码线程资源配置方式,最大化译码吞吐率的同时降低译码延时。在Nvidia最新的Tesla K20和GTX980平台上对国际空间数据系统咨询委员会(CCSDS)遥测标准LDPC码进行的TDMP译码实验结果表明,本架构进行10次迭代译码的吞吐率最高可达约500 Mbps,平均译码延时约为2ms左右。与现有结果相比,本架构在保持软件架构配置灵活性的同时更加有效的兼顾了译码吞吐率和延时性能。     

Computer Algorithm for Coding Gain

Coding gain is described as used in space communications engineering, and an empirical formula for coding gain is presented. The formula is designed to fit available performance data for Viterbi soft-decision decoding of various nonsystematic convolutional codes and to have a functional form suitable for computer implementation.