Combining serial and parallel decoding for turbo codes

AlMahamdy, Mohammed; Al-Falahy, Naser

doi:10.11591/ijeecs.v24.i2.pp896-903

Cited by 2 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the paper, Shah et al [10] turbo code is an error correction algorithm that sends data over a channel with a very low bit error rate. This code comprises two-block convolutional codes concatenated in parallel and separated by a random interleaver [11], [12]. In the paper, MacKay [13] fountain code, also referred to as rateless code, is a new member of the channel coding family that can produce an infinite number of encoding symbols from a set of source symbols k. In the paper, MacKay [13] demonstrates the essential advantages of fountain codes related to efficiency, durability, and reliability over the AWGN channel and fading channels [14], [15].…”

Section: Issn: 2502-4752 mentioning

confidence: 99%

“…At the transmitting side, the information bits are encoding and block-interleaved. For the turbo code, the encoding stage comprises two recursive systematic convolutional (RSC) encoders concatenate in parallel at a rate of 1/2, as specified in [12]. The traditional 1/3 rate in turbo code is converted to 1/2 by puncturing the parity bits alternately.…”

Section: Turbo-coded Ds-cdma Systemmentioning

confidence: 99%

See 1 more Smart Citation

Enhancement of code division multiple access system performance using raptor codes

Farhan

Zaghar

Abdullah

2022

IJEECS

View full text Add to dashboard Cite

Some kinds of communication systems work in very low signal-to-noise (LSNR) environments. For these systems to function reliably, <span>specific techniques and methodologies have to be used to mitigate the degrading effects of the channel. The channel coding method is the key element in most LSNR communication systems, but emphasizing the code division multiple access (CDMA) is a new transmission technique in these channels. To enhance the CDMA scheme's system capacity and reach unprecedented ranges of LSNR values in wireless sensor network. This paper suggests combining CDMA with certain types of channel coding algorithms, such as the raptor codes. The raptor channel encoding technique has improved the CDMA system's performance when using binary phase-shift keying (BPSK) modulation in additive white gaussian noise (AWGN) channels. It has achieved a low bit error rate in range of 10-7 at Eb/No value of (-3) dB and about 10-6 at shannon's limit. The Raptor-coded CDMA scheme works well for channel signal to noise ration (SNR) values of greater than -9 dB, showing an improvement of about 7 dB compared with turbo/convolutional channel coding methods used with the CDMA system bit error rate (BER) and throughput. On the other hand, it has been shown that the convolutional encoder presents the weakest performance compared to both the turbo and raptor codes.</span>

show abstract

Section: Issn: 2502-4752 mentioning

confidence: 99%

Section: Turbo-coded Ds-cdma Systemmentioning

confidence: 99%

Enhancement of code division multiple access system performance using raptor codes

Farhan

Zaghar

Abdullah

2022

IJEECS

View full text Add to dashboard Cite

show abstract

“…We are living in an era of advanced technology, the need for wireless access for voice and multimedia has increased enormously. This need has created a wide range of technical challenges like cost, high speed, throughput, low complexity, low power and low latency as in [1]- [4]. Low density parity check (LDPC) codes [5] of shorter length (i.e., codes with dimension k in the range of 50 to 1000 bits) are considered as they offer advantages in terms of latency and complexity, at the cost of performance degradation due to the increased number of short cycles in the tanner graph (TG) [6], contrary to the LDPC code with the large block length as we can see in the study presented in [7] or [8].…”

Section: Introductionmentioning

confidence: 99%

Girth aware normalized min sum decoding algorithm for shorter length low density parity check codes

Kadi

Ouakili

Alami

et al. 2022

IJEECS

View full text Add to dashboard Cite

Recently, short block codes are in great demand due to the emergent applications requiring the transmission of a short data unit and can guarantee speedy communication, with a minimum of latency and complexity which are among the technical challenges in today’s wireless services and systems. In the context of channel coding using low density parity check (LDPC) codes, the shorter length LDPC block codes are more likely to have short cycles with lengths of 4 and 6. The effect of the cycle with the minimum size is that this one prevents the propagation of the information in the Tanner graph during the iterative process. Therefore, the message decoded by short block code is assumed to be of poor quality due to short cycles. In this work, we present a study of the evolution of the messages on check nodes during the iterative decoding process when using the LDPC decoding algorithm normalized min sum (NMS), to see the destructive effect of short cycles and justify the effectiveness of the girth aware normalized min sum (GA-NMS) decoding LDPC codes algorithm in terms of correction of the errors, particularly for the codes with short cycles 4 and 6. In addition to this, the GA-NMS algorithm is evaluated in terms of bit error rate performance and convergence behavior, using wireless regional area networks (WRAN) LDPC code, which is considered as a short block code.

show abstract

Combining serial and parallel decoding for turbo codes

Cited by 2 publications

References 21 publications

Enhancement of code division multiple access system performance using raptor codes

Enhancement of code division multiple access system performance using raptor codes

Girth aware normalized min sum decoding algorithm for shorter length low density parity check codes

Contact Info

Product

Resources

About