2017
DOI: 10.1109/lcomm.2017.2745543
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced PRACH Preamble Detector for Cellular IoT Communications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 23 publications
(14 citation statements)
references
References 7 publications
0
14
0
Order By: Relevance
“…Generally, the preambles generated from the same root are completely orthogonal, and preambles generated from two different roots are nearly orthogonal [13]. To mitigate the interference among preambles generated from different root sequences, some published literature have specifically studied such correlations, and some results shown that their proposed preamble detectors can asymptotically achieve almost interference-free detection performance (i.e., nearly orthogonal) [40]. However, this is beyond the scope of this paper, and to focus on studying spatio-temporal model for RACH, we assume different preambles are completely orthogonal.…”
Section: B Contention-based Random Access Proceduresmentioning
confidence: 99%
“…Generally, the preambles generated from the same root are completely orthogonal, and preambles generated from two different roots are nearly orthogonal [13]. To mitigate the interference among preambles generated from different root sequences, some published literature have specifically studied such correlations, and some results shown that their proposed preamble detectors can asymptotically achieve almost interference-free detection performance (i.e., nearly orthogonal) [40]. However, this is beyond the scope of this paper, and to focus on studying spatio-temporal model for RACH, we assume different preambles are completely orthogonal.…”
Section: B Contention-based Random Access Proceduresmentioning
confidence: 99%
“…The most computing-power is consumed during the calculation of correlations, so we consider the total number of correlation operations as a performance metric of the computational complexity. In our proposed channel estimator, the total number of correlation operations can be expressed as [24]:…”
Section: Algorithm 1 Pilot Signal Reconstructionmentioning
confidence: 99%
“…Conventional grantbased random access (RA) protocols require control signaling and the scheduling of uplink access requests for granting of resources [3]- [6]. The physical random access channel (PRACH) protocol of Long-Term Evolution is one example of grant-based protocols, and can be classified into two categories: contention-free RA and contention-based RA [3]. For contention-free RA, the BS first allocates dedicated preambles to the active UEs, which are then transmitted by the UEs, and finally the BS responds to the requesting UEs without further contention resolution [4].…”
Section: Introductionmentioning
confidence: 99%