Abstract
Average log-likelihood ratios (LLRs) constitute sufficient statistics for centralized maximum-likelihood block decoding as well as for a posteriori probability evaluation which enables bit-wise (possibly iterative) decoding. By acquiring such average LLRs per sensor it becomes possible to perform these decoding tasks in a low-complexity distributed fashion using wireless sensor networks. At affordable communication overhead, the resultant distributed decoders rely on local message exchanges among single-hop neighboring sensors to achieve iteratively consensus on the average LLRs per sensor. Furthermore, the decoders exhibit robustness to non-ideal inter-sensor links affected by additive noise and random link failures. Pairwise error probability bounds benchmark the decoding performance as a function of the number of consensus iterations. Interestingly, simulated tests corroborating the analytical findings demonstrate that only a few consensus iterations suffice for the novel distributed decoders to approach the performance of their centralized counterparts.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3970-3983 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 57 |
| Issue number | 10 |
| DOIs | |
| State | Published - 2009 |
Keywords
- Channel coding
- Decoding
- Distributed detection
- Wireless sensor networks (WSNs)
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'Distributed in-network channel decoding'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS