Progressive coding and iterative source-channel decoding in wireless data gathering networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Wireless data gathering networks are often tasked to gather correlated data under severe energy constraints. The use of simple channel codes with source-channel decoding can potentially provide good performance with low energy consumption. Here we consider progressive coding in multi-hop networks, where an intermediate node decodes its received noisy codewords. The estimated information is concatenated with the node's own information word and encoded; the resulting progressively- encoded codeword is then transmitted to the next node. In non- progressive coding, the node simply forwards the received noisy codewords along with its own encoded data. Here we compare the performance of two codes with low decoding complexity, Repeat- Accumulate (RA) and Low-Density Parity-Check (LDPC) codes, in combination with two progressive coding schemes. Progressive channel coding uses only channel decoding at the intermediate node, while progressive source-channel coding uses source- channel decoding, exploiting the probabilistic dependency of the information words (caused by the correlation structure of the data) jointly with the deterministic dependency induced by channel coding. Two decoding schemes are considered at the data center: channel decoding only and iterative source-channel decoding. In simulation experiments, we consider a line network topology with systematic RA and LDPC coding. Results show that progressive coding performs better than non-progressive coding, and RA codes perform better with lower computational complexity than LDPC codes, both for channel-decoding-only and iterative source- channel decoding.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

Fingerprint

Decoding
Channel coding
Computational complexity
Energy utilization
Topology

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Progressive coding and iterative source-channel decoding in wireless data gathering networks. / Li, Congduan; Flikkema, Paul G.; Howard, Sheryl L.

GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6133958.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, C, Flikkema, PG & Howard, SL 2011, Progressive coding and iterative source-channel decoding in wireless data gathering networks. in GLOBECOM - IEEE Global Telecommunications Conference., 6133958, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 12/5/11. https://doi.org/10.1109/GLOCOM.2011.6133958
@inproceedings{dfe8fb74723c483fa9b95130f6db63e8,
title = "Progressive coding and iterative source-channel decoding in wireless data gathering networks",
abstract = "Wireless data gathering networks are often tasked to gather correlated data under severe energy constraints. The use of simple channel codes with source-channel decoding can potentially provide good performance with low energy consumption. Here we consider progressive coding in multi-hop networks, where an intermediate node decodes its received noisy codewords. The estimated information is concatenated with the node's own information word and encoded; the resulting progressively- encoded codeword is then transmitted to the next node. In non- progressive coding, the node simply forwards the received noisy codewords along with its own encoded data. Here we compare the performance of two codes with low decoding complexity, Repeat- Accumulate (RA) and Low-Density Parity-Check (LDPC) codes, in combination with two progressive coding schemes. Progressive channel coding uses only channel decoding at the intermediate node, while progressive source-channel coding uses source- channel decoding, exploiting the probabilistic dependency of the information words (caused by the correlation structure of the data) jointly with the deterministic dependency induced by channel coding. Two decoding schemes are considered at the data center: channel decoding only and iterative source-channel decoding. In simulation experiments, we consider a line network topology with systematic RA and LDPC coding. Results show that progressive coding performs better than non-progressive coding, and RA codes perform better with lower computational complexity than LDPC codes, both for channel-decoding-only and iterative source- channel decoding.",
author = "Congduan Li and Flikkema, {Paul G.} and Howard, {Sheryl L.}",
year = "2011",
doi = "10.1109/GLOCOM.2011.6133958",
language = "English (US)",
isbn = "9781424492688",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Progressive coding and iterative source-channel decoding in wireless data gathering networks

AU - Li, Congduan

AU - Flikkema, Paul G.

AU - Howard, Sheryl L.

PY - 2011

Y1 - 2011

N2 - Wireless data gathering networks are often tasked to gather correlated data under severe energy constraints. The use of simple channel codes with source-channel decoding can potentially provide good performance with low energy consumption. Here we consider progressive coding in multi-hop networks, where an intermediate node decodes its received noisy codewords. The estimated information is concatenated with the node's own information word and encoded; the resulting progressively- encoded codeword is then transmitted to the next node. In non- progressive coding, the node simply forwards the received noisy codewords along with its own encoded data. Here we compare the performance of two codes with low decoding complexity, Repeat- Accumulate (RA) and Low-Density Parity-Check (LDPC) codes, in combination with two progressive coding schemes. Progressive channel coding uses only channel decoding at the intermediate node, while progressive source-channel coding uses source- channel decoding, exploiting the probabilistic dependency of the information words (caused by the correlation structure of the data) jointly with the deterministic dependency induced by channel coding. Two decoding schemes are considered at the data center: channel decoding only and iterative source-channel decoding. In simulation experiments, we consider a line network topology with systematic RA and LDPC coding. Results show that progressive coding performs better than non-progressive coding, and RA codes perform better with lower computational complexity than LDPC codes, both for channel-decoding-only and iterative source- channel decoding.

AB - Wireless data gathering networks are often tasked to gather correlated data under severe energy constraints. The use of simple channel codes with source-channel decoding can potentially provide good performance with low energy consumption. Here we consider progressive coding in multi-hop networks, where an intermediate node decodes its received noisy codewords. The estimated information is concatenated with the node's own information word and encoded; the resulting progressively- encoded codeword is then transmitted to the next node. In non- progressive coding, the node simply forwards the received noisy codewords along with its own encoded data. Here we compare the performance of two codes with low decoding complexity, Repeat- Accumulate (RA) and Low-Density Parity-Check (LDPC) codes, in combination with two progressive coding schemes. Progressive channel coding uses only channel decoding at the intermediate node, while progressive source-channel coding uses source- channel decoding, exploiting the probabilistic dependency of the information words (caused by the correlation structure of the data) jointly with the deterministic dependency induced by channel coding. Two decoding schemes are considered at the data center: channel decoding only and iterative source-channel decoding. In simulation experiments, we consider a line network topology with systematic RA and LDPC coding. Results show that progressive coding performs better than non-progressive coding, and RA codes perform better with lower computational complexity than LDPC codes, both for channel-decoding-only and iterative source- channel decoding.

UR - http://www.scopus.com/inward/record.url?scp=84863142629&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863142629&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2011.6133958

DO - 10.1109/GLOCOM.2011.6133958

M3 - Conference contribution

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -