2016 First IEEE International Conference on Computer Communication and the Internet (ICCCI) 2016
DOI: 10.1109/cci.2016.7778932
|View full text |Cite
|
Sign up to set email alerts
|

Sparsity analysis of FH-BPSK signals via K-SVD dictionary learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…It takes the complex baseband samples as input and outputs the estimation delayτ . To achieve a fast synchronisation algorithm (running at F s ), a limited complexity is required and, thus, methods using maximum likelihood [11], wavelet transform [12] or machine learning [13] can not be used. The proposed algorithm relies on Fourier transform to detect the signal hop with a high time resolution.…”
Section: A Proposed Approachmentioning
confidence: 99%
“…It takes the complex baseband samples as input and outputs the estimation delayτ . To achieve a fast synchronisation algorithm (running at F s ), a limited complexity is required and, thus, methods using maximum likelihood [11], wavelet transform [12] or machine learning [13] can not be used. The proposed algorithm relies on Fourier transform to detect the signal hop with a high time resolution.…”
Section: A Proposed Approachmentioning
confidence: 99%