Abstract

Low-density parity-check (LDPC) codes are widely employed in communication systems. We focus on the computing of messages at the sink node of internet-of-things (IoT). As opposed to decoding all the messages, we consider the case that the sink node is interested in computing a linear transformation of the messages. We assume that all the IoT devices are identical. We first present three representations of the considered systems, based on which three multistage computing algorithms are proposed, which are decoding-computing (DC) algorithm, computing-decoding (CD) algorithm, and computing-decoding-computing (CDC) algorithm. Secondly, we show that the considered system admits a compact normal graph representation, based on which a joint computing algorithm is proposed. Thirdly, we present numerical results to show the advantages of the proposed algorithms. Numerical results show that the optimality of the proposed algorithms depends on the channel conditions and the computing functions. Numerical results also show that the joint computing algorithm has the best performances for a variety of scenarios. Finally, we present a simulation-based optimization procedure to design finite-length LDPC codes for the joint computing algorithm.

Highlights

  • Internet-of-things (IoT) has recently emerged as a promising enabling technique for a wide class of applications [1]–[7]

  • We present numerical results to show the performances of different algorithms in computing different functions

  • The Low-density parity-check (LDPC) codes is decoded with the sum-product algorithm

Read more

Summary

INTRODUCTION

Internet-of-things (IoT) has recently emerged as a promising enabling technique for a wide class of applications [1]–[7]. For IoT-aided sensing networks, the sink node may not be interested in the original messages. The sink node may be interested in the modulo-sum of the original messages This requires improved design of the IoT transmission schemes. To the best knowledge of the authors, very few works in the literature focused on the design of computing algorithms for LDPC coded IoT networks. This paper focuses on the design of computing algorithms for IoT which employs LDPC codes for transmission. We consider the applications of the proposed algorithms to Gaussian interference channels (GIFC) and modulo-sum computing. We present a simulation-based optimization procedure to design finite-length LDPC codes for the joint computing algorithm.

THE LDPC CODED LINEAR SUPERPOSITION SYSTEM
JOINT COMPUTING ALGORITHM
GAUSSIAN INTERFERENCE CHANNELS
MODULO-SUM COMPUTING
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.