.png){kind=icon}
Return
Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.1145/1525856.1525862.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-to-optimal solutions based on Turbo and LDPC codes exist for this problem, in most cases the proposed techniques do not scale to networks of hundreds of sensors. We present a scalable solution based on the following key elements: (a) distortion-optimized index assignments for low-complexity distributed quantization, (b) source-optimized hierarchical clustering based on the Kullback-Leibler distance and (c) sum-product decoding on specific factor graphs exploiting the correlation of the data.
Keywords:
Theory
Algorithm
Performance
Distributed source coding
hierarchical clustering
quantizer design
source and correlation models
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.7
Papers:
999
Citations:
2.0K
Organization
Cited Papers
ShareSaveShareSave
ShareSaveNeed for a consensus on the methods by which to measure joint mobility and the definition of norms for hypermobility that reflect age, gender and ethnic-dependent variation: is revision of criteria for joint hypermobility syndrome and Ehlers-Danlos syndrome hypermobility type indicated?.png)
RheumatologyOAAI
RheumatologyIF0
OAAIShareSave
View more