Fast acquisition of L2C CL codes based on combination of hyper codes and averaging correlation

This paper provides a direct and fast acquisition algorithm of civilian long length（CL） codes in the L2 civil（L2C） signal. The proposed algorithm simultaneously reduces the number of fast Fourier transformation（FFT） correlation through hyper code technique and the amount of points in every FFT correlation by using an averaging correlation method. To validate the proposed acquisition performance, the paper applies this algorithm to the real L2C signal collected by the global positioning system（GPS） L2C intermediate frequency（IF） signal sampler—SIS100L2C. The acquisition results show that the proposed modified algorithm can acquire the code phase accurately with less calculation and its acquisition performance is better than the single hyper code method.

Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding

Polar codes using successive-cancellation decoding always suffer from high latency for its serial nature. Fast simplified successive-cancellation decoding algorithm improves the situation in theoretically but not performs well as expected in practical for the workload of nodes identification and the existence of many short blocks. Meanwhile, Neural network (NN) based decoders have appeared as potential candidates to replace conventional decoders for polar codes. But the exponentially increasing training complexity with information bits is unacceptable which means it is only suitable for short codes. In this paper, we present an improvement that increases decoding efficiency without degrading the error-correction performance. The long polar codes are divided into several sub-blocks, some of which can be decoded adopting fast maximum likelihood decoding method and the remained parts are replaced by several short codes NN decoders. The result shows that time steps the proposed algorithm need only equal to 79.8% of fast simplified successive-cancellation decoders require. Moreover, it has up to 21.2 times faster than successive-cancellation decoding algorithm. More importantly, the proposed algorithm decreases the hardness when applying in some degree.

RETRACTED: <i>Improved Polar Decoder Utilizing Neural Network in Fast Simplified Successive-Cancellation Decoding</i>

This article has been retracted to straighten the academic record. In making this decision the Editorial Board follows COPE's Retraction Guidelines. The aim is to promote the circulation of scientific research by offering an ideal research publication platform with due consideration of internationally accepted standards on publication ethics. The Editorial Board would like to extend its sincere apologies for any inconvenience this retraction may have caused. Please see the article page for more details. The full retraction notice in PDF is preceding the original paper which is marked "RETRACTED".

基于关键翻转集合的极化码Fast-SSC-Flip译码算法

为了降低极化码快速简化串行抵消翻转(Fast-SSC-Flip)译码算法的候选翻转比特集合大小,减小搜索复杂度,该文提出一种基于关键翻转集合的极化码Fast-SSC-Flip译码算法。基于快速简化串行抵消(Fast-SSC)译码过程中首位译码错误信息比特有极大的概率落于关键集合(CS)中,以及Fast-SSC-Flip译码算法的候选比特均为码字比特,所提算法利用极化码的生成矩阵得到与CS中信息比特相应的码字比特,并用这些码字比特构建关键翻转集合(CFS)作为候选翻转比特集合。实验结果表明,在使用相同候选比特可靠性度量准则的前提下,在码长N=1024及码率R=0.5时,该文所提基于关键翻转集合的Fast-SSC-Flip译码算法相较于传统Fast-SSC-Flip算法在不损失译码性能的情况下,候选翻转集合大小显著降低;相较于新的快速简化串行抵消翻转(N-Fast-SSC-Flip)算法有相近的译码性能,但候选翻转集合至少缩小了77.93%。

利用BCH码纠错和Fast-ICA的长码直扩CDMA信号扩频码盲估计

针对非合作通信中LC-DS-CDMA信号的扩频码盲估计问题,首先根据扩频增益对同步接收信号进行分段,利用Fast-ICA算法估计m序列扩频码片段;然后将估计得到的m序列片段排列组合进行拼接,利用m序列自相关特性对组合序列粗筛选,再利用m序列三阶相关特性进行精筛选;最后利用BCH码和m序列的等价原理对筛选后的组合序列进行纠错,纠错成功的序列即为扩频码序列。仿真结果验证了本文算法的有效性。

一种高性能极化码Fast-SSC译码器设计

为了进一步降低无线通信系统中信道编码极化码Fast-SSC译码器的译码延迟和硬件资源消耗,本文提出了两种对Fast-SSC译码算法的优化方法,基于FPGA硬件实现了码长N=1024优化的Fast-SSC译码器.基于Fast-SSC译码树上的四种特殊结点Rate0、Rate1、Rep和SPC,提出分别以Rate0结点和Rep结点为基础进行组合型特殊结点的拓展,使译码树上的特殊结点类型由原来的四种增加至十种以上,进一步加快了搜索译码树的速度;提出存储器资源复用的方法,相同译码树深度的结点使用相同的存储空间.综合结果表明最大工作频率为169 MHz,译码延迟为1.71μs,数据吞吐率为599 Mbps,存储器消耗为14.8 Kbit,有效提升了Fast-SSC译码器的整体性能.

Construction of protograph LDPC codes with circular generator matrices

The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.

AN OPTIMIZED SCHEME FOR FAST HANDOFF IN IP-BASED CDMA WIRELESS COMMUNICATION NETWORKS

This paper proposed an optimized fast handoff scheme for real time applications in next generation IP based CDMA wireless networks. The idea is to utilize optimized IP multicasting handoff (based on PIM SM), which is triggered by CDMA layer 2 functionality. An IP based cellular network model with WCDMA FDD air interface and IP based packet traffic is adopted. No special network entities and signaling for handoff are added in our network model. The simulation results show that low delay and low packet lost rate can be obtained.

基于FPGA的高速Fast-SSC译码器测试系统

为了满足Polar码高性能测试时大数据量的要求,设计了一种针对Fast-SSC译码器的FPGA硬件测试平台,包含信源、信道编码器、调制器、信道、解调器、译码器和统计模块,采用Verilog在Altera Stratix V 5SGXEA7N2F45C2上实现,并采用PCIe接口与上位机进行通信。该平台对码长1 024、码率1/2的Polar码进行测试,结果表明测试频率为300 MHz、测试数据为1.4×1010位时,译码耗时仅为19.18 s。

Fast mode decision for Hierarchical-B pictures in scalable video coding

To decrease the computational complexity of adaptive inter-layer prediction and improve the encoding efficiency in sealable video coding, a mode decision algorithm is proposed by exploiting the part of used candidate modes of the co-located reference macrobloeks for Hierarchical-B pictures. This scheme reduces the amount of the candidate modes to generate a dynamic list for the current encoding macroblock according to the statistical information derived from the co-located reference macroblocks in different temporal levels. The experimental results show that this fast algorithm reduces approximately 31% encoding time on average with the negligible loss of encoding performance.

基于关键简化集合的极化码SSRFSC翻转译码算法

为提高基于简化序列重复节点的快速串行抵消(SSRFSC)译码算法的译码性能,提出了基于关键简化集合(CSS)和简化序列重复(SSR)节点的CSS-SSR-Flip译码算法。所提算法首先选取SSR中最长重复(REP)节点的信息位作为候选比特(CB),从而构造了基于SSR的CSS;然后针对SSR节点的译码特点设计了相应的翻转度量和翻转准则,通过考虑SSR节点中重复序列和源节点对译码的影响来度量CB可靠性,在特定CB翻转时选择次优的重复序列完成SSR节点翻转操作。实验数据表明,当误帧率FER=10-3时,所提出的CSSSSR-Flip译码算法与传统的快速简化串行抵消翻转(Fast-SSC-Flip)译码算法相比能够获得超过0.1 dB的性能增益,且具有与新型Fast-SSC-Flip(New-Fast-SSC-Flip)译码算法相同的译码性能;与传统翻转集合大小K相比,CSS大小缩减最多达79.5%,与关键集合(CS)相比集合大小最多可缩减23.1%。

Construction of time-frequency codes based on protograph LDPC codes in OFDM communication systems

This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.

面向360°全景视频的帧内预测编码的快速算法

为了节省360°全景视频的编码时间,对通用视频编码标准中的编码单元划分决策过程进行了研究,提出了一种面向360°全景视频的帧内预测编码的快速算法。通过优化编码树单元(Coding Tree Unit,CTU)的编码深度范围和编码单元的划分模式的选择过程,减少编码时间。实验结果表明,在全帧内模式下,所提算法比原始算法平均可以节省34.33%的时间复杂度,同时带来的BDBR平均增量仅为1.665%,BDPSNR的平均降低量仅为0.076 dB。

Development of an Evaluation Methodology for Fuel Discharge in Core Disruptive Accidents of Sodium-Cooled Fast Reactors

The purpose of the present study is to develop a methodology to evaluate fuel discharge through the CRGT （control-rod guide tube） during CDAs （core-disruptive accidents） of SFRs （sodium-cooled fast reactors）, since fuel discharge will decrease the core reactivity and CRGTs have a potential to provide an effective discharge path. Fuel discharge contains multi-component fluid dynamics with phase changes, and, in the present study, the SFR safety analysis code SIMMER （Sn, implicit, multifield, multicomponent, Eulerian recriticality） was utilized as a technical basis. First, dominant phenomena affecting fuel discharge through the CRGT are identified based on parametric calculations by the SIMMER code. Next, validations on the code models closely relating to these phenomena were carried out based on experimental data. It was shown that the SIMMER code with some model modifications could reproduce the experimental results appropriately. Through the present study, the evaluation methodology for the molten-fuel discharge through the CRGT was successfully developed.

基于FR-Sdaso程序对FFTF LOFWOS Test#13基准例题的热工水力分析

FFTF LOFWOS Test#13是美国FFTF钠冷回路式快堆进行的无保护失流试验,目的是为了证明反应堆的固有安全特性。本文采用中国原子能科学研究院自主开发的FR-Sdaso程序参加了IAEA策划发起的基于该试验的基准例题项目。利用FR-Sdaso程序将一回路主泵转速、二回路流量和空气热交换器出口钠温作为边界条件,建立了FFTF基准例题模拟模型。计算结果与FFTF LOFWOS Test#13试验结果对比分析表明,FR-Sdaso程序能较好地预测无保护失流事故后反应堆功率以及一、二回路温度和流量的瞬态变化,自然循环阶段反应堆衰变功率计算值与试验值的最大相对偏差为−7.1%,一回路3个环路自然循环流量与初始稳态值的最大相对偏差为0.65%。对于第2排和第6排PIOTA组件,由于模拟中未考虑瞬态过程中堆芯功率分布变化和组件之间的传热,出口温度的计算值较试验测量值最大偏高25.5℃,计算结果更保守。FR-Sdaso程序对FFTF LOFWOS Test#13基准例题的分析初步验证了程序堆芯和一、二回路热工水力模型的正确性。

Medical Image Compression Using Wrapping Based Fast Discrete Curvelet Transform and Arithmetic Coding

Due to the development of CT (Computed Tomography), MRI (Magnetic Resonance Imaging), PET (Positron Emission Tomography), EBCT (Electron Beam Computed Tomography), SMRI (Stereotactic Magnetic Resonance Imaging), etc. has enhanced the distinguishing rate and scanning rate of the imaging equipments. The diagnosis and the process of getting useful information from the image are got by processing the medical images using the wavelet technique. Wavelet transform has increased the compression rate. Increasing the compression performance by minimizing the amount of image data in the medical images is a critical task. Crucial medical information like diagnosing diseases and their treatments is obtained by modern radiology techniques. Medical Imaging (MI) process is used to acquire that information. For lossy and lossless image compression, several techniques were developed. Image edges have limitations in capturing them if we make use of the extension of 1-D wavelet transform. This is because wavelet transform cannot effectively transform straight line discontinuities, as well geographic lines in natural images cannot be reconstructed in a proper manner if 1-D transform is used. Differently oriented image textures are coded well using Curvelet Transform. The Curvelet Transform is suitable for compressing medical images, which has more curvy portions. This paper describes a method for compression of various medical images using Fast Discrete Curvelet Transform based on wrapping technique. After transformation, the coefficients are quantized using vector quantization and coded using arithmetic encoding technique. The proposed method is tested on various medical images and the result demonstrates significant improvement in performance parameters like Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).

Efficient Fast Multiplication Free Integer Transformation for the 1-D DCT of the H.265 Standard

In this paper, efficient one-dimensional (1-D) fast integer transform algorithms of the DCT matrix for the H.265 stan-dard is proposed. Based on the symmetric property of the integer transform matrix and the matrix operations, which denote the row/column permutations and the matrix decompositions, along with using the dyadic symmetry modification on the standard matrix, the efficient fast 1-D integer transform algorithms are developed. Therefore, the computational complexities of the proposed fast integer transform are smaller than those of the direct method. In addition to computational complexity reduction one of the proposed algorithms provides transformation quality improvement, while the other provides more computational complexity reduction while maintaining almost the same transformation quality. With lower complexity and better transformation quality, the first proposed fast algorithm is suitable to accelerate the quality-demanding video coding computations. On the other hand, with the significant lower complexity, the second proposed fast algorithm is suitable to accelerate the video coding computations.

基于CU特征差异的VVC帧内快速划分算法

针对通用视频编码(versatile video coding,VVC)在编码单元(coding unit,CU)划分中引入了多类型树划分结构导致编码复杂度增加的问题,提出了一种基于CU子块方向特性与空间复杂度的快速划分算法。首先利用CU整体的纹理复杂度对当前CU进行分类,筛选出不划分CU;然后利用子块不同划分方向的特性差异提前决策CU划分方向;最后利用CU中间区域与边缘区域的复杂度差异特征判断是否跳过三叉树(ternary tree,TT)划分,进一步减少候选列表划分模式数量。实验结果表明,与官方测试平台VTM10.0相比,编码器在平均输出比特率增加1.12%的代价下,编码时间减少了40.25%,说明该算法在通用视频编码中能以较小的质量损失实现更短的编码时间。

一种基于编码单元快速划分的VVC帧内编码方法

相比于高效视频编码(high efficiency video coding,HEVC)标准,新一代编码标准多功能视频编码(versatile video coding,VVC)引入了很多新的技术,其中包括四叉树(quadtree,QT)和多类型树(multi-type tree,MTT)划分,MTT划分由HEVC中的QT划分延伸而来。新划分方法提高了压缩效率,但导致编码时间急剧增加。为了降低编码复杂度,提出了一种结合深度学习方法和MTT方向早期判决的快速帧内编码算法。首先使用轻量级的卷积神经网络(convolutional neural network,CNN)对QT和部分MTT进行预测划分,其余MTT则采用提前预测MTT划分方向的方法作进一步的优化。实验结果表明,所提方法能够大幅降低编码复杂度,相比于原始编码器的编码时间减少了74.3%,且只有3.3%的码率损失,性能优于对比的方法。

K波段高增益宽带的异极化透/反射阵列天线

提出了一种具有新型多功能空间馈电平面的阵列天线,可以同时实现透/反射两个波束。该阵列通过快速响应编码对圆环反射单元和透射单元进行合理分布,以实现不同极化方向的透/反射波束。基于所提出的透射和反射单元,设计并制造了具有25×25个单元的透射-反射阵列天线,分别产生θ=0°向后的x极化方向的反射波束和θ=180°向前的y极化方向的透射波束。该天线的中心频率为22 GHz,测试结果表明,反射波束最大增益为22 dB,3 dB增益带宽达到28%;透射波束的最大增益为19.2 dB,3 dB增益带宽达到27%。