WO2015192696A1 - 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 - Google Patents
分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 Download PDFInfo
- Publication number
- WO2015192696A1 WO2015192696A1 PCT/CN2015/078172 CN2015078172W WO2015192696A1 WO 2015192696 A1 WO2015192696 A1 WO 2015192696A1 CN 2015078172 W CN2015078172 W CN 2015078172W WO 2015192696 A1 WO2015192696 A1 WO 2015192696A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- iteration
- receiving node
- value
- gossip
- vector
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Z—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
- G16Z99/00—Subject matter not provided for in other main groups of this subclass
Definitions
- the invention relates to a multi-objective DOA estimation system and an estimation method based on gossip algorithm in a distributed network.
- the DOA estimation of applying the gossip algorithm to a distributed network is mainly to share information between nodes to obtain a DOA estimate for each node.
- the original DOA algorithm such as the CAPON algorithm for distributed DOA estimation
- matrix inversion is not easy to achieve, this can cause a lot of interference in a multi-target scenario. Therefore, it is of great significance to seek a DOA estimation algorithm that does not require matrix inversion and combine the gossip algorithm for DOA estimation in distributed networks.
- the technical problem to be solved by the present invention is to propose a multi-objective DOA estimation system and estimation method based on gossip algorithm in a distributed network, and can realize information sharing and DOA value in a distributed network without a matrix inversion method. estimate.
- the present invention is implemented as follows:
- a multi-objective DOA estimation method based on gossip algorithm in a distributed network comprising the following steps:
- the gossip iteration is performed on the ⁇ th signal data vector according to the ⁇ th iteration rule, and after each iteration, it is determined whether the ⁇ th signal data vector is equal to before the iteration, and if so, recording and accumulating Equal number of times, otherwise the number of equals is zeroed; wherein, the initial value of ⁇ is 1, and the ⁇ signal data vector is constructed by using the initial values of the receiving nodes in the ⁇ th iteration period;
- the iteration of the ⁇ th iteration period is completed, and the ⁇ th signal data vector at this time is stored, and each of the ⁇ th signal data vectors is received.
- the signal of the node is taken as the initial value of each receiving node in the ⁇ +1 iteration period;
- the above steps are executed cyclically.
- the value of ⁇ is increased by 1 from the value of ⁇ in the previous cycle.
- the calculation formula of the estimated value of DOA is used according to the iterative result of each iteration period.
- the DOA estimate is calculated; the preset value is the number of iteration cycles required to calculate the DOA estimate based on the calculation formula of the DOA estimate.
- a multi-objective DOA estimation system based on gossip algorithm in distributed network comprising:
- a loop iteration module configured to perform a gossip iteration on the ⁇ th signal data vector according to the ⁇ th iteration rule in the ⁇ th iteration period, and after each iteration, determine whether the ⁇ th signal data vector is equal to before the iteration, if Yes, then record and accumulate the same number of times, otherwise return the equal number of times; wherein, the initial value of ⁇ is 1, the ⁇ signal data vector is constructed by using the initial values of the receiving nodes in the ⁇ iteration period; When the equal number of times reaches the preset number, and the value of ⁇ does not reach the preset value, the iteration of the ⁇ th iteration period is completed, and the ⁇ th signal data vector at this time is stored, and the signals of the receiving nodes in the ⁇ th signal data vector are obtained. As the initial value of each receiving node in the ⁇ +1 iteration cycle; cyclically performing the above steps, each time the cycle, the value of ⁇ is increased by 1 from the value of ⁇ in the
- a DOA estimation value calculation module configured to calculate a DOA estimation value by using a calculation formula of the DOA estimation value according to an iteration result of each iteration period when the value of ⁇ reaches a preset value; the preset value is based on the DOA estimation value
- the calculation formula calculates the number of iteration cycles required for the DOA estimate.
- the present invention calculates the number of iteration cycles required for calculating the DOA estimation value according to the calculation formula of the DOA estimation value, and uses the gossip algorithm to continuously update the signal component of the DOA estimation to an ideal for information sharing. State, after all iterations have been performed, a good estimate of the DOA can be obtained.
- the invention does not require a matrix inversion method, and can realize information sharing and DOA value estimation in a distributed network.
- FIG. 1 is a schematic flowchart of a multi-target DOA estimation method based on a gossip algorithm in a distributed network according to an embodiment of the present invention
- FIG. 2 is a schematic diagram of a composition of a multi-target DOA estimation system based on a gossip algorithm in a distributed network according to an embodiment of the present invention
- FIG. 3 is a schematic diagram of values obtained in each step of the multi-objective DOA estimation method based on the gossip algorithm in the distributed network provided by the embodiment of the present invention.
- the invention takes a wireless communication distributed system composed of three transmitting array elements and three receiving array elements as an example, and illustrates a process of implementing DOA estimation by using a gossip iterative algorithm combined with an AV algorithm.
- the gossip method is a more effective method, and for the inverse operation of the autocorrelation matrix of the distributed signal, the present invention can obtain the optimal weight without the inverse of the matrix.
- the AV algorithm finally implements DOA estimation in a distributed network.
- FIG. 1 is a schematic flowchart of a multi-objective DOA estimation method based on the gossip algorithm in a distributed network according to an embodiment of the present invention
- FIG. 2 is a diagram showing a multi-target DOA estimation based on a gossip algorithm in a distributed network according to an embodiment of the present invention. Schematic diagram of system composition.
- the random gossip algorithm can be used to solve the distributed convex problem, given the initial scalar value of a random N-node network and the ith node.
- the purpose of the random gossip algorithm is to achieve an average of all targets by using only local information and local processing and an iterative mechanism.
- g(t) [g 1 (t),...,g N (t)] T (0.1) (Note, “(0.1)” indicates the number of the formula, not part of the formula, subsequent formulas The same reason.)
- each node runs an independent Poisson clock.
- the node randomly selects a neighboring j-node with probability p i,j and communicates with it.
- the general vector representation of the Gossip algorithm is
- T is an N-dimensional vector whose i-th element is 1.
- U(t) is a double backward random matrix and the network is connected, it can ensure that all nodes in the network can converge to the mean g ave .
- the most important task is to define the initial vector g(0) for all nodes.
- d k (0) is the initial distance between the target and the origin at time 0.
- the i-th transmitting node continuous time transmit waveform is represented as x i (t)e j2 ⁇ ft , where f is the carrier frequency and all transmitting nodes use the same carrier frequency, and x i (t) is the periodic narrow-band signal with T p .
- the received signal of the kth target can be expressed as
- the latter assumption is based on the far-field assumption that the distance between network nodes is much smaller than the distance between the nodes and the target. Therefore, since the nodes are close together, it can be considered that all receiving nodes see the same surface of the target.
- the signal received by the lth receiver is expressed as follows
- ⁇ l (t) represents an independent and identical distribution with a mean of 0 and a Gaussian noise with a variance of ⁇ 2 .
- the sampled signal can be regarded as the synchronization signal of the information reflected by the first target, and since the transmitted waveform is a narrowband signal, the delay in the transmitted waveform x i (t) can be ignored, only Consider the delay of the phase part. Therefore, the received baseband signal of the lth receiving end can be approximated as
- ⁇ lm [ ⁇ l ((m-1)T+0T s ),... ⁇ l ((m-1)T+(L-1)T s )] T (0.13)
- the transmit waveform of each transmit antenna is independent, therefore, relative In terms of i ⁇ i' It is negligible.
- the conventional CAPON algorithm produces a beamforming vector w that can suppress noise, while the interference and noise are suppressed, while the desired signal remains undistorted.
- w can be expressed as follows:
- the LS method is applied to the beamforming output by w * , and the estimation of the target reflection coefficient can be easily obtained based on the assumption of the third point as follows:
- auxiliary vector (AV) technique In the traditional capon algorithm, in order to obtain the optimal weight in the formula (0.18), matrix inversion operation is required, but in distributed signal processing, matrix inversion is not easy to implement. Therefore, another method that does not require matrix inversion can be used to obtain an optimal weight vector, namely the auxiliary vector (AV) technique.
- the traditional AV algorithm is mainly applied to the space-time filtering of the antenna array, and can be directly applied to the DOA estimation problem.
- the optimal weight vector based on AV technology can be expressed as
- G( ⁇ ) is chosen to be able to process data with v r ( ⁇ )
- the amplitude of the cross-correlation function with the AV processed data G( ⁇ ) H Z is maximized.
- v r ( ⁇ ) is orthogonal to each other, so that The largest AVG( ⁇ ) can extract the perturbation component of most beamforming outputs.
- the optimal AVG( ⁇ ) can be obtained according to the following formula.
- a single AV G( ⁇ ) usually represents a degree of freedom, and if you need to increase the resolution, you can use multiple auxiliary vectors.
- the beam synthesis weight vector can be expressed as follows
- the estimated value of the target reflection coefficient becomes
- the target reflection coefficient is estimated as
- each receiving node i in the WSN has two initial values in each given time slot.
- N r vector Expressed as the initial value of the N r node
- Each node jointly transmits a signal, and at the same time, each node receives a signal and constructs an initial signal based on the received signal, the initial signal being represented as Where i is the serial number of the node and ⁇ is the angle;
- ⁇ represents the wavelength of the transmitted signal
- z i (l-1) represents the received signal of the i-th node at the l-1th sampling point
- L represents the number of sampling points
- x m is the transmitted waveform.
- Multi-objective DOA estimation method based on gossip algorithm in distributed network
- the gossip estimation method introduced above can be considered as an extension of distributed delay and beam sum, and is only used to receive spatial signals.
- the main disadvantage is the use of R EE instead of R in equation (0.18). Assuming that there are multiple targets in the system or that the length L of the waveform is not long enough, its performance will be seriously degraded.
- an iterative random gossip algorithm (IR-Gossip) (0.21) using AV technology is proposed.
- each receiving node i in the WSN has an initial value for a given time interval
- the node obtains a steady state by some iterations t 2 -t 1 In the third loop, you can get the new initial value of t 2 ,
- the node reaches a steady state by a certain number of iterations t 3 -t 2 get
- the node reaches a steady state by a certain number of iterations t 3 -t 2
- the fourth cycle get the initial value of the new t 3
- the node reaches a steady state by a certain number of iterations t 4 -t 3 Can get
- each node i has an initial value at t 4
- the receiving node reaches a steady state by a certain number of iterations t 6 -t 5 Can get
- ⁇ 6 ( ⁇ ) can be obtained directly without the need for a cyclic operation.
- the DOA estimation method includes the following steps:
- Step S1 performing a gossip iteration on the ⁇ th signal data vector according to the ⁇ th iteration rule in the ⁇ th iteration period, and determining, after each iteration, whether the ⁇ th signal data vector is equal to before the iteration, and if so, Recording and accumulating the number of equal times, otherwise returning the number of equals to zero; wherein the initial value of ⁇ is 1, and the ⁇ signal data vector is constructed by using the initial values of the receiving nodes in the ⁇ th iteration period;
- Step S2 When the equal number of times reaches the preset number of times, and the value of ⁇ does not reach the preset value, the iteration of the ⁇ th iteration period is completed, and the ⁇ th signal data vector at this time is stored, and the ⁇ th signal data vector is obtained.
- the signals of the receiving nodes in the middle are used as initial values of the receiving nodes in the ⁇ +1 iteration period;
- Step S3 cyclically executing the above steps.
- the value of ⁇ is increased by 1 from the value of ⁇ in the previous cycle.
- the DOA estimation value is used according to the iterative result of each iteration period.
- the calculation formula calculates a DOA estimate; the preset value is the number of iteration cycles required to calculate the DOA estimate based on the calculation formula of the DOA estimate.
- the preset value is 6.
- Each receiving node receives the initial signal z i (l-1) and according to Construct the initial value of each node in the first iteration cycle
- ⁇ represents the wavelength of the transmitted signal
- the approximate distance z i (l-1) of the target representing the angle ⁇ and the ith receiving node represents the received signal of the i-th node at the l-1th sampling point
- L represents the number of sampling points
- [ ] * represents a conjugate operation
- N r G-dimensional vectors Forming a first signal data vector; wherein N r is the number of receiving nodes, and G is a discretization precision of the angular space;
- Each receiving node Stored in N r GL dimension vector Forming a second signal data vector
- Each receiving node Stored in N r GL dimension vector Forming a third signal data vector
- the fifth iteration rule Iterating the fifth signal data vector wherein Represents the gossip update matrix, An identity matrix representing N r GL, where e GLi represents a GL dimension vector in which the i-th GL-GL-1 element to the i-th GL element are 1 and the other elements are 0;
- each node produces a rough DOA estimate.
- the sixth iteration rule Iterating the sixth signal data vector wherein Represents the gossip update matrix, An identity matrix representing N r G, where e Gi represents a G-dimensional vector in which the i-th G-G-1th element to the i-th element are 1 and the other elements are 0;
- each node produces a rough DOA estimate.
- each node gets an accurate DOA estimate based on the formula (0.48).
- FIG. 3 is a schematic diagram of values obtained in each step of the DOA estimation method based on the gossip algorithm in the distributed wireless sensor network according to an embodiment of the present invention. Starting from the fifth cycle (t>t 4 ), the IR-Gossip algorithm begins to generate valid DOA estimates.
- the present invention also provides a multi-objective DOA estimation system based on the gossip algorithm in a distributed network.
- the system includes a loop iteration module 1 and a DOA estimate calculation module 2.
- the loop iteration module 1 is configured to perform gossip iteration on the ⁇ th signal data vector according to the ⁇ th iteration rule in the ⁇ th iteration period, and after each iteration, determine whether the ⁇ th signal data vector is equal to before the iteration.
- the initial value of ⁇ is 1, and the ⁇ signal data vector is constructed by using the initial values of the receiving nodes in the ⁇ iteration period;
- the phase When the number of times reaches the preset number and the value of ⁇ does not reach the preset value, the iteration of the ⁇ th iteration period is completed, and the ⁇ th signal data vector at this time is stored, and the signals of the receiving nodes in the ⁇ th signal data vector are obtained.
- the initial value of each receiving node in the ⁇ +1 iteration cycle the above steps are executed cyclically, and the value of ⁇ is increased by one from the value of ⁇ in the previous cycle.
- the DOA estimation value calculation module 2 is configured to calculate a DOA estimation value by using a calculation formula of the DOA estimation value according to an iteration result of each iteration period when the value of ⁇ reaches a preset value; the preset value is according to the DOA estimation value.
- the calculation formula calculates the number of iteration cycles required for the DOA estimate.
- the working principle and working process of the system can refer to the above DOA estimation method, and will not be described again.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Optical Communication System (AREA)
- Variable-Direction Aerials And Aerial Arrays (AREA)
Abstract
Description
Claims (10)
- 一种分布式网络中基于gossip算法的多目标DOA估计方法,其特征在于,包括如下步骤:在第φ迭代周期中,根据第φ迭代规则对所述第φ信号数据向量进行gossip迭代,每次迭代后,判断所述第φ信号数据向量与迭代前是否相等,如果是,则记录并累加相等次数,否则将相等次数归零;其中,φ的初始值为1,所述第φ信号数据向量利用第φ迭代周期中各接收节点的初始值构建得到;当所述相等次数达到预设次数,且φ的值未达到预设值时,完成第φ迭代周期的迭代,并储存此时的第φ信号数据向量,并将第φ信号数据向量中各接收节点的信号作为第φ+1迭代周期中各接收节点的初始值;循环执行上述各步骤,每次循环时,φ的值比上一循环中φ的值增加1,当φ的值达到预设值时,根据各迭代周期的迭代结果,利用DOA估计值的计算公式计算DOA估计值;所述预设值为根据所述DOA估计值的计算公式计算DOA估计值所需要的迭代周期数。
- 如权利要求1所述的多目标DOA估计方法,其特征在于,所述预设值为6。
- 如权利要求2所述的多目标DOA估计方法,其特征在于,当φ=1时,所述D0A估计方法包括如下步骤:各接收节点接收初始信号zi(l-1),并根据构建第一迭代周期中各节点的初始值其中,λ表示发射信号的波长,表示角度为θ的目标与第i接收节点的近似距离zi(l-1)表示第i节点在第l-1采样点的接收信号,L表示采样点数目,[]*表示共轭操作;当相等次数CT达到预设次数CT时,储存当前每个接收节点的信号并将其作为第二迭代周期中各接收节点的初始值;其中:CT=ρNr,ρ是预设的常数;其中,t1表示实现第一迭代周期信息共 享所耗费的迭代次数,Nr为接收节点个数,λ表示发射信号的波长,角度为θ的目标与第i接收节点的近似距离,zi(l-1)表示第i节点在采样点l-1的接收信号,L表示采样点数目;
- 如权利要求3所述的多目标DOA估计方法,其特征在于,当φ=2时,所述DOA估计方法包括如下步骤:根据第二迭代规则对第二信号数据向量进行迭代;其中,
- 如权利要求4所述的多目标DOA估计方法,其特征在于,当φ=3时,所述DOA估计方法包括如下步骤:根据第三迭代规则对第三信号数据向量进行迭代;其中,
- 如权利要求5所述的多目标DOA估计方法,其特征在于,当φ=4时,所述DOA估计方法包括如下步骤:根据第四迭代规则对所述第四信号数据向量进行迭代;其中,当C>CT=ρNr时,根据得到γ3(θ),并存储当前每个接收节点的γ1(θ),γ2(θ),γ3(θ),并将存储的当前每个接收节点的γ1(θ),γ2(θ),γ3(θ)作为第五迭代周期中各接收节点的初始值;其中:由第二迭代周期结束时获得;由第三迭代周期结束时获得;由第四迭代周期结束时获得,t4为实现第四迭代周期信息共享所耗费的迭代次数;
- 如权利要求6所述的多目标DOA估计方法,其特征在于,当φ=5时,所述DOA估计方法的包括如下步骤:根据计算γ6(θ);其中,L为采样点的个数,Mt为发射节点个数,xm为第m发射节点的发射信号,Rx为发射信号的自相关矩阵,λ表示发射信号的波长,表示第m发射节点与角度为θ的目标之间的近似距离,表示角度为θ的目标与第i接收节点的近似距离,[]*表示共轭操作,[]T表示转置操作;
- 如权利要求7所述的多目标DOA估计方法,其特征在于,当φ=6时, 所述DOA估计方法包括如下步骤:
- 一种分布式网络中基于gossip算法的多目标DOA估计系统,其特征在于,包括:循环迭代模块,用于在第φ迭代周期中,根据第φ迭代规则对所述第φ信号数据向量进行gossip迭代,每次迭代后,判断所述第φ信号数据向量与迭代前是否相等,如果是,则记录并累加相等次数,否则将相等次数归零;其中,φ的初始值为1,所述第φ信号数据向量利用第φ迭代周期中各接收节点的初 始值构建得到;当所述相等次数达到预设次数,且φ的值未达到预设值时,完成第φ迭代周期的迭代,并储存此时的第φ信号数据向量,并将第φ信号数据向量中各接收节点的信号作为第φ+1迭代周期中各接收节点的初始值;循环执行上述各步骤,每次循环时,φ的值比上一循环中φ的值增加1;DOA估计值计算模块,用于当φ的值达到预设值时,根据各迭代周期的迭代结果,利用DOA估计值的计算公式计算DOA估计值;所述预设值为根据所述DOA估计值的计算公式计算DOA估计值所需要的迭代周期数。
- 如权利要求9所述的分布式网络中基于gossip算法的多目标DOA估计系统,其特征在于,所述预设值为6。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410281232.9 | 2014-06-20 | ||
CN201410281232.9A CN104023397B (zh) | 2014-06-20 | 2014-06-20 | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015192696A1 true WO2015192696A1 (zh) | 2015-12-23 |
Family
ID=51439911
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2015/078172 WO2015192696A1 (zh) | 2014-06-20 | 2015-05-03 | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN104023397B (zh) |
WO (1) | WO2015192696A1 (zh) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109143154A (zh) * | 2018-07-24 | 2019-01-04 | 南京航空航天大学 | 一种应用于l型阵列的信号二维doa与频率联合估计方法 |
CN109188345A (zh) * | 2018-08-27 | 2019-01-11 | 电子科技大学 | 基于去预延迟空时结构的相干信号源doa估计方法 |
CN110061770A (zh) * | 2019-03-27 | 2019-07-26 | 浙江理工大学 | 基于随机分组的无线传感器网络分布式波束形成方法 |
CN111181526A (zh) * | 2020-01-03 | 2020-05-19 | 广东工业大学 | 一种用于信号处理的滤波方法 |
CN113569195A (zh) * | 2021-07-19 | 2021-10-29 | 江南大学 | 一种用于分布式网络系统的预条件方法 |
US11196498B2 (en) * | 2018-03-08 | 2021-12-07 | Tsinghua University | High-precision time synchronization method |
CN115051924A (zh) * | 2022-06-08 | 2022-09-13 | 上海佰贝网络工程技术有限公司 | 基于数据广播的Gossip算法中通信方式协调方法、装置、设备、系统及介质 |
CN115119142A (zh) * | 2022-06-22 | 2022-09-27 | 杭州电子科技大学 | 一种基于传感器网络的分布式直接定位方法 |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104023397B (zh) * | 2014-06-20 | 2017-06-13 | 深圳大学 | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102866383A (zh) * | 2012-10-22 | 2013-01-09 | 重庆大学 | 一种基于空域自适应滤波的波达方向估计方法 |
CN103760519A (zh) * | 2014-01-24 | 2014-04-30 | 深圳大学 | 高分辨率doa估计方法及系统 |
CN104023397A (zh) * | 2014-06-20 | 2014-09-03 | 深圳大学 | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006067857A1 (ja) * | 2004-12-24 | 2006-06-29 | Fujitsu Limited | 到来方向推定装置及びプログラム |
-
2014
- 2014-06-20 CN CN201410281232.9A patent/CN104023397B/zh not_active Expired - Fee Related
-
2015
- 2015-05-03 WO PCT/CN2015/078172 patent/WO2015192696A1/zh active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102866383A (zh) * | 2012-10-22 | 2013-01-09 | 重庆大学 | 一种基于空域自适应滤波的波达方向估计方法 |
CN103760519A (zh) * | 2014-01-24 | 2014-04-30 | 深圳大学 | 高分辨率doa估计方法及系统 |
CN104023397A (zh) * | 2014-06-20 | 2014-09-03 | 深圳大学 | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 |
Non-Patent Citations (2)
Title |
---|
BOYD, STEPHEN ET AL.: "Randomized Gossip Algorithms", IEEE TRANSACTIOINS ON INFORMATION THEORY, vol. 52, no. 6, 30 June 2006 (2006-06-30), XP055244232 * |
GUO, JUNYING ET AL.: "DOA estimating base on distributed sub space method", JOURNAL OF GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY, vol. 33, no. 2, 30 April 2013 (2013-04-30) * |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11196498B2 (en) * | 2018-03-08 | 2021-12-07 | Tsinghua University | High-precision time synchronization method |
CN109143154A (zh) * | 2018-07-24 | 2019-01-04 | 南京航空航天大学 | 一种应用于l型阵列的信号二维doa与频率联合估计方法 |
CN109188345A (zh) * | 2018-08-27 | 2019-01-11 | 电子科技大学 | 基于去预延迟空时结构的相干信号源doa估计方法 |
CN109188345B (zh) * | 2018-08-27 | 2023-03-10 | 电子科技大学 | 基于去预延迟空时结构的相干信号源doa估计方法 |
CN110061770A (zh) * | 2019-03-27 | 2019-07-26 | 浙江理工大学 | 基于随机分组的无线传感器网络分布式波束形成方法 |
CN111181526A (zh) * | 2020-01-03 | 2020-05-19 | 广东工业大学 | 一种用于信号处理的滤波方法 |
CN111181526B (zh) * | 2020-01-03 | 2023-03-17 | 广东工业大学 | 一种用于信号处理的滤波方法 |
CN113569195A (zh) * | 2021-07-19 | 2021-10-29 | 江南大学 | 一种用于分布式网络系统的预条件方法 |
CN113569195B (zh) * | 2021-07-19 | 2023-12-01 | 江南大学 | 一种用于分布式网络系统的预条件方法 |
CN115051924A (zh) * | 2022-06-08 | 2022-09-13 | 上海佰贝网络工程技术有限公司 | 基于数据广播的Gossip算法中通信方式协调方法、装置、设备、系统及介质 |
CN115051924B (zh) * | 2022-06-08 | 2023-11-21 | 上海佰贝网络工程技术有限公司 | 基于数据广播的Gossip算法中通信方式协调方法、装置、设备、系统及介质 |
CN115119142A (zh) * | 2022-06-22 | 2022-09-27 | 杭州电子科技大学 | 一种基于传感器网络的分布式直接定位方法 |
Also Published As
Publication number | Publication date |
---|---|
CN104023397A (zh) | 2014-09-03 |
CN104023397B (zh) | 2017-06-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2015192696A1 (zh) | 分布式网络中基于gossip算法的多目标DOA估计系统及估计方法 | |
Einemo et al. | Weighted least squares algorithm for target localization in distributed MIMO radar | |
Tirer et al. | High resolution direct position determination of radio frequency sources | |
Gholami et al. | TDOA based positioning in the presence of unknown clock skew | |
Yang et al. | Phase synchronization for coherent MIMO radar: Algorithms and their analysis | |
CN108512787B (zh) | 大规模mimo系统的超精细信道估计方法 | |
CN107592671B (zh) | 一种网络化多智能体主动变拓扑的自主协同定位方法 | |
Noroozi et al. | Efficient closed-form solution for moving target localization in MIMO radars with minimum number of antennas | |
CN110809240A (zh) | 一种基于WiFi多维参数特征的室内目标被动跟踪方法 | |
Lu et al. | Novel energy-based localization technique for multiple sources | |
CN106656882B (zh) | 一种信号合成方法及系统 | |
CN109239649A (zh) | 一种阵列误差条件下的互质阵列doa估计新方法 | |
Zhong et al. | A distributed particle filtering approach for multiple acoustic source tracking using an acoustic vector sensor network | |
Rapinski et al. | ZigBee ranging using phase shift measurements | |
JP2021524590A (ja) | 波動に基づいた信号を用いて少なくとも1つの物体の位置特定を行うための位置特定方法及び位置特定システム | |
CN113777575A (zh) | 应用于复杂环境中mimo雷达多目标参数估计评估方法 | |
Rajan et al. | Relative kinematics of an anchorless network | |
Yin et al. | Single-step localization using multiple moving arrays in the presence of observer location errors | |
Li et al. | A precise ultra-wideband ranging method using pre-corrected strategy and particle swarm optimization algorithm | |
Wang et al. | Joint localization and communication study for intelligent reflecting surface aided wireless communication system | |
CN113360841B (zh) | 一种基于监督学习的分布式mimo雷达目标定位性能计算方法 | |
Zhong et al. | Constant modulus MIMO radar waveform design via iterative optimization network method | |
WO2015192695A1 (zh) | 分布式网络中基于gossip算法的单目标DOA估计系统及估计方法 | |
Kumar et al. | An efficient compartmental model for real-time node tracking over cognitive wireless sensor networks | |
Oshiga et al. | Superresolution multipoint ranging with optimized sampling via orthogonally designed golomb rulers |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15810393 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 15810393 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205N DATED 28/02/2017) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 15810393 Country of ref document: EP Kind code of ref document: A1 |