摘要:
A blanking scheme for mitigating impulsive noise in wireless networks is based on the signal-to-noise ratio (SNR) of symbols. To fully gain the benefits of the SNR-based blanking scheme, two methods are developed, namely a multi-level thresholding scheme in the time-, spatial- and frequency-domains, and a weighted-input error-correction decoding. The symbols are conditioned as a function of the estimated SNR in time-, frequency-, or spatial-domains or combinations therefore, and the conditioning is applied to an amplitude, phase, or energy level, or combinations thereof.
摘要:
A blanking scheme for mitigating impulsive noise in wireless networks is based on the signal-to-noise ratio (SNR) of symbols. To fully gain the benefits of the SNR-based blanking scheme, two methods are developed, namely a multi-level thresholding scheme in the time-, spatial- and frequency-domains, and a weighted-input error-correction decoding. The symbols are conditioned as a function of the estimated SNR in time-, frequency-, or spatial-domains or combinations therefore, and the conditioning is applied to an amplitude, phase, or energy level, or combinations thereof.
摘要:
A method surpresses clutter in a space-time adaptive processing system. The method achieves low-complexity computation via two steps. First, the method utilizes an improved fast approximated power iteration method to compress the data into a much smaller subspace. To further reduce the computational complexity, a progressive singular value decomposition (SVD) approach is employed to update the inverse of the covariance matrix of the compressed data. As a result, the proposed low-complexity STAP procedure can achieve near-optimal performance with order-of-magnitude computational complexity reduction as compared to the conventional STAP procedure.
摘要:
A method surpresses clutter in a space-time adaptive processing system. The method achieves low-complexity computation via two steps. First, the method utilizes an improved fast approximated power iteration method to compress the data into a much smaller subspace. To further reduce the computational complexity, a progressive singular value decomposition (SVD) approach is employed to update the inverse of the covariance matrix of the compressed data. As a result, the proposed low-complexity STAP procedure can achieve near-optimal performance with order-of-magnitude computational complexity reduction as compared to the conventional STAP procedure.
摘要:
A method for detecting a target in a non-homogeneous environment using a space-time adaptive processing of a radar signal includes normalizing training data of the non-homogeneous environment to produce normalized training data; determining a normalized sample covariance matrix representing the normalized training data; tracking a subspace represented by the normalized sample covariance matrix to produce a clutter subspace matrix; determining a test statistic representing a likelihood of a presence of the target in the radar signal based on the clutter subspace matrix and a steering vector; and comparing the test statistic with a threshold to detect the target.
摘要:
A method detects a target in a radar signal using space-time adaptive processing. A test statistic is T = max α max λ ∫ R f 1 ( x 0 , x 1 , … , x K ❘ α , λ , R ) p ( R ) ⅆ R max λ ∫ R f 0 ( x 0 , x 1 , … , x K ❘ λ , R ) p ( R ) ⅆ R , where x0 is a test signal, xk are K training signals, α is an unknown amplitude of a target signal within the test signal, λ is a scaling factor, R is a covariance matrix of the training signals, and a function max returns a maximum values. The test statistic is compared to a threshold to determine whether the target is present, or not.
摘要翻译:一种方法使用空时自适应处理来检测雷达信号中的目标。 一个检验统计量是T = maxα最大λ∫∫R f 1(x 0,x 1,...,x K |α,λ,R)p(R) ∫R f 0(x 0,x 1,...,x K |λ,R)p(R)ⅆR,其中x0是测试信号,xk是K个训练信号,α是 在测试信号内的目标信号的未知振幅,λ是比例因子,R是训练信号的协方差矩阵,函数max返回最大值。 将测试统计量与阈值进行比较,以确定目标是否存在。
摘要:
A method provides space-time adaptive processing (STAP) for target detection using adaptive matched filters (AMF). A generalized likelihood ratio test (GLRT) is determined where spatial and temporal correlation matrices Q and A are assumed. Then, the correlation matrices A and Q are replaced with maximum likelihood (ML) estimates obtained only from training signals subject to a persymmetric constraint.
摘要:
A method for detecting a target in a non-homogeneous environment using a space-time adaptive processing of a radar signal includes normalizing training data of the non-homogeneous environment to produce normalized training data; determining a normalized sample covariance matrix representing the normalized training data; tracking a subspace represented by the normalized sample covariance matrix to produce a clutter subspace matrix; determining a test statistic representing a likelihood of a presence of the target in the radar signal based on the clutter subspace matrix and a steering vector; and comparing the test statistic with a threshold to detect the target.
摘要:
A wireless network master node periodically broadcasts beacons that specify a structure of a following fixed length superframe. Slave nodes determine a channel condition between each slave and the master. Then, the set of slaves is partitioned into subsets of slaves according to the channel conditions. The master assigns, to each slave, a transmission rate in a low to high order according to the channel conditions, and the slaves transmit data to the master in the low to high order between two consecutive beacons, wherein the subsets of slaves with a higher transmission rate also receive the data from the subsets of slaves with a lower transmission rate, and wherein a slave with a higher transmission rate includes a part of or all the data from a slave with a lower transmission rate.
摘要:
A method provides space-time adaptive processing (STAP) for target detection using adaptive matched filters (AMF). A generalized likelihood ratio test (GLRT) is determined where spatial and temporal correlation matrices Q and A are assumed. Then, the correlation matrices A and Q are replaced with maximum likelihood (ML) estimates obtained only from training signals subject to a persymmetric constraint.