Computing Algorithms for LDPC Coded Internet-of-Things

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-decodingcomputing (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. INDEX TERMS LDPC codes, linear superposition, joint computing algorithm, internet-of-things.

Performance analysis of the bioinspired method for optimizing irregular codes with a low density of parity checks

“…It is shown that the optimized codes produce an additional win from encoding in the channel with AWGN compared to previously obtained codes. In turn, study [11] considered the optimization of finite-length codes with a low density of parity checks to be used in the Internet of Things technology. The proposed approach is based on the computer simulation of the process of transmitting information in a channel with gaussian interference and the use of the simplex descent method to find the optimized codes.…”

“…However, studies [6][7][8][9][10][11] were aimed at optimizing long enough codes, although next-generation wireless telecommunications systems imply the use of relatively short codes. To solve this task, paper [12] proposed a class of spatially-related codes with a low density of parity checks with an uneven structure.…”