Efficient realisation of alternating projection algorithm for maximum likelihood direction finding

1989 ◽  
Vol 25 (20) ◽  
pp. 1325 ◽  
Author(s):  
S.K. Oh ◽  
C.K. Un
Keyword(s):  
Maximum Likelihood ◽  
Direction Finding ◽  
Projection Algorithm ◽  
Alternating Projection

Study on Optimization of the Number of DF Stations

2014 ◽  
Vol 709 ◽  
pp. 485-490
Author(s):  
Xiang Wu ◽  
Jun Jun Zong ◽  
Xun Xue Cui ◽  
Chuan Xu Liu
Keyword(s):  
Maximum Likelihood ◽  
Maximum Likelihood Estimation ◽  
Likelihood Estimation ◽  
Direction Finding ◽  
Location Error ◽  
Location Accuracy ◽  
Error Models ◽  
Reasonable Number ◽  
Simulation Results

Reasonable number of direction finding station is examined in multi-station bearing-crossing location. Though it is believed that increasing the number of station is helpful to improve the location accuracy, In the paper, the maximum likelihood estimation (MLE) as an example. The algorithms and the location error models are given. The simulation results show that the location accuracy will be improved quickly with the increase of the number of the measuring participants, but the improvement will be sharply slowed down if too many station involved, which also boost the complexity of location.

scholarly journals A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-6
Author(s):  
Xuefeng Duan ◽  
Chunmei Li
Keyword(s):  
Iterative Algorithm ◽  
Projection Algorithm ◽  
Frobenius Norm ◽  
Matrix Equations ◽  
Von Neumann ◽  
Numerical Examples ◽  
Matrix Nearness Problem ◽  
Least Frobenius Norm Solution ◽  
Alternating Projection ◽  
The Matrix

Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations AXB=E, CXD=F, which arises frequently in experimental design. If we choose the initial iterative matrix X0=0, the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.

scholarly journals Effect of varying Number of Spacing between Antenna Elements, Snapshots, SNR on AP ML, AP-SSF and ESPRIT Algorithm

2021 ◽  
Vol 11 ◽  
pp. 143-150
Author(s):  
Vinod Kumar ◽  
Sanjeev Kumar Dhull
Keyword(s):  
Signal Processing ◽  
Maximum Likelihood ◽  
Key Words ◽  
Array Signal Processing ◽  
Direction Of Arrival ◽  
Performance Comparison ◽  
Direction Of Arrival Estimation ◽  
Multiple Sources ◽  
Alternating Projection ◽  
Esprit Algorithm

The direction of arrival estimation is the main key problem in array signal processing. In this paper, the alternating projection maximum Likelihood (AP-ML), Alternating projection sub space framework (APSSF) and ESPRIT algorithm are studied. The simulation is performed in MATLAB for single and multiple sources. The effect of the varying number of spacing between antenna elements, number of snapshots and SNR are studied. The performance comparison shows that ESPRIT algorithm performs better as compared to the AP-ML and AP-SSF. Key-Words: - AP-ML, AP-SSF, Direction of Arrival, ESPRIT, Snapshots, SNR

scholarly journals DIRECTION FINDING FOR BISTATIC MIMO RADAR USING EM MAXIMUM LIKELIHOOD ALGORITHM

2013 ◽  
Vol 141 ◽  
pp. 99-116 ◽  
Author(s):  
Hao Wen Chen ◽  
Degui Yang ◽  
Hong-Qiang Wang ◽  
Xiang Li ◽  
Zhaowen Zhuang
Keyword(s):  
Maximum Likelihood ◽  
Direction Finding ◽  
Mimo Radar ◽  
Maximum Likelihood Algorithm ◽  
Bistatic Mimo Radar

scholarly journals Dykstra′s Alternating Projection Algorithm for Two Sets

1994 ◽  
Vol 79 (3) ◽  
pp. 418-443 ◽  
Author(s):  
H.H. Bauschke ◽  
J.M. Borwein
Keyword(s):  
Projection Algorithm ◽  
Alternating Projection
Sign in / Sign up

Export Citation Format

Share Document