![]() Techniques to the ranging problem, using for the sake of illustration the Ranging algorithm is proposed, which is obtained by adapting superresolution ![]() We consider the problem of performing ranging measurements between a sourceĪnd multiple receivers efficiently and accurately, as required byĭistance-based wireless localization systems. Finally, a Cramér-Rao lower bound (CRLB) analysis of the overall optimized multipoint ranging solution is performed, which together with a comparison against simulation results validates the proposed techniques. Since the approach requires the design of mutually orthogonal sets of Golomb rulers with equivalent properties-a problem that founds no solution in current literature-a new genetic algorithm to accomplish this task is presented, which is also found to outper-form the best known alternative when used to generate a single ruler. The resulting nonparametric algorithm handles multipoint ranging in an efficient manner by employing an orthogonalized nonuniform sampling scheme optimized via Golomb rulers. To this end, a new multipoint ranging algorithm is proposed, which is obtained by adapting superresolution techniques to the ranging problem, using for the sake of illustration the specific cases of time of arrival (ToA) and phase-difference of arrival (PDoA), unified under the same mathematical framework. ![]() We consider the problem of performing ranging measurements between a source and multiple receivers efficiently and accurately, as required by distance-based wireless localiza-tion systems.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |