International Journal of Advanced Engineering Research and

Science (IJAERS)
Peer-Reviewed Journal
ISSN: 2349-6495(P) | 2456-1908(O)
Vol-11, Issue-8; Aug, 2024
Journal Home Page Available: https://ijaers.com/
Article DOI: https://dx.doi.org/10.22161/ijaers.118.1

A Partially Coupled Turbo Code Design for Error

Detection and Correction in IoT Networks
Raman Singh Ahirwal1, Amit Marmat2
1P.G. Student, Department of Electronic and Telecommunication Engineering, Vikram University/School of Engineering &Technology,
Ujjain, M.P., India
Email: [email protected]
2 Professor, Department of Electronic and Telecommunication Engineering, Vikram University/School of Engineering &Technology,

Ujjain, M.P., India

Email : [email protected]

Received: 27 Jun 2024, Abstract— The internet of things framework has seen a rapid change in
Receive in revised form: 25 Jul 2024, terms of the applications and users worldwide. However, the need for
trustworthiness to satisfactory quality of service is of utmost importance
Accepted: 02 Aug 2024,
keeping in mind the nature of data transfer in wireless media. The advent
Available online: 07 Aug 2024 of high compute power processors with miniature sizes and low power
©2024 The Author(s). Published by AI consumption, implementing relatively complex algorithms has become
Publication. This is an open access article under possible which is necessity for internet of things applications. This
the CC BY license research paper focusses on the design and implementation of the code
(https://creativecommons.org/licenses/by/4.0/) blocks of turbo codes based on the BCJR algorithm so as to couple the
bits in the code blocks in the composite transport block. The information
Keywords— Internet of things, Turbo Codes,
and parity bits are to be coupled so as to have more information sharing
trustworthiness, error rate, bit sharing.
within the transport block and hence reduce the error rate steeply in
section of the error waterfall. The proposed technique attains lower bit
error rate performance compared to the conventional un-coded and hard
coded counterparts. A comparative analysis with respect to the error
rate has been done so as to evaluate the quality of service of the
proposed work. The lower error rate of the proposed work ensures the
high quality of service and trustworthiness of the IoT system.

I. INTRODUCTION Most of the parameters though could be managed under at

One of the major challenges of the internet of things least one governing constraint which is [2]:
framework is the chances of bit flips in the data to be sent.
A typical IoT framework is depicted in figure 1. The IoT
framework owing to the wireless or unguided media has to
be designed such that it exhibits satisfactory quality of
service [1].
The metrics may be considered to be:
1) Error Rate
2) Throughput
3) Latency
Fig.1 The IoT framework

www.ijaers.com Page | 1
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

(1)

Here,

is the actual data rate through the channel.

denotes the permissible channel capacity of

the IoT network.
The IoT framework typically exhibits a steep fall in the
waterfall region of the error curve and then a diminishing
error rate [3].

Fig.3 Turbo encoder

The turbo encoder is characterized by:

Input bits.
Parity bits
Here,
I represents the information bits
Interleaver π
Encoders
The encoding mechanism is typically performed in a way
Fig.2 Typical error performance of Shannon’s limit so as to enhance the reliability of the system [11]. This
happens due to the fact that the encoder has three bits as
the output for one bit as the input. The encoders are
The typical Shannon’s limit is exhibited by a sharp fall in typically symmetric in nature or even asymmetric based on
the bit error rate upto or beyond for an SNR range of the type of encoder design [12]-[13]. The information bit
0=10 dB [4]. Typically, the error drops as a function of the shared is then passed on to render 3 bits which are [14]:
iterative decoding in several error detection and correction 1) Same unaltered bit.
coding techniques [5]. One of the most effective error
2) Encoded bit (P1)
detection and correction mechanisms in this regard is the
recursive turbo codes [6]-[7]. This category of codes show 3) Encoded bit (P2).
high adherence to the Shannon’s limit [8]-[9] The difference among the bits P1 and P2 lie in the fact that
The turbo encoding mechanism is typically described by both the bits are distinguished by the act of the interleaver.
the following attributes [10]: While the information bit ‘ I’ directly goes to the encoder
1, the other encoder receives a modified version of the
1) Encoder
information bit [15]. The two encoders may or may not be
2) Decoder similar. In case both exhibit a similar structure, the
3) Channel encoding is termed as symmetric encoding [16].The role of
the interleaver is exemplified in the next section.
4) Interleaver
5) De-interleaver
II. INTERLEAVING AND PUNCTURING
6) Recursive block
The interleaving mechanism is fundamentally derived so
The encoding mechanism is depicted in figure 3.
as to reduce the burst errors in a network [17]. This can be
understood through the following diagram.

www.ijaers.com Page | 2
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

parity bits. This reduces the bit transmission rate of the

system [22].
While the original coding rate is 1/3, the new coding rate
remains only ½. This happens due to the suppression of
one bit at a time [23].

III. TURBO DECODING

The major challenges with error detection and correction
for IoT networks are [24]:
1. IoT networks are prone to noise and disturbance
effects causing increase in bit error rate of the
system. This decreases the reliability and
Fig.4 Burst Errors trustworthiness of the system.
2. Often IoT networks are resource constrained in
terms of memory and processing power. Hence
The interleaving mechanism is fundamentally used to coding techniques with relatively low
circumvent the domino effect of errors [18]. This can be computational complexity in terms of number of
seen form figure 4. As there is a missing bit in bit location iterations are needed.
2, there is an error in bit 2 which is received by the
receiver. The error progresses as the receiver doesn’ t have 3. Lesser iterations are also needed to minimize the
cognizance of the transmitters bits. This leads to a latency (delay) of the system as IoT networks can
cascading progression of the bits and hence the error in be used for time critical applications.
one bit results in the errors in other multiple bits. This 4. There exists a fundamental trade off between the
however can be mitigated in case, the error propagation number of iterations and Bit Error Rate (BER) of
mechanism is stopped [19]. The exact is done by the the system where higher iterations would result in
interleaver as the interleaver combines the bits into chunks lower BER but would significantly increase the
and separates the correlation among the bits. This is system’s latency and complexity.
however, true only for burst errors with memory and not Typically two deciders are employed for decoding in the
for random errors [20]. cascading manner [25]. The BCJR based algorithm is used
While burst errors are bits which have a cascading effect, for the decoding of the codes.
the random errors are the errors which can occur at any bit
location at any given instance of time [21].

Fig.5 Puncturing

The puncturing mechanism is based on the planned non-

transmission of the bits at some intervals of time. The
information bit is not omitted but one of the most common Fig.6 The turbo decoding mechanism
techniques is to omit the parallel transmission of both the

www.ijaers.com Page | 3
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

The figure above depicts the block diagram of the turbo

decoder which comprises of two decoders. The interleaver
is represented by (π) and the de-interleaver is represented
by (Dπ). The decoding process is done in a manner which
incorporates both the decoders which are designated as D1
and D2. The information bit I and one of the parity bits is
fed to decoders 1 and 2 respectively. Each of the decoders
surmise the output based on the input information
received, and the verdict of the other decider [26]. Thus
the feedback loop connects decider 1 and decoder 2’ s
outputs in a recursive manner in which the iterative
process takes place in the decoding mechanism. At the
beginning of the decoding process, the output of any one
of the decoders is considered to be equi-probable
probabilities of 1 or zero occurring. However, the final bit
pattern is considered at the output terminal of D2 [27].

Fig.7 The proposed approach

In the proposed approach, both information and parity bits

are coupled. Previous approaches do not have a method to
couple both I & P.
In the proposed scheme, the information bits are
designated by I and the interleaved bits are denoted by P.
In this case, the n code blocks (CB) constitute a transport Fig.8 Proposed Flowchart
block (TB). The transport block vector (T) is segmented
into ‘ n’ code blocks
Figure 8 depicts the flowchart of the proposed system. The
flowchart represents the sequential steps to implement the
proposed system.

IV. EXPERIMENTAL RESULTS

To The system has been designed on MATLAB 2020a.
To emulate the actual data streams generated by a
multitude of devices in an IoT network, random binary
data has been generated.

www.ijaers.com Page | 4
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

Figure 10 depicts the addition of noise in the wireless

channel. Random noise has been added so as to replicate
the channel conditions in an actual IoT network. The
random fluctuations in the noise as a function of time has
been shown in the figure.
The effect of noise addition on the binary data stream
in the time domain has been depicted in figure 11. It can
be seen that the binary data stream has been manipulated
by the addition of noise.

Fig.9 binary bits

Figure 9 depicts the binary data stream generated to

emulate random binary data transmission.

Fig.12 Formation of the turbo Code-word

Figure 12 depicts the binary code-word generated by

the proposed system. The binary representation of the code
word has been shown.

Fig.10 Addition of disturbance

Fig.13 error as function of iterations.

Figure 13 depicts the bit error rate of the proposed

system as function of iterations. It can be observed that as
the iterations increase, the BER of the system continuously
plummets. To represent the signal strength for binary data,

Fig.11 Effect of noise addition. the term energy per bit has been used.

www.ijaers.com Page | 5
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

[2] ChaofanChen , Li Li, Li Wang, Shuai Wang 1, Xiangming

Li 1, George K. Karagiannidis, Noncoherent Detection With
Polar Codes” , IEEE 2021.
[3] Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i
Amat, Spatially Coupled Turbo-Like Codes” , IEEE 2020.
[4] Ritesh Nagar, S. K. Bhatt, A Comparative analysis of a
Conventional and cross phase UPQC for enhancing the
Power Quality,” vol. 7, no. 7. IJSHRE, 2018.
[5] Suihua Cai, Nina Lin, and Xiao Ma, “Block Markov
Superposition Transmission of BCH Codes with Iterative
Erasures-and-Errors Decoders”, IEEE 2019.
[6] Gianluigi Liva, Lorenzo Gaudio, Tudor Ninacs and Thomas
Jerkovits, “Code Design for Short Blocks: A Survey”, IEEE
2018.
[7] Erdal Arıkan, Daniel J. Costello, Jr., Joerg Kliewer, Michael
Lentmaier, Paul Siegel, Ruediger Urbanke, Michael Pursley,
Fig.14 Coded and un-coded error rates “Guest Editorial Recent Advances in Capacity Approaching
Codes”, IEEE 2017.
[8] Boulat A. Bash, Dennis Goeckel, Saikat Guha, Don
Figure 14 depicts the comparative analysis of the un- Towsley, “Hiding Information in Noise: Fundamental
coded, hard coded and soft coded (Turbo) versions of Limits of Covert Wireless Communication” , IEEE 2015.
binary transmission for the system. It can be clearly [9] Zunaira Babar, Soon Xin Ng and Lajos Hanzo, EXIT-Chart
observed that the soft turbo coded probabilistic approach Aided Near-Capacity Quantum Turbo Code Design” , IEEE
2015.
attains the steepest fall in the error rate compared to the
[10] Michael Lentmaiery, Saeedeh Moloudiy, and Alexandre
hard coded and un-coded counterparts.
Graell i Amat, Braided Convolutional Codes – A Class of
Spatially Coupled Turbo-Like Codes” , IEEE 2014.
[11] Tsung-Yi Chen, Kasra Vakilinia, Dariush Divsalar, and
V. CONCLUSION
Richard D. Wesel, Protograph-Based Raptor-Like LDPC
Internet of Things (IoT) networks are finding Codes” , IEEE 2014.
applications in different domains such as automation, [12] A. Amat S. Moloudi and M. Lentmaier, “Spatially coupled
climate monitoring, defense etc. However, due to the Turbo codes: Principles and finite length performance,”
wireless medium of the nature, noise and disturbance IEEE 11th ISWCS, pp. 883– 887, 2014.
effects cause increase in the bit error rate of the system [13] T. Breddermann and V. Peter, “Rate-compatible insertion
convolutional Turbo codes: Analysis and application to
thereby causing low reliability and trustworthiness. The
LTE,” IEEE Trans. Wireless Comm., vol. 13, no. 3, pp.
essence of the turbo coding mechanism lies in the fact of
1356– 1366, Mar. 2014.
steep fall in errors near the relatively low SNR values. The [14] K Niu, K Chen, JR Lin, Beyond turbo codes: Rate-
proposed system implements coupling of both I and P bits compatible punctured polar codes” , IEEE 2013
in adjacent code blocks. To recreate a practical IoT [15] MM Wilde, MH Hsieh, Z Babar, Entanglement-assisted
scenario, noise is added to the bit stream. The quantum turbo codes, IEEE 2013
experimental results are gauged in terms of the iterations [16] G Liva, E Paolini, B Matuz, S Scalise, Short turbo codes
to attain low values of the errors for the low Shannon over high order fields, IEEE 2013
range SNR. The BER obtained by the proposed system is [17] K Anwar, T Matsumoto, Accumulator-assisted distributed
turbo codes for relay systems exploiting source-relay
10-7 which is significantly less than the BER of the
correlation” , IEEE 2012
previous system 10-5 [1]. Thus it can be concluded that
[18] K Niu, K Chen, CRC-aided decoding of polar codes” , IEEE
that the proposed system outperforms existing work in 2012
terms of the bit error rate (BER) which is the predominant [19] SH Lee, JK Kwon, Turbo code-based error correction
metric for system reliability and trustworthiness. scheme for dimmable visible light communication
systems” , IEEE 2012
[20] T. Breddermann and P. Vary. EXIT functions for parallel
REFERENCES concatenated insertion convolutional codes,” IEEE, 2011.
[1] S. Zhao, J. Wen, S. Mumtaz, S. Garg and B. J. Choi, [21] MM Wilde, MH Hsieh, Entanglement boosts quantum turbo
"Spatially Coupled Codes via Partial and Recursive codes” , IEEE 2011
Superposition for Industrial IoT With High [22] G Liva, S Scalise, E Paolini, Turbo codes based on time-
Trustworthiness," in IEEE Transactions on Industrial variant memory-1 convolutional codes over Fq” , IEEE
Informatics 2022, vol. 16, no. 9, pp. 6143-6153. 2011

www.ijaers.com Page | 6
Ahirwal and Marmat International Journal of Advanced Engineering Research and Science, 11(8)-2024

[23] QT Dong, M Arzel, C Jego, Stochastic decoding of turbo

codes:, IEEE 2010
[24] M Cluzeau, M Finiasz, JP Tillich, Methods for the
reconstruction of parallel turbo codes, IEEE 2010
[25] A. Jangid and P. Chauhan, "A Survey and Challenges in IoT
Networks," 2019 International Conference on Intelligent
Sustainable Systems (ICISS), 2019, pp. 516-521.
[26] R. G. Maunder, "A Fully-Parallel Turbo Decoding
Algorithm," in IEEE Transactions on Communications,
2015, vol. 63, no. 8, pp. 2762-2775.
[27] Y. Jiang, S. Kannan, H. Kim, S. Oh, H. Asnani and P.
Viswanath, "DEEPTURBO: Deep Turbo Decoder," 2019
IEEE 20th International Workshop on Signal Processing
Advances in Wireless Communications (SPAWC), 2019,
pp. 1-5.
[28] P Durga, B Yamuna, P Salija, Implementation of low
complex SOVA in GNU radio, Procedia in Computer
Science, Elsevier 2018, vol. 143, pp.876-885.

www.ijaers.com Page | 7