2014
DOI: 10.1109/taes.2014.120460
|View full text |Cite
|
Sign up to set email alerts
|

Efficient acquisition algorithm for long pseudorandom sequence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Each of the sequences in are generated using which fulfills the necessary condition mentioned in ( 6 ). The probability of the correct detection of approaches unity at dB, as mentioned in [ 36 ].…”
Section: Guard Intervalmentioning
confidence: 83%
See 1 more Smart Citation
“…Each of the sequences in are generated using which fulfills the necessary condition mentioned in ( 6 ). The probability of the correct detection of approaches unity at dB, as mentioned in [ 36 ].…”
Section: Guard Intervalmentioning
confidence: 83%
“…It can be observed that eOFDM performs better than CP/TDS OFDM for the given range of SNR. This SNR gain is the result of the high probability of detection of or G data symbols in the block, as mentioned in [ 36 ]. The SNR gain for the given BER is more prominent in Figure 6 .…”
Section: Numerical Resultsmentioning
confidence: 99%
“…However, the outputs of this generator are not entirely random. The generation of PN sequences plays a crucial role in the digital communication, cryptography, and computer game industries [1][2][3][4][5][6].…”
Section: Introductionmentioning
confidence: 99%