集中式MIMO雷达研究进展：正交波形设计与信号处理

集中式多输入多输出（Multiple Input Multiple Output,MIMO）雷达通常利用正交波形增加发射波形自由度,采用数字阵列拓展空间收发自由度,使得雷达接收机的天线孔径获得明显扩展,最终带来空间分辨率、测角精确度、杂波抑制能力等大幅度提升。但是,这些性能提升的前提是发射波形具有正交特性。事实上,在实际应用中,在不牺牲时域/频域资源情况下,受限于时宽带宽积,无法获得完全正交的波形集合,从而限制了MIMO雷达系统性能。本文对集中式MIMO雷达正交波形复用的技术原理进行了系统回顾,分别归纳了三种快时间发射波形设计方法：时分复用（Time Division Multiplexing, TDM）、码分复用（Code Division Multiplexing,CDM）和频分复用 （Frequency Division Multiplexing, FDM）,以及两种慢时间发射波形设计方法：多普勒分复用（Doppler Division Multiplexing,DDM）和随机相位编码波形,并对其优缺点进行对比。同时,对快时间MIMO和慢时间MIMO的信号处理流程进行归纳综合,给出基于匹配滤波的集中式MIMO雷达统一信号处理框架。为了展示不同波形对成像性能的影响,本文给出了基于三维匹配滤波的MIMO雷达成像结果。最后,结合实际应用问题,指出当前MIMO雷达面临的技术难点和发展趋势。     

Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.     

Robust reversible image watermarking scheme based on spread spectrum

Robust reversible watermarking can provide robustness against various attacks besides the ability to recover the cover image. However, robustness and reversibility are somewhat separate in many schemes. The original cover image cannot be recovered even if the watermarked image suffers from a tiny distortion. This paper presents a new robust reversible watermarking scheme by exploring the reversibility of spread-spectrum codes. Watermark bits are embedded by a suggested adaptive spread-spectrum code. The embedding amplitude used in the algorithms is determined by quantizing the source interference of the cover. The proposed scheme is robust to various attacks. Furthermore, since the embedding amplitude is available at the receiver, the original image can be recovered losslessly when there is no attack. Even in the presence of attacks, the original cover images can still be partially recovered. Experimental results demonstrate that the proposed scheme performs well on robustness and watermarked image quality, and provide extra reversibility that resists image distortions.     

Real-time 3D multi-pedestrian detection and tracking using 3D LiDAR point cloud for mobile robot

Mobile robots are used in modern life; however, object recognition is still insufficient to realize robot navigation in crowded environments. Mobile robots must rapidly and accurately recognize the movements and shapes of pedestrians to navigate safely in pedestrian-rich spaces. This study proposes real-time, accurate, three-dimensional (3D) multi-pedestrian detection and tracking using a 3D light detection and ranging (LiDAR) point cloud in crowded environments. The pedestrian detection quickly segments a sparse 3D point cloud into individual pedestrians using a lightweight convolutional autoencoder and connected-component algorithm. The multi-pedestrian tracking identifies the same pedestrians considering motion and appearance cues in continuing frames. In addition, it estimates pedestrians' dynamic movements with various patterns by adaptively mixing heterogeneous motion models. We evaluate the computational speed and accuracy of each module using the KITTI dataset. We demonstrate that our integrated system, which rapidly and accurately recognizes pedestrian movement and appearance using a sparse 3D LiDAR, is applicable for robot navigation in crowded spaces.     

扩频体制低轨卫星通信信号捕获与跟踪系统设计

针对扩频体制下低轨卫星信号的捕获及跟踪等系统设计实现问题,根据卫星信号模型进行了捕获及跟踪算法设计,重点对基于快速傅里叶变换的快速捕获算法、锁频环、锁相环和码跟踪环路进行了设计,并进行了工程系统实现。试验验证表明,该系统可以实现码分多址体制低轨卫星信号捕获、跟踪处理,工作性能参数满足系统需求。     

面向多波束卫星通信网络的步进跟踪方法

面向多波束覆盖的卫星通信网络,为解决相控阵用户终端位置姿态信息无法获取时程序跟踪卫星失效的问题,提出了一种步进扫描跟踪方法。在该方法中,终端仅需比较单个波束的信标接收能量即可判断波束指向,从而降低跟踪时延。在此基础上,为满足终端在动中通场景下的业务通信需求,进一步研究动态条件下的跟踪方法,并讨论跟踪时延的影响因素。实验结果表明,当终端位置姿态变化较小时,所提方法的跟踪性能接近程序跟踪。     

基于SSCANL译码器的联合迭代检测译码算法

为了提升基于极化码的稀疏码多址接入（sparse code multiple access,SCMA）系统接收机性能,提出了基于简化软消除列表（simplify soft cancellation list,SSCANL）译码器的循环冗余校验（cyclic redundancy check,CRC）辅助联合迭代检测译码接收机方案。该方案中极化码译码器使用SSCANL译码算法,采用译码节点删除技术对软消除列表（soft cancellation list,SCANL）算法所需要的L次软消除译码（soft cancellation, SCAN）进行简化,通过近似删除冻结位节点,简化节点间软信息更新计算过程,从而降低译码算法的计算复杂度。仿真结果表明,SSCANL算法可获得与SCANL算法一致的性能,其计算复杂度与SCANL算法相比有所降低,码率越低,算法复杂度降低效果越好;且基于SSCANL译码器的CRC 辅助联合迭代检测译码接收机方案相较基于SCAN译码器的联合迭代检测译码（joint iterative detection and decoding based on SCAN decoder, JIDD-SCAN）方案、基于SCAN译码器的CRC辅助联合迭代检测译码（CRC aided joint iterative detection and decoding based on SCAN decoder,C-JIDD-SCAN）方案,在误码率为10^-4时,性能分别提升了约0.65 dB、0.59 dB。     

无速率编码中度分布的研究和发展

无速率编码作为一种纠删码,在减少反馈重传的同时也具有码率灵活、编译码简单的特性,在许多领域都有广阔的应用前景。度分布作为无速率编码设计的基础,对无速率编码的性能有至关重要的影响。随着无速率编码的广泛应用,度分布的设计也需要随着场景和需求的变化进行优化。首先论述了无速率编码的发展与应用,从几种经典的无速率编码和度分布开始,详细地从应用场景、优化目标以及现有优化方法 3 个角度,对目前无速率编码中度分布的研究和发展进行了总结与分析。最后,对无速率编码和度分布的发展应用趋势进行了分析与展望。     

视场非完全重叠的分布式雷达多目标跟踪方法

在探测能力、波形设计及天线指向等因素制约下,分布式雷达视场并非完全重合,由此造成的观测信息差异给后续信息融合带来了巨大挑战。该文基于高斯混合实现的集势概率假设密度(CPHD)滤波器,提出了一种视场部分重叠下的分布式雷达多目标跟踪方法。首先,利用多目标密度乘积切分出概率假设密度(PHD)中表征共同观测信息的部分;之后,标准的分布式融合(算术平均或几何平均融合)方法作用于切分出的共同观测目标信息以提升跟踪性能,补偿融合则作用于雷达单独观测目标信息以扩展视场范围。该文方法无须视场先验信息,能够适应雷达视场未知时的分布式融合多目标跟踪场景。仿真实验验证了所提出方法在未知、时变雷达视场下跟踪多目标的性能,表明了该文方法比基于高斯混合的聚类方法性能更好。      

Research on encoding and decoding of non-binary polar codes over GF(2m)

Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2^m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.