2010
DOI: 10.1016/j.sigpro.2010.01.026
|View full text |Cite
|
Sign up to set email alerts
|

Data compression using SVD and Fisher information for radar emitter location

Abstract: This paper presents a data compression method that can achieve a very large compression ratio for radar pulse trains that are to be used for time-difference-of-arrival/frequency-difference-ofarrival (TDOA/FDOA) multiple-platform emitter location; this method exploits pulse-to-pulse redundancy to get a compression ratio much higher than possible using standard compression methods. We show how to use (i) the ability of the singular value decomposition (SVD) to exploit redundancy between radar pulses, and (ii) a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0
1

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 20 publications
0
8
0
1
Order By: Relevance
“…Besides, every matrix is guaranteed to have a SVD and, due to its properties, this is a technique that has been widely used for data compression. 58 Based on all of the above, we use the rank-h SVD of the input matrix X to obtain the weights of the first layer. As mentioned, the full SVD of X is a factorization of the matrix of the form:…”
Section: Learning the First Layermentioning
confidence: 99%
“…Besides, every matrix is guaranteed to have a SVD and, due to its properties, this is a technique that has been widely used for data compression. 58 Based on all of the above, we use the rank-h SVD of the input matrix X to obtain the weights of the first layer. As mentioned, the full SVD of X is a factorization of the matrix of the form:…”
Section: Learning the First Layermentioning
confidence: 99%
“…r is the number of non-zero singular values, is the ith left singular vector and is Hermitian of the ith right singular vector. By truncating the above summation to terms, we get a rank-k matrix X k that approximates X better than any other rank-k matrix in the least square error sense [16], [17], [18]. This is the main idea of SVD data compression.…”
Section: An Svd Approach For Caf Data Compressionmentioning
confidence: 99%
“…The effect of the noise on the singular values is spread across all the singular values but, as mentioned before, most of the data is concentrated in the first few singular vectors and values. Thus, by SVD truncation we reduce the noise and equivalently we increase the signal to noise ratio (SNR) [18].…”
Section: An Svd Approach For Caf Data Compressionmentioning
confidence: 99%
“…By doing so communication traffic can be greatly reduced, minimizing the need of storing or transmitting large amount of multichannel data. Data reduction could consist either in the extraction of relevant information (such as time of flight or energy [11,12]) from the acquired waveform, or in signal compression. When the information extraction task is too much computationally onerous to be performed on a local embedded processor, the best option is to compress efficiently the acquired signal, and then to transmit it to a central unit where the signal is recovered and the processing is performed [13,14].…”
Section: Introductionmentioning
confidence: 99%