Coded collaborative spectrum sensing with joint channel decoding and decision fusion
This paper considers the integration of channel decoding with fusion based decision, for coded collaborative spectrum sensing (CSS) employing local Neyman-Pearson (NP) testing at each sensor. We derive a belief-propagation (BP) algorithm for joint channel decoding and decision fusion (JCDDF), based...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/58074/ http://dx.doi.org/10.1109/TWC.2014.2378789 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Teknologi Malaysia |
Summary: | This paper considers the integration of channel decoding with fusion based decision, for coded collaborative spectrum sensing (CSS) employing local Neyman-Pearson (NP) testing at each sensor. We derive a belief-propagation (BP) algorithm for joint channel decoding and decision fusion (JCDDF), based on a factor graph model for coded CSS schemes. Using the Lloyd-Max method, we also propose a new methodology for the local sensor to quantize its observation. The design of the quantizer embeds the binary NP test outcome in the quantization bits. Using the JCDDF algorithm, we show that coded CSS paired even with a short (8,4) extended Hamming code outperforms not only uncoded CSS, but also schemes where channel decoding and decision fusion are executed separately. Then, we consider the design of good channel codes for such CSS schemes. We demonstrate that the JCDDF algorithm employing unequal error protection (UEP) coding improves performance and outperforms equal error protection coding. Furthermore, we present a simple code search algorithm for identifying short UEP codes. Using such UEP codes, we finally show that a performance improvement over uncoded CSS can be attained also without bandwidth expansion using higher order modulations. |
---|