An Error Control Method with Linear Block Code in Sensor Networks

Shim, Yong-Geol

doi:10.1155/2014/439231

Cited by 1 publication

(3 citation statements)

References 12 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A binary antipodal signal associated with code word is transmitted. An error control system uses linear code which has minimum distance d [9]. From the communication channel, two vectors are received.…”

Section: -Soft Decision Decodingmentioning

confidence: 99%

“…The scaled regions are designed to achieve the uniform phase [7,8]. The symmetry properties of signal space codes are isomorphic to the signal set in the demodulator [9]. The carrier decision is derived by the normalized metric of synchronized space [4,6].…”

Section: -1-sufficient Conditionmentioning

confidence: 99%

“…In this paper, we shall investigate the former approach. The conventional algorithms have excellence in either error probability or decoding complexity [1, [4][5][6][7][8][9][10]. Zhang et al (2017) [11] proposed a feedback method combined with the low-density parity-check codes for building the wiretap channel.…”

mentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Decoding Algorithm for Block Codes Based on the Communication Channel Reliability Information

Shim

2020

Emerg Sci J

Self Cite

View full text Add to dashboard Cite

For channel codes in communication systems, an efficient algorithm that controls error is proposed. It is an algorithm for soft decision decoding of block codes. The sufficient conditions to obtain the optimum decoding are deduced so that the efficient method which explores candidate code words can be presented. The information vector of signal space codes has isomorphic coherence. The path metric in the coded demodulator is the selected components of scaled regions. The carrier decision is derived by the normalized metric of synchronized space. An efficient algorithm is proposed based on the method. The algorithm finds out a group of candidate code words, in which the most likely one is chosen as a decoding result. The algorithm reduces the complexity, which is the number of candidate code words. It also increases the probability that the correct code word is included in the candidate code words. It is shown that both the error probability and the complexity are reduced. The positions of the first hard-decision decoded errors and the positions of the unreliable bits are carefully examined. From this examination, the candidate codewords are efficiently searched for. The aim of this paper is to reduce the required number of hard-decision decoding and to lower the block error probability.

show abstract

Section: -Soft Decision Decodingmentioning

confidence: 99%