EUROCON 2007 - The International Conference on "Computer as a Tool" 2007
DOI: 10.1109/eurcon.2007.4400387
|View full text |Cite
|
Sign up to set email alerts
|

Methods of Increase of Short Chirp Signals Compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…In Fig. 2, some examples of chirp signal processing with the parameters listed below and the matched and unmatched spectra are shown (Pogribny et al, 2007). The chirp with BT = 37.5 consists of N = 76 samples, the number of convolutions is 2N −1 = 151, and the main lobe contains one sample only.…”
Section: Using Nonlinear Operations On Matched Filtering Resultsmentioning
confidence: 99%
“…In Fig. 2, some examples of chirp signal processing with the parameters listed below and the matched and unmatched spectra are shown (Pogribny et al, 2007). The chirp with BT = 37.5 consists of N = 76 samples, the number of convolutions is 2N −1 = 151, and the main lobe contains one sample only.…”
Section: Using Nonlinear Operations On Matched Filtering Resultsmentioning
confidence: 99%
“…An increase of BT leads in most cases to compression improvement, but as it is shown in this work, significant compression can be obtained even if the BT is within 1.5-3 only by using the proposed methods. Authors have found out that for short noisy chirp signals with small BT it is optimal to use the digital matched filtration on convolutions in time domain, and not 'fast convolutions' in frequency domain on the basis of DFT and IDFT [5] because of: 1) higher rate of matched filtration in the time domain based on transversal filters when each convolution is obtained during one sampling period T s . Such a filtration requires N parallel operations (where N is a number of signal samples) for obtaining all convolutions as opposed to the use of the fast convolutions which need N log 2 N operations; 2) better accuracy of calculations because a filtration in the time domain does not need as many transformations as a filtration based on the fast convolutions in the frequency domain.…”
Section: Introductionmentioning
confidence: 99%