A Fast Sparse Decomposition for Three-order Polynomial Phase Signal Based on Subspace
OU Guojian①② JIANG Qingping① QING Changchun②
①(Key Laboratory of Aerocraft Tracking Telemetering & Command and Communication, Ministry of Education, Chongqing University, Chongqing 400044, China) ②(School of Software, Chongqing College of Electronic Engineering, Chongqing 401331, China)
Abstract:In view of the defect for large number of atoms in the over-complete dictionary during sparse decomposition, this paper presents a fast sparse decomposition algorithm for three-order polynomial phase signal based on subspace. According to the characteristic of three-order polynomial phase signal, the original signal is transformed into two subspace signals, then the atoms are structured based on the two subspace signals in the over-complete dictionary, and the two subspace signals are sparsely decomposed by using orthogonal matching pursuit algorithm. Finally, the sparse decomposition for the original signal is completed by using the theory of the sparse decomposition. In the algorithm, three-order polynomial phase signal is transformed into two subspace signals, and two over-complete dictionaries are structured based on the two subspace signals. Compared to one over-complete dictionary, the atoms are reduced enormously by using two over-complete dictionaries in the algorithm, and one matching atom can be obtained in one over-complete dictionary when another matching atom in another over-complete dictionary is obtained by using fast Fourier transform. Therefore the method can sparsely decompose three-order polynomial phase signal with low computational complexity by reducing the atoms and using fast Fourier transform. Simulation results show that the computational efficiency of the proposed method is better than that of using Gabor atoms, genetic algorithm and the algorithm based on modulation correlation partition, and the sparsity is better.
欧国建, 蒋清平, 秦长春. 基于子空间的三阶多项式相位信号快速稀疏分解算法[J]. 电子与信息学报, 2018, 40(3): 648-655.
OU Guojian, JIANG Qingping, QING Changchun. A Fast Sparse Decomposition for Three-order Polynomial Phase Signal Based on Subspace. JEIT, 2018, 40(3): 648-655.
DJUROVI I and SIMEUNOVI M. Parameter estimation of non-uniform sampled polynomial-phase signals using the HOCPF-WD[J]. Signal Processing, 2015, 106(1): 253-258. doi: 10.1016/j.sigpro.2014.08.007.
[2]
OU G J , YANG S Z, DENG J X, et al. A refined estimator of multicomponent third-Order polynomial phase signals[J]. IEICE Transactions on Communications, 2016,E99-B(1): 143-151. doi: 10.1587/transcom.2015EBP3131.
[3]
SIMEUNOVI M and DJUROVI I. Parameter estimation of multicomponent 2D polynomial-phase signals using the 2D PHAF-based approach[J]. IEEE Transactions on Signal Processing, 2016, 64(3): 771-782. doi: 10.1109/TSP.2015.2491887.
[4]
DENG Z, XU R, ZHANG Y, et al. Compound time-frequency domain method for estimating parameters of uniform- sampling polynomial-phase signals on the entire identifiable region[J]. IET Signal Processing, 2016, 10(7): 743-751. doi: 10.1049/iet-spr.2015.0361.
[5]
RAKOVI P, SIMEUNOVI M, and DJUROVI I. On improvement of joint estimation of DOA and PPS coefficients impinging on ULA[J]. Signal Processing, 2017, 134: 209-213. doi: 10.1016/j.sigpro.2016.12.015.
[6]
LI Y, WU R, XING M, et al. Inverse synthetic aperture radar imaging of ship target with complex motion[J]. IET Radar Sonar Naving, 2008, 2(6): 395-403. doi: 10.1049/iet-rsn: 20070101.
[7]
WANG Yong and JIANG Yicheng. ISAR imaging of a ship target using product high-order matched-phase transform[J]. IEEE Geoscience and Remote Sensing Letters, 2009, 6(4): 658-661. doi: 10.1109/LGRS.2009.2013876.
[8]
O’SHEA P. A fast algorithm for estimating the parameters of a quadratic FM signal[J]. IEEE Transactions on Signal Processing, 2004, 52(2): 385-393. doi: 10.1109/TSP.2003.821097.
OU G J, YANG S Z, JIANG Q P, et al. A dictionary learning algorithm for denoising cubic phase signal[J]. Journal of Electronics & Information Technology, 2014, 36(2): 255-259. doi: 10.3724/SP.J.1146.2013.00726.
[10]
JAFARI M G and PLUMBLEY M D. Fast dictionary learning for sparse representations of speech signals[J]. IEEE Journal of Selected Topics in Signal Processing, 2011, 5(5): 1025-1031. doi: 10.1109/JSTSP.2011.2157892.
[11]
ZHAO Y, WU Z, YANG Z, et al. A novel signal sparse decomposition based on modulation correlation partition[J]. Neurocomputing, 2016, 171(1): 736-743. doi: 10.1016/j.neucom.2015.07.013.
[12]
MOHAMMADI M R, FATEMIZADEH E, and MAHOOR M H. Non-negative sparse decomposition based on constrained smoothed norm[J]. Signal Processing, 2014, 100: 42-50. doi: 10.1016/j.sigpro.2014.01.010.
[13]
MARTI-LOPEZA F and KOENIGB T. Approximating method of frames[J]. Digital Signal Processing, 2003, 13(3): 519-529. doi: 10.1016/S1051-2004(02)00024-6.
[14]
GORODNITSKY I F and BHASKAR D R. Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm[J]. IEEE Transactions on Signal Processing, 1997, 45(3): 600-616. doi: 10.1109/78.558475.
[15]
CHEN S, DONOHO D, and SAUNDERS M. Atomic decomposition by basis pursuit[J]. SIAM Journal on Scientific Computing, 1999, 20(1): 33-61. doi: 10.1137/S1064827596304010.
[16]
MOHAMED A and DAVATZIKOS C. Shape representation via best orthogonal basis selection[C]. International Conference on Medical Image Computing & Computer- Assisted Intervention, 2004, 3216: 225-233. doi: 10.1007/978-3-540-30135-6_28.
[17]
MALLAT S and ZHANG Z. Matching pursuits with time- frequency dictionaries[J]. IEEE Transactions on Signal Processing, 1993, 41(12): 3397-3415. doi: 10.1109/78.258082.
ZHAO Xuejun, LI Yuzhen and LEI Shuyu. An Image fusion method with sparse representation based on genetic algorithm optimization[J]. Journal of Beijing University of Posts and Telecommunications, 2016, 39(2): 73-76. doi: 10. 13190/j.jbupt.2016.02.015.
QUAN Shengrong, ZHANG Tianqi, WANG Junxia, et al. A new time-frequency analysis method of sinusoidal frequency modulation signals based on sparse decomposition[J]. Application of Electronic Technique, 2016, 42(6): 87-90. doi: 10.16157/j.issn.0258-7998.2016.06.024.
LI Ying and CHEN Qiuju. Sound event recognition based on optimized orthogonal matching pursuit[J]. Journal of Electronics & Information Technology, 2017, 39(1): 183-190. doi: 10.11999/JEIT160120.
WANG Li and FENG Yan. Sparse decomposition of images based on particle swarm optimization[J]. Computer Simulation, 2015, 32(11): 363-367. doi: 10.3969/j.issn.1006-9348.2015.11.080.
WANG Zailei, HE Hongjie, WANG Jianying, et al. Fast algorithm for image MP sparse decomposition based on FHT and core dictionary[J]. Journal of the China Railway Society, 2012, 34(9): 51-57. doi: 10.3969/j.issn.1001-8360.2012.09.009.
SHAO Jun, YIN Zhongke, WANG Jianying, et al. Set partitioning of the over-complet dictionary in signal sparse decomposition[J]. Journal of the China Railway Society, 2006, 28(1): 68-71. doi: 10.3321/j.issn:1001-8360.2006.01.015.
WANG Cong, XU Minqiang, and LI Zhicheng. Gearbox fault diagnosis based on orthogonal matching pursuit algorithm[J]. Journal of Harbin of Technology, 2017, 49(4): 126-130. doi: 10.11918/j.issn.0367-6234.201505053.
[25]
WU Y, SO H C, and LIU H. Subspace-based algorithm for parameter estimation of polynomial phase signals[J]. IEEE Transactions on Signal Processing, 2008, 56(10): 4977-4983. doi: 10.1109/TSP.2008.927457.