基于并行预测控制的Turbo码译码结构

提出一种基于并行预测控制的Turbo码译码结构. 通过建立预测控制模块(PCA)来预测分量译码器第n+1次的译码外部信息值. 相比于传统的并行译码方案,基于PCA模块的PPC-Turbo结构可以降低译码算法的复杂度,并减少译码时延. 通过对单次外部信息值预测（6～9次）及复次外部信息值预测（6+8、7+9次）,对比了外部信息预测的变化趋势及不同帧长（1?024、512、256、128、64帧）情况下的译码时延,验证了译码时延的减少. 在帧长为1?024、信噪比为0～2?dB时,对译码器2第6～8次的外部信息进行了单次预测,比较了PPC-Turbo与Turbo的误比特率(BER)性能,结果表明,两者的BER非常接近,预测控制模块可以代替分量译码器的一次译码迭代.     

无循环前缀SFBC-OFDM系统的Turbo均衡

为了提高传输效率,对无循环前缀(CP)的空频分组码正交频分复用(SFBC-OFDM)系统进行了研究,提出一种基于软信息反馈的Turbo均衡算法. 同时提出了符号间干扰删除、软循环重构、对角化SFBC译码以及MMSE频域均衡器,通过多次迭代抑制系统中出现的各种干扰. 仿真结果表明,该算法可有效改善无CP的SFBC-OFDM的误码性能.     

The design and analysis of unequal error protection fountain coding for multiple source networks over binary erasure channels

A novel network model of multiple source fountain coding is developed and a novel class of generic multiple source fountain codes with unequal error protection(UEP)property is proposed.The And–Or tree analysis technique is generalized to analyze the asymptotic performance of the proposed codes and a joint optimization method employing both linear and nonlinear programs is developed to optimize the degree distributions.Furthermore,we propose three basic methods to achieve UEP property and the performance of each method is discussed.We employ these analytical results and optimization method to design and discuss several UEP codes with two and four sources for different application scenarios.Simulation results verify that the proposed codes can be applied to the networks with any number of sources and can provide strong UEP property in various ways based on the proposed three basic methods.     

Successive cancellation multibit-flipping decoding algorithm for polar codes

The investigation of the probability of error bits in a codeword shows that single-bit errors and 2-bit errors are main reasons that influence the decoding performance of polar codes with a short or moderate blocklength. Based on the statistical analysis of the error bits, a successive cancellation(SC) multibit-flipping decoding algorithm is proposed. Compared with the SC single-bit-flipping decoding, the proposed scheme can obtain better performance gains for polar codes with a short blocklength. Compared with the SC list decoding by exploring multiple paths simultaneously, the proposed scheme has a lower space complexity. Moreover, the decoding complexity of the proposed decoding algorithm decreases as the signal to noise ratio(SNR) increases. Simulation shows that for polar codes with a short or moderate blocklength, the performance of the proposed decoder can approach that of the SC list decoding with lower decoding complexity in high SNR regions.     

Blind recognition algorithm for IRA codes in noisy environment

For noisy environment, the parity-check matrix of Irregular Repeat-Accumulate(IRA) codes is hard to reconstruct, moreover, the relationships of the large-scale complex interleaver are hard to recover. To solve the problems, a novel blind recognition algorithm is proposed. First, the code's length and synchronization are identified by applying rank criteria. Second, by implementing matrix transformation, the dual vectors of codewords are found. Then, by setting a threshold, the effective parity-check vectors of dual space are selected. According to the sparse characteristics of the IRA codes' parity-check matrix, the parity matrix can be reconstructed with effective parity-check vectors Finally, relationships of the interleaver can be recovered according to the characteristics of IRA codes. Simulation results show that the proposal can be used to estimate IRA codes encoding parameters and complete the blind recognition in the non-cooperative context with noise.     

On the Girth of Tanner (5,7) Quasi-Cyclic LDPC Codes

Tanner (5,7)准循环LDPC码的围长问题

徐恒舟,白宝明,冯丹,孙成

(西安电子科技大学 ISN国家重点实验室,西安 710071)

创新点说明：

1）定义了Tanner (5,7)准循环LDPC码Tanner图中环的等价类;

2）提出了Tanner (5,7)准循环LDPC码Tanner图中环存在的充要条件,即素域Fp上多项式是否有一个35次单位根;

3）完全解决了Tanner (5,7)准循环LDPC码的围长问题（码长为7p,p为模35余1的素数）

研究目的：解决Tanner (5,7)准循环LDPC码的围长问题（码长为7p,p为模35余1的素数）

研究方法：

本文定义了环的等价形式,并分析了Tanner (5,7)准循环LDPC码Tanner图中的环结构,并将长度为4,6,8和10的环划分为16个等价类。此外,这些环是否存在可以等价地看为素域Fp上多项式是否有一个35次单位根。通过检验这些多项式是否存在一个35次单位根,可以得到Tanner (5,7)准循环LDPC码的围长候选值。最后,统计这些候选值得到了Tanner (5,7)准循环LDPC码的围长。

结 果：

得到了围长为6,8和10的Tanner (5,7)准循环LDPC码,其中码长为7p：

1）当围长为6时,p = 71。

2）当围长为8时,p ? G8 = {211, 281, 421, 491, 631, 701, 911, 1051, 2311, 4271, 5531, 7211, 237301, 354551}。

3） 当围长为10时,p ? G10 = {1471, 2381, 2521, 2591, 2731, 2801, 3011, 3221, 3361, 3571, 3851, 4201, 4481, 4621, 4691, 4831, 5741, 5881, 6091, 6301, 6581, 6791, 7001, 7351, 7561, 7841, 8191, 8681, 8821, 9241, 9311, 9521, 9661, 9871, 9941, 10151, 10501, 10711, 10781, 11131, 11411, 11621, 11831, 11971, 12041, 12251, 12391, 12601, 12671, 13441, 13931, 14071, 14771, 15121, 15541, 16381, 16451, 16661, 16871, 17011, 17291, 17431, 17921, 18061, 18131, 18481, 18691, 19181, 19391, 19531, 20161, 20231, 20441, 21001, 21211, 21491, 21701, 21911, 22051, 22751, 24151, 24781, 25411, 26111, 26251, 28001, 28771, 30661, 30871, 30941, 32971, 33181, 33461, 33811, 34231, 34511, 35141, 36541, 37871, 38011, 39551, 39761, 42491, 43261, 43331, 44171, 45361, 46831, 47041, 47741, 47881, 48371, 50051, 51521, 52361, 54881, 55511, 55721, 57751, 59221, 63841, 65101, 66571, 66851, 67061, 67271, 71191, 74761, 75181, 76231, 79801, 85751, 97441, 98491, 104021, 109831, 110321, 110951, 112771, 118861, 122921, 125231, 126211, 127261, 128591, 130621, 134401, 137131, 141961, 147211, 152041, 154981, 159671, 162821, 164431, 185221, 192431, 203911, 204331, 207061, 217351, 242621, 262781, 273001, 274471, 278741, 280351, 285251, 296731, 299671, 301841, 318641, 325921, 333691, 343141, 343561, 348461, 349931, 361901, 370441, 374291, 385631, 393961, 403621, 423431, 435401, 437501, 440651, 441421, 443591, 446881, 453461, 495461, 522061, 532421, 557831, 589471, 687541, 704761, 718271, 763771, 766501, 829151, 837271, 845951, 867371, 898661, 920641, 1022141, 1180901, 1197281, 1239421, 1253071, 1388381, 1542031, 1634011, 1747271, 1773241, 2102171, 2153551, 2318471, 2691011, 3338441, 3439801, 4567151, 4649261, 8553581, 9268631, 23632351, 27136621}。

结 论：

当p ? P35/({71}? G8?G10)时,Tanner (5,7)准循环LDPC码的围长为12（P35代表模35余1的素数集合）。

     

高分2号图像业务化大气校正查找表的设计与实现

为实现高分2号图像(GF2)业务化大气校正,利用矢量6S模型(6SV)将辐射传输散射与吸收进行分离计算,其中散射部分采用涵盖各种大气模式、气溶胶类型、成像几何等条件下的大气校正查找表(look-up tables,LUTs)表示,大气吸收部分采用6SV拟合计算的6种大气模式下大气透过率的经验公式表示,这种处理有效简化了查找表大小.在内存4 GB、主频3.10 GHz条件下,通过比较基于本查找表方法和基于FLAASH大气校正软件对北京地区一景GF2数据处理.结果表明:以6SV模型直接大气校正法结果作为真值,两者的绝对误差分别为0.8%和2.6%,处理时间分别为77 s和240 s,该大气校正查找表在处理精度和效率更加适合业务化大气校正.     

基于准正交编码的MIMO空间光通信技术研究

由于自由空间光通信严重受到大气湍流引起的光强起伏,光束漂移等问题对通信性能的影响,本文研究了大气信道特性并分析了空时分组编码方案,采用MIMO技术提高自由空间光通信系统的性能。基于MIMO技术下的准正交编码方案不仅可以增强信道的抗衰落能力而且可以提供一定的分集增益和编码增益。在Matlab平台下使用蒙特卡罗模拟方法,对系统的信道容量和误码率进行数值研究。仿真结果表明:采用MIMO技术能够提高信道容量,有效改善误码性能,而且分集数越高,通信质量越好。     

深空通信系统中高阶LDPC码的软定时同步算法

深空通信具有信号衰减严重,接收机信噪比低的特点,针对深空通信系统中高阶LDPC码定时同步实现困难的问题,提出一种码辅助定时同步算法．首先使用高阶LDPC码的译码软信息构造一种代价函数,进行大定时偏移的粗同步,其次基于最大似然准则,使用EM算法进行定时偏移的细同步．该算法将定时同步器、解调器与译码器联合迭代,利用高阶LDPC译码器输出的软信息辅助定时同步,并通过数字插值方式对过采样信号进行补偿,从而得到接近修正克拉美罗限的定时估计．仿真结果表明,在低信噪比条件下,算法能够在较大定时偏移范围内实现有效的定时同步,并以较低的复杂度获得近似理想的系统误码率性能．     

短突发传输系统的联合导频和迭代译码载波同步简

Considering the low estimation accuracy and small synchronization range of carrier synchronization algorithms in low signal to noise ratio (SNR) for short burst communication systems, a joint pilot and iterative decoding soft-output carrier synchronization algorithm is proposed. Firstly, the received pilot sequence is extracted and modulation is removed, with the modulation-removed signals made cross-correlated. Then the summation of all the correlation values is used to perform initial carrier parameters estimation. Secondly, the pilot sequence is reused with the soft-output information based on the extended Turbo decoder to obtain fine frequency and phase estimation values. Theoretical analysis and simulation results show that the coarse estimation algorithm can satisfy the requirements of the frequency estimation range and estimation accuracy, and preamble-middle pilot placement is optimal for a certain length of the data frame; The turbo decoder can obtain more reliable soft-output information with small residual frequency offset after initial coarse synchronization when the normalized frequency offset is less than 1.5×10^-3, with the joint pilot and soft-output of the decoder used to estimate fine carrier parameters, which can make the turbo code achieve optimal BER performance.