# Iterative Fusion of Distributed Decisions over the Gaussian Multiple-Access Channel Using Concatenated BCH-LDGM Codes

- Javier Del Ser
^{1}Email author, - Diana Manjarres
^{1}, - Pedro M. Crespo
^{2}, - Sergio Gil-Lopez
^{1}and - Javier Garcia-Frias
^{3}

**2011**:825327

https://doi.org/10.1155/2011/825327

© Javier Del Ser et al. 2011

**Received: **30 November 2010

**Accepted: **20 January 2011

**Published: **27 January 2011

## Abstract

This paper focuses on the data fusion scenario where nodes sense and transmit the data generated by a source to a common destination, which estimates the original information from more accurately than in the case of a single sensor. This work joins the upsurge of research interest in this topic by addressing the setup where the sensed information is transmitted over a Gaussian Multiple-Access Channel (MAC). We use Low Density Generator Matrix (LDGM) codes in order to keep the correlation between the transmitted codewords, which leads to an improved received Signal-to-Noise Ratio (SNR) thanks to the constructive signal addition at the receiver front-end. At reception, we propose a joint decoder and estimator that exchanges soft information between the LDGM decoders and a data fusion stage. An error-correcting Bose, Ray-Chaudhuri, Hocquenghem (BCH) code is further applied suppress the error floor derived from the ambiguity of the MAC channel when dealing with correlated sources. Simulation results are presented for several values of and diverse LDGM and BCH codes, based on which we conclude that the proposed scheme outperforms significantly (by up to 6.3 dB) the suboptimum limit assuming separation between Slepian-Wolf source coding and capacity-achieving channel coding.

## Keywords

## 1. Introduction

*albeit*reliable fashion. Unfortunately, the capacity of SNs to achieve a high energy efficiency is highly determined by the scalability of these sensor meshes. In this context, a large number of challenging paradigms have been tackled with the aim of minimizing the power consumption and improving the battery lifetime of densely populated networks. As such, it is worth to mention distributed compression [1, 2], transmission and/or cluster scheduling [3, 4], data aggregation [5–7], multihop cooperative processing [8, 9], in-network data storage [10], and power harvesting [11, 12]. This work gravitates on one of such paradigms: the centralized data fusion scenario (see Figure 1), where nodes monitor a given information source (representing, for instance, temperature, pressure, or any other physical phenomena) and transmit their sensed data to a common receiver. This receiver will combine the data from the sensors so as to obtain a reliable estimation of the information from the original source . When the monitoring procedure at each node is subject to a non-zero probability of sensing error, intuitively one can infer that the more sensors added to this setup, the higher the accuracy of the estimation will be with respect to the case of a single sensor. Therefore, the challenging paradigm in this specific scenario lies on how to optimally fuse the information from all sources while taking into account the aforementioned probability of sensing error, specially when dealing with practical communication channels.

One of the first contributions in this area was done by Lauer et al. in [13], who extended classical results from decision theory to the case of distributed correlated signals. Subsequently, Ekchian and Tenney [14] formulated the distributed detection problem for several network topologies. Later, in [15] Chair and Varshney derived an optimum data fusion rule which combines individually performed decisions on the data sensed at every sensor. This data fusion rule was shown to minimize the end-to-end probability of error of the overall system. More recently, several contributions have tackled the data fusion problem in diverse uncoded communication scenarios, for example, multihop networks subject to fading [16–18] and delays [19], parallel channels subject to fading [20–22], and asynchronous multiple-access channels [23, 24], among others.

On the other hand, when dealing with coded scenarios over noisy channels, it is important to point out that the data fusion problem can be regarded as a particular case of the so-called *distributed joint source-channel coding* of correlated sources, since the nonzero probability of sensing error imposes a spatial correlation among the data registered by the sensors. In the last decade, intense research effort has been conducted towards the design of practical iteratively-decodable (i.e., Turbo-like) joint source-channel coding schemes for the transmission of spatially and temporally correlated sources over diverse communication channels, for example, see [25–31] and references therein. However, these contributions address the reliable transmission of the information generated by a set of correlated sensors, whereas the encoded data fusion paradigm focuses on the reliable communication of an information source
read by a set of
sensors subject to a nonzero probability of sensing error; based on this, a certain error tolerance can be permitted when detecting the data registered by a given sensor. In this encoded data fusion setup, different Turbo-like codes have been proposed for iterative decoding and data fusion of multiple-sensor scenarios for the simplistic case of parallel AWGN channels, for example, Low Density Generator Matrix (LDGM) [32], Irregular Repeat-Accumulate (IRA) [33], and concatenated Zigzag [34] codes. In such references, it was shown that an iterative joint decoding and data fusion strategy performs better than a sequential scheme where decoding and data fusion are separately executed.

Following this research trend, this paper considers the data fusion scenario where the data sensed by nodes is transmitted to a common receiver over a Gaussian Multiple-Access Channel (MAC). In this scenario, it is well known that the spatial correlation between the data registered by the sensors should be preserved between the transmitted signals so as to maximize the effective signal-to-noise ratio (SNR) at the receiver. On this purpose, correlation-preserving LDGM codes have been extensively studied for the problem of joint source-channel coding of correlated sensors over the MAC [35–38]. In these references, it was shown that concatenated LDGM schemes permit to drastically reduce the error floor inherent to LDGM codes. Inspired by this previous work, in this paper we take a step further by analyzing the performance of concatenated BCH-LDGM codes for encoded data fusion over the Gaussian MAC. Specifically, our contribution is twofold: on one hand, we design an iterative receiver that jointly performs LDGM decoding and data fusion based on factor graphs and the Sum Product Algorithm. On the other hand, we show that for the particular data fusion scenario under consideration, the error statistics in the decoded information from the sensors allow for the concatenation of BCH codes [39, 40] in order to decrease the aforementioned intrinsic error floor of single LDGM codes. Extensive Monte Carlo simulations will verify that the proposed concatenated BCH-LDGM codes not only outperform vastly the suboptimum limit assuming separation between distributed source and channel coding, but also reaches the theoretical residual error bound derived by assuming errorless detection and decoding of the sensor data.

The rest of the paper is organized as follows: Section 2 delves into the system model of the considered encoded data fusion scenario, whereas Section 3 elaborates on the design of the iterative decoding and data fusion procedure. Next, Section 4 discusses Monte Carlo simulation results and finally, Section 5 ends the paper by drawing some concluding remarks.

## 2. System Model

*Binary Phase Shift Keying*) modulated and transmitted to a common receiver over a Gaussian Multiple-Access Channel.

where stands for the BPSK modulation mapping, and represents the average energy per channel symbol and sensor. The Gaussian MAC considered in this work assumes and , whereas are i.i.d. circularly symmetric complex Gaussian random variables with zero mean and variance per dimension . Nevertheless, explanations hereafter will make no assumptions on the value of the MAC coefficients. The joint receiver must estimate the original information generated by as based on the received sequence . This will be done by applying the message-passing Sum-Product Algorithm (SPA, see [41] and references therein) over the whole factor graph describing the statistical dependence between and , as will be explained in next section.

## 3. Iterative Joint Decoding and Data Fusion

that is, by symbolwise majority voting over the estimated sensor sequences. Notice that this practical scheme performs sequentially channel detection, LDGM decoding, BCH decoding, and fusion of the decoded data.

for . As widely evidenced in the literature related to the transmission of correlated information sources (see references in Section 1), this correlation should be exploited at the receiver in order to enhance the reliability of the fused sequence . In other words, the considered scenario should take advantage of this correlation, not only by means of an enhanced effective SNR at the receiver thanks to the correlation-preserving properties of LDGM codes, but also through the exploitation of the statistical relation between sequences corresponding to different sensors . The latter dependence between and can be efficiently capitalized by (1) describing the joint probability distribution of all the variables involved in the system by means of factor graphs and (2) marginalizing for via the message-passing Sum-Product Algorithm (SPA). This methodology allows decreasing the computational complexity with respect to a direct marginalization based on exhaustive evaluation of the entire joint probability distribution. Particularly, the statistical relation between sensor sequences is exploited in one of the compounding factor subgraphs of the receiver, as will be later detailed.

In regard to Figure 3(b), observe that a set of switches controlled by binary variables and drive the connection/disconnection of systematic ( ) and parity ( ) variable nodes from the MAC subgraph. The reason being that, as later detailed in Section 4, the degradation of the iterative SPA due to short-length cycles in the underlying factor graph can be minimized by properly setting these switches.

- (i)
:

*a posteriori*soft information for the value of the node , which is computed, at iteration and , as the product of the*a posteriori*soft information rendered by the SPA when applied to MAC and LDGM subgraphs. - (ii)
: similar to the previously defined , this notation refers to the

*a posteriori*information for the value of node , which is calculated, at iteration and , as the product of the corresponding*a posteriori*information produced at both MAC and LDGM subgraphs. - (iii)
:

*extrinsic*soft information for built upon the information provided by the rest of sensors at iteration and time tick . - (iv)
: refined

*a posteriori*soft information of node for the value , which is produced as a consequence of the processing stage in Figure 3(c).

*hard decision*(HD) on the BCH encoded sequence based on , , and the information output from the SENSING subgraph in the previous iteration, that is, . This is done within the current iteration . Once the binary estimated sequence corresponding to the BCH encoded block at the th sensor is obtained and decoded, the binary output is utilized for adaptively refining the

*a posteriori*soft information as under the flipping rule

which is performed for . It is interesting to observe that in this expression, all those indices in error detected by the BCH decoder will consequently drive a flip in the soft information fed to the SENSING subgraph.

where as before, represents a normalization factor for each message pair.

## 4. Simulation Results

To verify the performance of the proposed system, extensive Monte Carlo simulations have been performed for sensors and a sensing error probability set, without loss of generality, to for all sensors. The experiments have been divided in two different sets so as to shed light on the aforementioned statistics of the number of errors per iterations. Accordingly, the first set does not consider any outer BCH coding, and only identical LDGM codes of rate (input symbols per coded symbol), variable and check degree distributions , and input blocklength are utilized at every sensor. The number of iterations for the proposed iterative receiver has been set equal to . The metric adopted for the performance evaluation is the End-to-End Bit Error Rate (BER) between and , which is averaged over 2000 different information sequences per simulated point and plotted versus the ratio per sensor (energy per bit to noise power spectral density ratio). Gaussian MAC is considered in all simulations by imposing .

with
denoting the probability of having a sequence with exactly
*zero* symbols. In this first simulation set, no outer BCH code is used, hence
.

It is also important to remark that the results plotted in Figure 4 have been obtained by setting the variables controlling the switches from Figure 3(b) to during the first iteration, while for the remaining iterations (i.e., the MAC subgraph is disconnected and does not participate in the message passing procedure). The rationale behind this setup lies on the length-4 loop connecting variable nodes , ( ), and for , which degrades significantly the performance of the message-passing SPA. Further simulations have been carried out to assess this degradation, which are omitted for the sake of clarity in the present discussion. Based on this result, all simulations henceforth will utilize the same switch schedule as the one used for this first set of simulations.

## 5. Concluding Remarks

In this paper, we have investigated the performance of concatenated BCH-LDGM codes for iterative data fusion of distributed decisions over the Gaussian MAC. The use of LDGM codes permits to efficiently exploit the intrinsic spatial correlation between the information registered by the sensors, whereas BCH codes are selected to lower the error floor due to the MAC ambiguity about the transmitted symbols. Specifically, we have designed an iterative receiver comprising channel detection, BCH-LDGM decoding, and data fusion, which have been thoroughly detailed by means of factor graphs and the Sum-Product Algorithm. Furthermore, a specially tailored soft information flipping technique based on the output of the BCH decoding stage has also been included in the proposed iterative receiver. Extensive computer simulations results obtained for varying number of sensors, LDGM, and BCH codes have revealed that (1) our scheme outperforms significantly the suboptimum limit assuming separation between distributed source and capacity-achieving channel coding and (2) the obtained end-to-end error rate performance attains the theoretical lower bound assuming perfect recovery of the sensor sequences.

## Declarations

### Acknowledgments

This work was supported in part by the Spanish Ministry of Science and Innovation through the CONSOLIDER-INGENIO (CSD200800010) and the Torres-Quevedo (PTQ-09-01-00740) funding programs and by the Basque Government through the ETORTEK programme (*Future Internet* EI08-227 project).

## Authors’ Affiliations

## References

- Pradhan SS, Kusuma J, Ramchandran K: Distributed compression in a dense microsensor network.
*IEEE Signal Processing Magazine*2002, 19(2):51-60. 10.1109/79.985684View ArticleGoogle Scholar - Xiong Z, Liveris AD, Cheng S: Distributed source coding for sensor networks.
*IEEE Signal Processing Magazine*2004, 21(5):80-94. 10.1109/MSP.2004.1328091View ArticleGoogle Scholar - Yao Y, Giannakis GB: Energy-efficient scheduling for wireless sensor networks.
*IEEE Transactions on Communications*2005, 53(8):1333-1342. 10.1109/TCOMM.2005.852834MathSciNetView ArticleGoogle Scholar - Sichitiu ML: Cross-layer scheduling for power efficiency in wireless sensor networks.
*Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), March 2004*3: 1740-1750.Google Scholar - Krishnamachari B, Estrin D, Wicker S: The impact of data aggregation in wireless sensor networks.
*Proceedings of the 22nd International Conference on Distributed Computing Systems, 2002*575-578.Google Scholar - Shrivastava N, Buragohain C, Agrawal D, Suri S: Medians and beyond: new aggregation techniques for sensor networks.
*Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, November 2004*239-249.View ArticleGoogle Scholar - Tang X, Xu J: Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks.
*IEEE/ACM Transactions on Networking*2008, 16(4):904-917.View ArticleGoogle Scholar - Aksu A, Ercetin O: Multi-hop cooperative transmissions in wireless sensor networks.
*Proceedings of the 2nd IEEE Workshop on Wireless Mesh Networks (WiMESH '06), September 2006*132-134.Google Scholar - Yuan Y, Chen M, Kwon T: A novel cluster-based cooperative MIMO scheme for multi-hop wireless sensor networks.
*Eurasip Journal on Wireless Communications and Networking*2006, 2006:-9.Google Scholar - Xu J, Tang X, Lee WC: EASE: an energy-efficient in-network storage scheme for object tracking in sensor networks.
*Proceedings of the 2nd Annual IEEE Communications Society Conference on Sensor and AdHoc Communications and Networks (SECON '05), September 2005*396-405.Google Scholar - De Mil P, Jooris B, Tytgat L, Catteeuw R, Moerman I, Demeester P, Kamerman A: Design and implementation of a generic energy-harvesting framework applied to the evaluation of a large-scale electronic shelf-labeling wireless sensor network.
*Eurasip Journal on Wireless Communications and Networking*2010, 2010:-12.Google Scholar - Seah WKG, Zhi AE, Tan HP: Wireless sensor networks powered by ambient energy harvesting (WSN-HEAP)—survey and challenges.
*Proceedings of the 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, Wireless (VITAE '09), May 2009*1-5.View ArticleGoogle Scholar - Lauer G, Sandell NR Jr.,
*et al*.:*Distributed detection of known signals in correlated noise.*Alphatech, Burlington, Mass, USA; 1982.Google Scholar - Ekchian LK, Tenney RR: Detection networks. Proceedings of the 21st IEEE Conference on Decision and Control 686-691.Google Scholar
- Chair Z, Varshney PK: Optimal data fusion in multiple sensor detection systems.
*IEEE Transactions on Aerospace and Electronic Systems*1986, 22(1):98-101.View ArticleGoogle Scholar - Chen H, Varshney PK, Chen B: Cooperative relay for decentralized detection.
*Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), April 2008*2293-2296.Google Scholar - Del Ser J, Olabarrieta I, Gil-Lopez S, Crespo PM: On the design of frequency-switching patterns for distributed data fusion over relay networks.
*Proceedings of the International ITG Workshop on Smart Antennas (WSA '10), February 2010*275-279.View ArticleGoogle Scholar - Lin Y, Chen B, Varshney PK: Decision fusion rules in multi-hop wireless sensor networks.
*IEEE Transactions on Aerospace and Electronic Systems*2005, 41(2):475-488. 10.1109/TAES.2005.1468742View ArticleGoogle Scholar - Thomopoulos SCA, Zhang L: Distributed decision fusion in the presence of networking delays and channel errors.
*Information Sciences*1992, 66(1-2):91-118. 10.1016/0020-0255(92)90089-QMathSciNetView ArticleMATHGoogle Scholar - Chen B, Jiang R, Kasetkasem T, Varshney PK: Fusion of decisions transmitted over fading channels in wireless sensor networks.
*Proceedings of the Conference Record of the Asilomar Conference on Signals, Systems and Computers, 2002*2: 1184-1188.Google Scholar - Niu R, Chen B, Varshney PK: Decision fusion rules in wireless sensor networks using fading channel statistics.
*Proceedings of the Conference on Information Sciences and Systems, March 2003*Google Scholar - Chen B, Jiang R, Kasetkasem T, Varshney PK: Channel aware decision fusion in wireless sensor networks.
*IEEE Transactions on Signal Processing*2004, 52(12):3454-3458. 10.1109/TSP.2004.837404MathSciNetView ArticleGoogle Scholar - Lin Y, Chen B, Tong L: Distributed detection over multiple access channels.
*2007 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '07), April 2007*541-544.Google Scholar - Li W, Dai H: Distributed detection in wireless sensor networks using a multiple access channel.
*IEEE Transactions on Signal Processing*2007, 55(3):822-833.MathSciNetView ArticleGoogle Scholar - Zhao Y, Garcia-Frias J: Turbo compression/joint source-channel coding of correlated binary sources with hidden Markov correlation.
*Signal Processing*2006, 86(11):3115-3122. 10.1016/j.sigpro.2006.03.011View ArticleMATHGoogle Scholar - Kobayashi K, Yamazato T, Okada H, Katayama M: Iterative joint channel-decoding scheme using the correlation of transmitted information sequences.
*Proceedings of the International Symposium on Information Theory and Its Applications, 2006*808-813.Google Scholar - Garcia-Frias J, Zhao Y: Near-Shannon/Slepian-Wolf performance for unknown correlated sources over AWGN channels.
*IEEE Transactions on Communications*2005, 53(4):555-559. 10.1109/TCOMM.2005.844959View ArticleGoogle Scholar - Zhong W, Garcia-Frias J: LDGM codes for channel coding and joint source-channel coding of correlated sources.
*Eurasip Journal on Applied Signal Processing*2005, 2005(6):942-953. 10.1155/ASP.2005.942View ArticleMATHGoogle Scholar - Del Ser J, Crespo PM, Galdos O: Asymmetric joint source-channel coding for correlated sources with blind HMM estimation at the receiver.
*Eurasip Journal on Wireless Communications and Networking*2005, 2005:-10.Google Scholar - Garcia-Frias J, Villasenor JD: Joint turbo decoding and estimation of hidden Markov sources.
*IEEE Journal on Selected Areas in Communications*2001, 19(9):1671-1679. 10.1109/49.947032View ArticleGoogle Scholar - Garcia-Frias J: Joint source-channel decoding of correlated sources over noisy channels.
*Proceedings of the Data Compression Conference, March 2001*283-292.Google Scholar - Zhong W, Garcia-Frias J: Combining data fusion with joint source-channel coding of correlated sensors.
*Proceedings of the IEEE Information Theory Workshop (ITW '04), 2004*315-317.View ArticleGoogle Scholar - Zhong W, Garcia-Frias J: Combining data fusion with joint source-channel coding of correlated sensors using IRA codes.
*Proceedings of the Conference on Information Sciences and Systems, 2005*Google Scholar - Del Ser J, Garcia-Frias J, Crespo PM: Iterative concatenated zigzag decoding and blind data fusion of correlated sensors.
*Proceedings of the International Conference on Ultra Modern Telecommunications and Workshops, October 2009*Google Scholar - Garcia-Frias J, Zhao Y, Zhong W: Turbo-like codes for transmission of correlated sources over noisy channels.
*IEEE Signal Processing Magazine*2007, 24(5):58-66.View ArticleGoogle Scholar - Zhao Y, Zhong W, Garcia-Frias J: Transmission of correlated senders over a Rayleigh fading multiple access channel.
*Signal Processing*2006, 86(11):3150-3159. 10.1016/j.sigpro.2006.03.014View ArticleMATHGoogle Scholar - Zhong W, Chai H, Garcia-Frias J: LDGM codes for transmission of correlated senders over MAC.
*Proceedings of the Allerton Conference on Communication, Control, and Computing, 2005*Google Scholar - Zhong W, Garcia-Fria J: Joint source-channel coding of correlated senders over multiple access channels.
*Proceedings of the Allerton Conference on Communication, Control, and Computing, 2004*Google Scholar - Hocquenghem A: Codes correcteurs d'erreurs.
*Chiffres*1959, 2: 147-156.MathSciNetMATHGoogle Scholar - Bose RC, Ray-Chaudhuri DK: On a class of error correcting binary group codes.
*Information and Control*1960, 3: 68-79. 10.1016/S0019-9958(60)90287-4MathSciNetView ArticleMATHGoogle Scholar - Kschischang FR, Frey BJ, Loeliger HA: Factor graphs and the sum-product algorithm.
*IEEE Transactions on Information Theory*2001, 47(2):498-519. 10.1109/18.910572MathSciNetView ArticleMATHGoogle Scholar - Slepian D, Wolf JK: Noiseless coding of correlated information sources.
*IEEE Transactions on Information Theory*1973, 19(4):471-480. 10.1109/TIT.1973.1055037MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.