scholarly journals Research on 5G positioning technology for urban canyon

2021 ◽  
Vol 2113 (1) ◽  
pp. 012060
Author(s):  
Xin Xiong ◽  
Shumin Liu
Keyword(s):  
Measurement Data ◽  
Estimation Algorithm ◽  
Urban Canyon ◽  
Beam Forming ◽  
Localization Algorithm ◽  
Music Algorithm ◽  
Positioning Accuracy ◽  
Weighted Matrix

Abstract Aiming at the problem of poor positioning accuracy of GNSS for urban canyon environment, this paper proposes a TDOA/AOA combined positioning technology based on 5G.Firstly, the AOA estimation algorithm based on conventional beam forming is compared with that based on MUSIC algorithm. Then, the weighted matrix is smoothed forward and backward.Finally, according to the measurement data of AOA and TDOA, Chan and Taylor combined localization algorithm is used to obtain the estimated location of the user.

Study on Resolution Capability of Beam Space MUSIC Estimation Algorithm

2014 ◽  
Vol 945-949 ◽  
pp. 2106-2110
Author(s):  
Hao Zhou ◽  
Zhi Jie Huo
Keyword(s):  
Estimation Algorithm ◽  
Signal Classification ◽  
Beam Forming ◽  
Music Algorithm ◽  
Correlated Sources ◽  
Element Space ◽  
Computation Cost ◽  
Multiple Signal Classification ◽  
Resolution Capability ◽  
Sonar Systems

Hydrophone arrays are generally used in modern sonar systems in which beam forming plays an important role. This paper analyzes the beam space MUSIC (multiple signal classification) algorithm for the weakly correlated sources according to changes in the statistical properties of signal and noise, then estimates the azimuth of multi-sources using array element space MUSIC algorithm and beam space MUSIC algorithm accurately, respectively. Finally, problems such as the computation cost of the algorithms, SNR resolution threshold and estimation deviation are discussed based on simulation tests. A conclusion could be drawn that beam space MUSIC algorithm is an effective way to resolve multiple targets in small angle domain.

scholarly journals Bearing and Range Estimation Algorithm for Buried Object in Underwater Acoustics

2009 ◽  
Vol 2009 ◽  
pp. 1-4
Author(s):  
Dong Han ◽  
Caroline Fossati ◽  
Salah Bourennane ◽  
Zineb Saidi
Keyword(s):  
Underwater Acoustics ◽  
Classical Model ◽  
Acoustic Scattering ◽  
Estimation Algorithm ◽  
Signal Classification ◽  
Music Algorithm ◽  
Range Estimation ◽  
Multiple Signal Classification ◽  
Buried Objects ◽  
Buried Object

A new algorithm which associates (Multiple Signal Classification) MUSIC with acoustic scattering model for bearing and range estimation is proposed. This algorithm takes into account the reflection and the refraction of wave in the interface of water-sediment in underwater acoustics. A new directional vector, which contains the Direction-Of-Arrival (DOA) of objects and objects-sensors distances, is used in MUSIC algorithm instead of classical model. The influence of the depth of buried objects is discussed. Finally, the numerical results are given in the case of buried cylindrical shells.

Based on RSSI Ranging Technology for DV-Hop Localization Algorithm of Wireless Sensor Network

2012 ◽  
Vol 442 ◽  
pp. 360-365 ◽  
Author(s):  
Yang Jun Zhong
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Approximate Calculation ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Original Algorithm ◽  
Approximate Distance ◽  
Anchor Nodes ◽  
Simulation Results

For the DV-Hop algorithm of wireless sensor networks,there is an error arising problem that anchor nodes and location node hop distance is only an approximate calculation. A method based on the original Algorithm introducing RSSI ranging technique is proposed.Using RSSI ranging technology,we accord that if the anchor nodes is only a hop away from the location node,then decide whether using the DV-Hop algorithm to approach to the approximate distance between them. Simulation results show that the algorithm can effectively improve the error problems of calculating the hop distance between the anchor nodes and the location nodes, meanwhile improve the positioning accuracy of the node.

A Localization Algorithm Research to Eliminate the Indoor NLOS Error

2014 ◽  
Vol 989-994 ◽  
pp. 2232-2236 ◽  
Author(s):  
Jia Zhi Dong ◽  
Yu Wen Wang ◽  
Feng Wei ◽  
Jiang Yu
Keyword(s):  
Indoor Environment ◽  
Arrival Time ◽  
Channel Model ◽  
Indoor Positioning ◽  
Superior Performance ◽  
Line Of Sight ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Software Simulation ◽  
Positioning Algorithm

Currently, there is an urgent need for indoor positioning technology. Considering the complexity of indoor environment, this paper proposes a new positioning algorithm (N-CHAN) via the analysis of the error of arrival time positioning (TOA) and the channels of S-V model. It overcomes an obvious shortcoming that the accuracy of traditional CHAN algorithm effected by no-line-of-sight (NLOS). Finally, though MATLAB software simulation, we prove that N-CHAN’s superior performance in NLOS in the S-V channel model, which has a positioning accuracy of centimeter-level and can effectively eliminate the influence of NLOS error on positioning accuracy. Moreover, the N-CHAN can effectively improve the positioning accuracy of the system, especially in the conditions of larger NLOS error.

Super-Resolution Time-Delays Estimation in HF Channel Sounding Based on Chirp Sequence

2011 ◽  
Vol 204-210 ◽  
pp. 2133-2139
Author(s):  
Long Fei Fu ◽  
Gang Xin ◽  
Shui Lian Zhang
Keyword(s):  
Time Delay ◽  
Time Delays ◽  
Measurement Data ◽  
Super Resolution ◽  
Wide Band ◽  
Estimation Problem ◽  
Delay Model ◽  
Music Algorithm ◽  
Problem Of Time ◽  
Hf Channel

According to the characteristics of HF channel and chirp signal, an innovative multipath time-delay model of wide-band HF channel was proposed, by which the estimation problem of time-delay was converted into an estimation problem of spectrum.Then the MUSIC algorithm with super-resolution ability was applied to the problem above. The feasibility of estimating multipath time-delays based on single measurement data was deeply discussed. Meanwhile, the performance of applying MUSIC and root MUSIC algorithm to the model proposed in the paper was presented. The simulation results suggested that the method proposed in the paper owned super-resolution ability and robust in estimation of multipath time-delay.

Intelligent Three-dimensional Node Localization Algorithm Using Dynamic Path Planning

2021 ◽  
Vol 14 ◽  
Author(s):  
Songhao Jia ◽  
Cai Yang ◽  
Xing Chen ◽  
Yan Liu ◽  
Fangfang Li
Keyword(s):  
Path Planning ◽  
Dynamic Stiffness ◽  
Three Dimensional ◽  
Localization Algorithm ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Dynamic Path Planning ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Dynamic Path

Background: In the applications of wireless sensor network technology, three-dimensional node location technology is crucial. The process of node localization has some disadvantages, such as the uneven distribution of anchor nodes and the high cost of the network. Therefore, the mobile anchor nodes are introduced to effectively solve accurate positioning. Objective: Considering the estimated distance error, the received signal strength indication technology is used to optimize the measurement of the distance. At the same time, dynamic stiffness planning is introduced to increase virtual anchor nodes. Moreover, the bird swarm algorithm is also used to solve the optimal location problem of nodes. Method: Firstly, the dynamic path is introduced to increase the number of virtual anchor nodes. At the same time, the improved RSSI distance measurement technology is introduced to the node localization. Then, an intelligent three-dimensional node localization algorithm based on dynamic path planning is proposed. Finally, the proposed algorithm is compared with similar algorithms through simulation experiments. Results: Simulation results show that the node coordinates obtained by the proposed algorithm are more accurate, and the node positioning accuracy is improved. The execution time and network coverage of the algorithm are better than similar algorithms. Conclusion: The proposed algorithm significantly improves the accuracy of node positioning. However, the traffic of the algorithm is increased. A little increase in traffic in exchange for positioning accuracy is worthy of recognition. The simulation results show that the proposed algorithm is robust and can be implemented and promoted in the future.

scholarly journals An Enhanced Distributed Localization Algorithm Based on MDS-MAP in Wireless Sensor Networks

2017 ◽  
Vol 13 (03) ◽  
pp. 27 ◽  
Author(s):  
Lu Zhang ◽  
Hailun Wang ◽  
Zhiyong Hu ◽  
Deyong Wang
Keyword(s):  
Global Positioning System ◽  
Localization Algorithm ◽  
Font Size ◽  
Positioning Accuracy ◽  
Map Algorithm ◽  
Global Positioning ◽  
The Matrix ◽  
Centralized Algorithm ◽  
Absolute Coordinates ◽  
High Degree

<span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-fareast-font-family: 'Times New Roman'; mso-fareast-language: DE; mso-bidi-font-size: 9.0pt; mso-ansi-language: EN-US; mso-bidi-language: AR-SA;">The classical MDS-MAP algorithm is a centralized algorithm, with an increase in nodes, the algorithm attains a high degree of complexity. In order to solve the shortcomings of the positioning accuracy and the computational complexity of the matrix in the classical MDS-MAP algorithm, an enhanced distributed MDS-MAP localization algorithm was designed and realized (EMDS-MAP(D)). The EMDS-MAP(D) </span><span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-fareast-font-family: 'Times New Roman'; mso-fareast-language: DE; mso-ansi-language: EN-US; mso-bidi-language: AR-SA;">algorithm </span><span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-fareast-font-family: 'Times New Roman'; mso-fareast-language: DE; mso-bidi-font-size: 9.0pt; mso-ansi-language: EN-US; mso-bidi-language: AR-SA;">does not need auxiliary hardware facilities, and can be used for the local computation of nodes, thereby reducing the amount of computation and communication .It is suitable for a shielding environment. The algorithm calculates the coordinates of relative nodes without the anchor node, only transformation absolute coordinates need a Global Positioning System (GPS) to locate a certain amount of coordinates (usually less than 10) and the number of the positioning coordinates does not depend on the size of the network. Theoretical analysis and simulation experimental results show that EMDS-MAP(D) can realize distributed computing and improve the positioning accuracy of the node.</span>

scholarly journals Robust and Fast State Estimation for Poorly-Observable Low Voltage Distribution Networks Based on the Kalman Filter Algorithm

Energies ◽  
2019 ◽  
Vol 12 (23) ◽  
pp. 4457 ◽  
Author(s):  
Antončič ◽  
Papič ◽  
Blažič
Keyword(s):  
Kalman Filter ◽  
State Estimation ◽  
Low Voltage ◽  
Least Squares Method ◽  
Weighted Least Squares ◽  
Measurement Data ◽  
Estimation Algorithm ◽  
Distribution Networks ◽  
Voltage Distribution ◽  
State Estimator

This paper presents a novel approach for the state estimation of poorly-observable low voltage distribution networks, characterized by intermittent and erroneous measurements. The developed state estimation algorithm is based on the Extended Kalman filter, where we have modified the execution of the filtering process. Namely, we have fixed the Kalman gain and Jacobian matrices to constant matrices; their values change only after a larger disturbance in the network. This allows for a fast and robust estimation of the network state. The performance of the proposed state-estimation algorithm is validated by means of simulations of an actual low-voltage network with actual field measurement data. Two different cases are presented. The results of the developed state estimator are compared to a classical estimator based on the weighted least squares method. The comparison shows that the developed state estimator outperforms the classical one in terms of calculation speed and, in case of spurious measurements errors, also in terms of accuracy.

scholarly journals Amplitude estimation without phase estimation

2020 ◽  
Vol 19 (2) ◽  
Author(s):  
Yohichi Suzuki ◽  
Shumpei Uno ◽  
Rudy Raymond ◽  
Tomoki Tanaka ◽  
Tamiya Onodera ◽  
...  
Keyword(s):  
Measurement Data ◽  
Likelihood Estimation ◽  
Estimation Algorithm ◽  
Quantum Circuits ◽  
Phase Estimation ◽  
Amplitude Estimation ◽  
Quantum Amplitude ◽  
Phase Estimation Algorithm ◽  
Near Term ◽  
Quantum Speedup

AbstractThis paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.

Sign in / Sign up

Export Citation Format

Share Document