Abstract
An efficient algorithm is developed to compute the a posteriori probabilities of the origins of measurements in the joint probabilistic data association filter (JPDAF). The inherited parallelism of this algorithm enables it to be suitable for implementation in a multiprocessor system. In this algorithm the a posteriori probability of the origin of each measurement in the JPDAF is decomposed into two parts. The computation of one part becomes trivial and the algorithm developed here is implemented on the other part, which is shown to be related to permanents. The computational complexity of this algorithm is analyzed in the worst case as well as in the average case. An analysis of this algorithm enables us to conclude that this algorithm is more efficient than other existing ones in the average case.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
