TY - GEN
T1 - Integrated source-channel decoding for correlated data-gathering sensor networks
AU - Howard, Sheryl L.
AU - Flikkema, Paul G.
PY - 2008
Y1 - 2008
N2 - This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered at a destination node. The collection of coded measurements sent to the destination, called a source-channel product codeword, has redundancy due to both correlation of the measurements and the channel code used for each measurement. At the destination, source-channel (SC) decoding of this code combines decoding using (i) the deterministic structure of the channel-coded individual measurements and (ii) the probabilistic structure of a prior model, called the global model, that describes the correlation structure of the SC product codewords. We demonstrate the utility of SC decoding via MAP SC decoding experiments using a (7,4,3) Hamming code and a Gaussian global model. We also show that SC decoding can exploit even the simplest possible code, a single-parity check code, using a MAP SC decoder that integrates the parity check constraint and global model. We describe the design of a low-complexity message-passing decoder and show it can improve performance in the poor-quality channels often found in multi-hop wireless data-gathering sensor networks.
AB - This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered at a destination node. The collection of coded measurements sent to the destination, called a source-channel product codeword, has redundancy due to both correlation of the measurements and the channel code used for each measurement. At the destination, source-channel (SC) decoding of this code combines decoding using (i) the deterministic structure of the channel-coded individual measurements and (ii) the probabilistic structure of a prior model, called the global model, that describes the correlation structure of the SC product codewords. We demonstrate the utility of SC decoding via MAP SC decoding experiments using a (7,4,3) Hamming code and a Gaussian global model. We also show that SC decoding can exploit even the simplest possible code, a single-parity check code, using a MAP SC decoder that integrates the parity check constraint and global model. We describe the design of a low-complexity message-passing decoder and show it can improve performance in the poor-quality channels often found in multi-hop wireless data-gathering sensor networks.
UR - http://www.scopus.com/inward/record.url?scp=51649121263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51649121263&partnerID=8YFLogxK
U2 - 10.1109/wcnc.2008.227
DO - 10.1109/wcnc.2008.227
M3 - Conference contribution
AN - SCOPUS:51649121263
SN - 9781424419968
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1261
EP - 1266
BT - WCNC 2008 - IEEE Wireless Communications and Networking Conference, Conference Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE Wireless Communications and Networking Conference, WCNC 2008
Y2 - 31 March 2008 through 3 April 2008
ER -