2016
DOI: 10.1109/jstsp.2016.2520899
|View full text |Cite
|
Sign up to set email alerts
|

Compressive Channel Estimation and Tracking for Large Arrays in mm-Wave Picocells

Abstract: Abstract-We propose and investigate a compressive architecture for estimation and tracking of sparse spatial channels in millimeter (mm) wave picocellular networks. The base stations are equipped with antenna arrays with a large number of elements (which can fit within compact form factors because of the small carrier wavelength) and employ radio frequency (RF) beamforming, so that standard least squares adaptation techniques (which require access to individual antenna elements) are not applicable. We focus on… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
188
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 216 publications
(189 citation statements)
references
References 31 publications
(49 reference statements)
1
188
0
Order By: Relevance
“…We represented (31) in Fig. 3(a), where we see that it approximates (29) and lower bounds ρ(d). Fig.…”
Section: Compressibility Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…We represented (31) in Fig. 3(a), where we see that it approximates (29) and lower bounds ρ(d). Fig.…”
Section: Compressibility Analysismentioning
confidence: 99%
“…We use the Binary-search Local Maximum Refinement described in Alg. 2, rather than a gradient as [29], to guarantee that OMPBR is robust in the sense that the result is contained in the bin and never worse than the decision that OMP would make. Lemma 1 shows Alg.…”
mentioning
confidence: 99%
“…In practice, the complexity of Algorithms 2 and 3 is demanding because h(x) and ∇h(x) are required at each iteration, which are high-dimensional functions defined on C B where B ≫ M N . In recent works on channel estimation and data detection in the mmWave band [14], [15], [28], the FFT-based implementation is widely used because H can be approximated by (7) using overcomplete DFT matrices. In this paper, an FFT-based fast implementation of h(x) and ∇h(x) is proposed, which is motivated by [14], [15], [28].…”
Section: B Fast Implementation Via Fftmentioning
confidence: 99%
“…Many research efforts have been devoted to designing highefficient beam training schemes, such as using configurable beam width for adaptive beam search [2], sending pseudorandom beacons to apply compressive sensing techniques [3], double-link beam tracking to overcome the blockage problem [4], probabilistic beam tracking for hybrid beamforming architectures [5], adaptive beam tracking with the unscented kalman filter [6] and narrowing down the search range with the historical training results [7]. Channel fingerprints can also This act as useful historical information to aid beam tracking.…”
Section: Introductionmentioning
confidence: 99%