期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
DOWNWARD LOOKING SPARSE LINEAR ARRAY 3D SAR IMAGING ALGORITHM BASED ON BACK-PROJECTION AND CONVEX OPTIMIZATION 被引量:1
1
作者 Bao Qian Peng Xueming +2 位作者 Wang Yanping Tan Weixian Hong Wen 《Journal of Electronics(China)》 2014年第4期298-309,共12页
Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distr... Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distributed sparsely and nonuniformly, traditional 3D SAR algorithms suffer from low resolution and high sidelobes in cross-track dimension. To deal with this problem, this paper introduces a method based on back-projection and convex optimization to achieve 3D high accuracy imaging reconstruction. Compared with traditional SAR algorithms, the proposed method sufficiently utilizes the sparsity of the 3D SAR imaging scene and can achieve lower sidelobes and higher resolution in cross-track dimension. In the simulated experiments, the reconstructed results of both simple and complex imaging scene verify that the proposed method outperforms 3D back-projection algorithm and shows satisfying cross-track dimensional resolution and good robustness to noise. 展开更多
关键词 Three Dimensional SAR (3D SAR) Downward looking Sparse linear array Convex optimizationclc number:TN957
在线阅读 下载PDF
Low-Complexity Optimization Algorithm for Irregular Low-Density Parity-Check Codes
2
作者 左健存 邵宇丰 桂林 《Journal of Donghua University(English Edition)》 EI CAS 2013年第4期330-335,共6页
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit... A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost. 展开更多
关键词 irregular low-density parity-check (LDPC) codes Turbo codes optimizationclc number:TN911.22Document code:AArticle ID:1672-5220(2013)04-0330-06
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部