Forward Error Correction Codes in Communication Channels

Shim, Yong-Geol

doi:10.14257/ijca.2017.10.4.12

Cited by 5 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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]. The adjacent measure has constant weight with the symbol code which gives zeros in the synchronized space.…”

Section: -1-sufficient Conditionmentioning

confidence: 99%

“…The adjacent measure has constant weight with the symbol code which gives zeros in the synchronized space. The maximum likelihood unrestricted decision of redundant bits determines the decision threshold [4].…”

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: -1-sufficient Conditionmentioning

confidence: 99%

Section: -1-sufficient Conditionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…In [25] authors have proposed an iterative decoding version of SPDA. In [26], Shim have proposed a forward error correction codes in communication channels to facilitate selfsynchronization of digital communication systems. In [27] a compact Genetic Algorithms with larger tournament (cGA) is used to propose two dual domain Soft Decision decoders.…”

Section: Related Workmentioning

confidence: 99%

“…In Fig. 6, we present a comparison of the performances of the proposed SDHT, Chase-HSDec, Maini, OSD-1 and DDGA for BCH (31,26,3) and BCH (31,21,5) code. This figure shows that the proposed SDHT passes remarkably Chase-HSDec and it has the same performances comparing to Maini, OSD-1 and DDGA decoders.…”

Section: Simulation Parameters Value Minimum Number Of Residual Bit Imentioning

confidence: 99%

High Speed Soft Decision Decoding of Linear Codes Based on Hash and Syndrome Decoding

Alaoui¹,

Nouh²,

Marzak³

2019

IJIES

View full text Add to dashboard Cite

Digital transmission systems carry information from the source to the receiver using a physical medium such as cable, fiber optic or even propagation on a radio channel which isn't entirely reliable and causes the change of data originally emitted. Today the use of error correcting codes for protection and correction becomes an integral part in the design of communication systems and computers. In this work, we present a new interesting way to accelerate the decoding process of linear codes. The proposed method called Soft Decision Decoder by Hash Techniques (SDHT) is based on syndrome-decoding algorithm and hash techniques. The use of this latest allows reducing considerably the search time of all possible error patterns of weights less than a fixed threshold. SDHT is applicable on many linear codes and exploit the polynomial form to reduce again the run time decoding for cyclic codes. SDHT is successfully applied to decode some Bose Ray-Chaudhuri and Hocquenghem (BCH), Quadratic Residue (QR) and Extended Quadratic Residue (EQR) codes. The simulation results show that the proposed SDHT yield to good error correcting performances with reduced complexity. The comparison between SDHT and many competitors shows that it gives better performances in terms of correction rate. The experimental study of the decoding steps for the BCH(63,45,7) code shows that the time search of the most likely error pattern is reduced at about 26214153% comparing to an exhaustive search of all possible error patterns of weights less than or equal to 4. This study proves the huge success of the proposed SDHT decoder.

show abstract

Fast and Efficient Decoding Algorithm Developed from Concatenation Between a Symbol-by-Symbol Decoder and a Decoder Based on Syndrome Computing and Hash Techniques

Alaoui

Nouh

Marzak

2020

Embedded Systems and Artificial Intelligence

View full text Add to dashboard Cite

Forward Error Correction Codes in Communication Channels

Abstract: Abstract

Cited by 5 publications

References 11 publications

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

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

High Speed Soft Decision Decoding of Linear Codes Based on Hash and Syndrome Decoding

Fast and Efficient Decoding Algorithm Developed from Concatenation Between a Symbol-by-Symbol Decoder and a Decoder Based on Syndrome Computing and Hash Techniques

Contact Info

Product

Resources

About