Localization with One-Bit Passive Radars in Narrowband Internet-of-Things using Multivariate Polynomial Optimization
July 29, 2020 Β· Declared Dead Β· π IEEE Transactions on Signal Processing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Saeid Sedighi, Kumar Vijay Mishra, M. R. Bhavani Shankar, BjΓΆrn Ottersten
arXiv ID
2007.15108
Category
eess.SP: Signal Processing
Cross-listed
cs.IR,
math.OC
Citations
43
Venue
IEEE Transactions on Signal Processing
Last Checked
6 months ago
Abstract
Several Internet-of-Things (IoT) applications provide location-based services, wherein it is critical to obtain accurate position estimates by aggregating information from individual sensors. In the recently proposed narrowband IoT (NB-IoT) standard, which trades off bandwidth to gain wide coverage, the location estimation is compounded by the low sampling rate receivers and limited-capacity links. We address both of these NB-IoT drawbacks in the framework of passive sensing devices that receive signals from the target-of-interest. We consider the limiting case where each node receiver employs one-bit analog-to-digital-converters and propose a novel low-complexity nodal delay estimation method using constrained-weighted least squares minimization. To support the low-capacity links to the fusion center (FC), the range estimates obtained at individual sensors are then converted to one-bit data. At the FC, we propose target localization with the aggregated one-bit range vector using both optimal and sub-optimal techniques. The computationally expensive former approach is based on Lasserre's method for multivariate polynomial optimization while the latter employs our less complex iterative joint r\textit{an}ge-\textit{tar}get location \textit{es}timation (ANTARES) algorithm. Our overall one-bit framework not only complements the low NB-IoT bandwidth but also supports the design goal of inexpensive NB-IoT location sensing. Numerical experiments demonstrate feasibility of the proposed one-bit approach with a $0.6$\% increase in the normalized localization error for the small set of $20$-$60$ nodes over the full-precision case. When the number of nodes is sufficiently large ($>80$), the one-bit methods yield the same performance as the full precision.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Signal Processing
R.I.P.
π»
Ghosted
π
π
The Cartographer
1D Convolutional Neural Networks and Applications: A Survey
R.I.P.
π»
Ghosted
Wireless Communications with Reconfigurable Intelligent Surface: Path Loss Modeling and Experimental Measurement
π
π
The Cartographer
Accessing From The Sky: A Tutorial on UAV Communications for 5G and Beyond
R.I.P.
π»
Ghosted
6G Wireless Systems: Vision, Requirements, Challenges, Insights, and Opportunities
R.I.P.
π»
Ghosted
A New Wireless Communication Paradigm through Software-controlled Metasurfaces
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted