分组级短码长LT喷泉码的工程应用

针对LT喷泉码在准单向链路、高差错、链路恶劣易中断的信道环境应用时出现的运算量大、译码时延长、编码效率较低等问题,文章提出使用基于数据分块的分组级短码长喷泉码方案。其思想是将短码长LT码方案和分组级LT码方案结合起来,并且在数据子块的度序列生成过程中加入度值检测机制。实验仿真结果表明:与已提出的LT码方案相比,该方案能够有效地降低译码开销、计算代价和译码时延,提高系统的最大传输效率。     

Efficient exhaustive search for optimal-peak-sidelobe binary codes

The work presented here describes an exhaustive search for minimum peak sidelobe level (PSL) binary codes, combining several devices for efficiency. These include combinatoric tree search techniques, the use of PSL-preserving symmetries to reduce search space, data representations and operations for fast sidelobe computation, and a partitioning scheme for parallelism. All balanced 64-bit minimum PSL codes are presented, and the upper limit on known consecutive lengths to have PSL = 4 codes is extended to 70. In addition, a technique for determining balance properties of a code for given PSL-preserving transformations is developed.     

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

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

网络系统的广播技术和广播算法

讨论了计算机网络系统中的广播问题,重点放在广播算法上。首先,介绍了广播的概念和广播技术在网络中的应用。然后介绍了几种广播算法,其中包括：独立发送分组法、多目的地址法、生成树算法、逆向路径转发算法和扩散法,并提出有效的扩散算法改进思想。最后给出这几种算法的模拟结果和可靠性分析。     

不含短环的（n，3，k）LDPC码的几何构造方法

提出了基于不含短环的(n,2,k)规则低密度奇偶校验(LDPC)码的一种最短环长为8的(n,3,k)规则LDPC码的几何构造方法。该方法简单直观而有效。仿真结果显示,在AWGN信道中该码具有明显优于随机构造的规则LDPC码的性能。     

FEC design for remote control and data transmission of aeronautic and astronautic vehicles

This paper focuses on the advanced Forward Error Correction(FEC) based on LowDensity Parity-Check(LDPC) codes for remote control and data transmission of Aeronautic and Astronautic Vehicles(AAV). It shows that the nontransparent LDPC codes with odd row weights are able to resist phase inversion with a small computational overhead. To the best of our knowledge, it is the first time to use FEC to resist phase inversion. Then, a high hardware-efficient FEC design for AAV, which is capable of correcting random errors as well as phase inversion, is proposed based on circulant decomposition with circulant size of 2s. Such a(4096, 2048) LDPC code has been adopted in a data transmission system due to its excellent error performance and hardware efficiency.     

GF(q)域上的低密度校验(LDPC)码的译码及其在深空通信中的应用

低密度校验码是一类能有效逼近香农限的好码,而高进制的LDPC码具有比二进制LDPC码更好的性能,但其译码复杂度太高不利于工程应用。本文提出了一种基于协同优化算法的低复杂度的高进制LDPC码的译码算法,并讨论了其在深空通信中的应用。     

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

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

Adaptive boosting for SAR automatic target recognition

The paper proposed a novel automatic target recognition (ATR) system for classification of three types of ground vehicles in the moving and stationary target acquisition and recognition (MSTAR) public release database. First MSTAR image chips are represented as fine and raw feature vectors, where raw features compensate for the target pose estimation error that corrupts fine image features. Then, the chips are classified by using the adaptive boosting (AdaBoost) algorithm with the radial basis function (RBF) network as the base learner. Since the RBF network is a binary classifier, the multiclass problem was decomposed into a set of binary ones through the error-correcting output codes (ECOC) method, specifying a dictionary of code words for the set of three possible classes. AdaBoost combines the classification results of the RBF network for each binary problem into a code word, which is then "decoded" as one of the code words (i.e., ground-vehicle classes) in the specified dictionary. Along with classification, within the AdaBoost framework, we also conduct efficient fusion of the fine and raw image-feature vectors. The results of large-scale experiments demonstrate that our ATR scheme outperforms the state-of-the-art systems reported in the literature     

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.     

TP-Satellite: A New Transport Protocol for Satellite IP Networks

As a result of the exponential growth of the worldwide Internet, satellite systems are used to support broadband Internet access. Existing TCP protocols perform very well for Internet access on wired networks. However, in the case of satellite channels, due to the effects of high bandwidth asymmetry, long propagation delay, high sporadic bit error rate (BER) and burst errors, TCP performance degrades significantly. In this paper, a new end-to-end transport protocol, TP-Satellite, is proposed for satellite IP networks. TP-Satellite replaces the traditional slow start algorithm with a novel super start algorithm. In order to distinguish congestion events from link errors, a new scheme is introduced, which is based on alternate transmission of different class priority packets. Bandwidth asymmetry problems are addressed by the adoption of a modified negative acknowledgement (M-NACK) strategy, which periodically sends M-NACK packets. Simulation results show that TP-Satellite enhances the throughput performance on the forward path, reduces the bandwidth used in the reverse path, and offers a fair share of network resources.     

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

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

Time-frequency hop codes based upon extended quadratic congruences

Time-frequency hop codes are developed that can be used for coherent multiuser echolocation and asynchronous spread spectrum communication systems. They represent a compromise between Costas codes, which have nearly ideal autoambiguity but not so good cross-ambiguity properties, and linear congruential codes, which have nearly ideal cross-ambiguity but unattractive autoambiguity properties. Extended quadratic congruential code words are shown to have reasonably good autoambiguity and cross-ambiguity properties across the whole class of code sets considered. A uniform upper bound is placed on the entire cross-ambiguity function surface, and bounds are placed on the position and amplitude of spurious peaks in the autoambiguity function. These bounds depend on the time/bandwidth product and code length exclusively and lead naturally to a discussion of the design tradeoffs for these two parameters. Examples of typical autoambiguity and cross-ambiguity functions are given to illustrate the performance of the new codes     

基于最小跳数的无线传感器网络跨层设计

传统的严格分层参考模型无法实现对无线传感器网络资源的有效管理和运用,跨层设计是提高网络整体性能的一种有效方法。针对无线传感器网络能量、计算资源、存储资源和带宽资源有限的特点,提出一种基于最小跳数的路由层和MAC层的跨层协议设计方案。MAC层和路由层通过共享sensor节点到sink节点的最小跳数信息,在MAC层建立时间梯度,解决多个节点共享无线信道的问题;并在路由层建立路由表,解决路由选择问题。仿真结果表明,该方案在降低网络能耗的同时,在降低传输延迟,提高数据投递率方面也取得了良好的性能。     

一种准循环低密度校验码部分并行编码结构设计

为了满足在一个系统中使用多码率低密度奇偶校验（LDPC）码字的需求,设计了一个多码率准循环LDPC（QC LDPC）码编码器;按照功能,将编码器分成输入缓存单元（ISU）、生成矩阵存储单元（GMSU）、矩阵乘法运算单元（MMU）以及输出缓存单元（OSU）4个主要组成部分;通过使用多个小块存储器组合的方式设计ISU可以使无效存储空间降到最低;通过分析各种码率生成矩阵特点,将矩阵进行分割,从而将各种码率生成矩阵所需要的信息存储在若干个存储单元中;MMU用于完成信息位与矩阵的乘法与求和运算,运算单元的数目和GMSU的数目相等;OSU中包括两个存储器,采用乒乓操作,以提高编码速率。通过管脚的选择,此编码器支持0.4, 0.6以及0.8码率3种编码模式。最后用Altera公司的现场可编程门阵列（FPGA）EP1S801508C7对编码器进行了实现。结果显示此编码器仅耗费5 339个逻辑单元,占FPGA总逻辑单元的7%,耗费439 296比特的存储器资源,占FPGA总存储器资源的6%。     

Cross-Correlation Interference Effects in Multiaccess Optical Communications

The effects of the cross correlation between user codes in an opticalcode-division multiple-access communication system are investigated. The system model is a multiaccess satellite repeater in which the uplink and downlink channels are direct-detection, optical-polarization modulation links. The error probability is derived in terms of the cross correlation between the intended and interfering user codes. It is shown that the system error rate can be minimized by using code sequences in which the normalized second moment of the cross correlation between codes is small. The signalto- noise ratio (SNR) on the uplink is shown to be proportional to 1/K while the SNR on the downlink is proportional to 1/K1/2, where K is the number of users which are simultaneously accessing the system.     

利用有限域上向量空间构作具有仲裁的认证码

利用有限域上向量空间的子空间构作了一个具有仲裁的认证码，计算了这个码的参数。当收方和发方的编码规则按等概率分布选取时，各种攻击成功的概率也被算出。     

利用非交错对称矩阵构造Cartesian认证码

利用特征为2的有限域上非交错对称矩阵构造了一个Cartesian认证码，并计算出其参数。进而，假定编码规则按照均匀的概率分布所选取，计算出了该码被模仿攻击成功的最大概率只和被替换攻击成功的最大概率Ps。     

绝对式恒光源24位光电轴角编码器在光电经纬仪上的应用

为满足某型光电经纬仪的使用要求,设计了某绝对式恒光源 24位光电轴角编码器分系统。该编码器采用 16位绝对式光学码盘,码盘刻划有粗码道、通圈码道、中精码道和精码道。精码道的线对数为 16 384(14位)。方位和高低编码器的处理电路设计在一块电路板上,采用一片 DSP为主机,6个读数头输出 64路码盘光电信号分别经放大整形、A/D转换输入至 DSP。DSP完成数据采集、细分、译码、校正等处理,把轴的转角变换成 24位自然二进制角度代码输出和上传。使用情况表明:该编码器的光机结构布局合理、性能稳定,电路板和元器件少、操作简单、测角精度高,满足某型光电经纬仪对于编码器系统的要求,具有较高的实用价值。     

Multidimensional particle codes: Their capabilities and limitations

Increasing the number of dimensions calls for significant changes in simulation techniques. Demand on computer time and space increases by orders of magnitude and hardware development affects the feasibility. Gridless and Fokker-Planck codes are possible in ID, but one needs grids and PIC codes in 2D and 3D. This imposes limits on Debye lengths, particle size and spacing, and on resolution. Non-spectral (local) E-M codes also suffer a Courant restriction on δt, in addition to the usual ω_p δt restriction. Spectral methods therefore have an advantage; they also permit convenient filtering, particle shaping and control of resolution. 2D and codes are well advanced and documented (4,5). 3D codes are in their infancy. Data management, rather than physics or numerical analysis, becomes the major problem (10). Machine-independent 3D codes are too limited in resolution and speed. Parallelism helps greatly but makes the 3D codes machine-dependent. A present-day limit is attempted in a 2*128**3 grid code for CRAYs which process ∼ 5 million particles in ∼ 2 minutes per time step. Layering is employed to break up the 3D problem into many 2D problems. Fields and particles are packed and buffered in and out of core. Diagnostics are limited by the large volume of information accumulated in a run. Results of runs with 3D codes have tended to show that the third dimension, treated as “ignorable” in 2D simulations, should not have been ignored. With the next generation of highly parallel multiprocessors (which, however, call for the abandonment of spectral and implicit methods) one may hope to do very realistic 3D simulations.