2017
DOI: 10.48550/arxiv.1712.07161
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Linear Block Coding for Efficient Beam Discovery in Millimeter Wave Communication Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…More specifically, at any given time t, a beamforming vector w t ∈ W S is selected sequentially as a function of previously observed signals (y t−1 ). We focus on strategies based on posterior matching, where the problem is connected to channel coding over a binary input channel with ([10], [11], [12]) and without ( [13]) feedback. We use the hierarchical posterior matching (hieP M ) scheme from our prior work [8], described in detail in Sect.…”
Section: A Sequential Initial Alignmentmentioning
confidence: 99%
“…More specifically, at any given time t, a beamforming vector w t ∈ W S is selected sequentially as a function of previously observed signals (y t−1 ). We focus on strategies based on posterior matching, where the problem is connected to channel coding over a binary input channel with ([10], [11], [12]) and without ( [13]) feedback. We use the hierarchical posterior matching (hieP M ) scheme from our prior work [8], described in detail in Sect.…”
Section: A Sequential Initial Alignmentmentioning
confidence: 99%
“…The problem of mapping the channel measurements to an estimated channel is non-linear and requires high computations. Two different methods to do this mapping were proposed in [13], namely, i) the "look-up table" method and ii) the "search" method. The look-up table method requires storing a table with entries for all possible channel measurements along with their corresponding channels.…”
Section: Measurements Decodingmentioning
confidence: 99%
“…To argue the reliability of DNN-based mapping, we will test it using a simple channel with n t =1, n r =23 and a maximum of 3 available channel paths i.e., L≤3. We also compare the DNN model performance to the "search" method of [13]. Based on the described channel parameters, only m=11 measurements are needed for discovering its paths (more details about this particular example are discussed in Section VII).…”
Section: B Dnn Model Assessmentmentioning
confidence: 99%
See 2 more Smart Citations