A New Block S-Random Interleaver for Shorter Length Frames for Turbo Codes

Salim, Mohammad; Yadav, Rajendra; Narwal, Kapil; Sharma, Aarti

doi:10.11591/eei.v2i4.196

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been found that one way to improve the performance of a turbo coded system is to use a good interleaver structure [5], [7], [8]. Therefore, interleaver design is the subject of numerous research projects and a number of algorithms have been developed [9]- [20]. It is asserted for turbo codes that interleavers with some randomness tend to perform better than their fully structured counterparts, especially for large block sizes.…”

Section: Introductionmentioning

confidence: 99%

“…A change in the length of interleaving requires another search of the interleaving pattern, which implies a more complex implementation. Furthermore, the generated interleavers, characterized by different lengths, should be stored separately in the memory [9], [10]. This causes a serious storage-related concern in a scenario in which many interleaving lengths need to be supported.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes

Iftene¹,

Ali-Pacha²,

Abderrahmane³

2022

JTIT

View full text Add to dashboard Cite

This paper investigates the design of a modified matrix interleaving algorithm as a way to improve the performance of turbo codes. This proposed solution, known as the matrix-dithered golden (MDG) interleaver, utilizes the characteristics of a matrix interleaver combined with the golden section theory. The performance of the proposed interleaving method is compared with that of matrix (M), random (R), and dithered golden (DG) interleavers. The comparison is made in terms of bit error rate (BER), frame error rate (FER), computational complexity, and storage memory requirement. The turbo coded system is implemented and simulated using Matlab/Simulink software. Results of simulations performed both in the additive white Gaussian noise (AWGN) channel and the Rayleigh fading channel demonstrate the effectiveness of the proposed interleaver. The MDG interleaver is an effective replacement for random interleavers, as it improves BER and FER performance of the turbo code and is also capable of reducing the storage memory requirement without increasing the system’s complexity.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes

Iftene¹,

Ali-Pacha²,

Abderrahmane³

2022

JTIT

View full text Add to dashboard Cite

show abstract

Exploiting 2-Dimensional Source Correlation in Channel Decoding with Parameter Estimation

Nor¹,

Izhar²,

Ahmad³

et al. 2018

IJECE

View full text Add to dashboard Cite

Traditionally, it is assumed that source coding is perfect and therefore, the redundancy of the source encoded bit-stream is zero. However, in reality, this is not the case as the existing source encoders are imperfect and yield residual redundancy at the output. The residual redundancy can be exploited by using Joint Source Channel Coding (JSCC) with Markov chain as the source. In several studies, the statistical knowledge of the sources has been assumed to be perfectly available at the receiver. Although the result was better in terms of the BER performance, practically, the source correlation knowledge were not always available at the receiver and thus, this could affect the reliability of the outcome. The source correlation on all rows and columns of the 2D sources were well exploited by using a modified Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm in the decoder. A parameter estimation technique was used jointly with the decoder to estimate the source correlation knowledge. Hence, this research aims to investigate the parameter estimation for 2D JSCC system which reflects a practical scenario where the source correlation knowledge are not always available. We compare the performance of the proposed joint decoding and estimation technique with the ideal 2D JSCC system with perfect knowledge of the source correlation knowledge. Simulation results reveal that our proposed coding scheme performs very close to the ideal 2D JSCC system. Keyword:Bahl-cocke-jelinek-raviv algorithm Baum-welsh algorithm Joint source channel coding Markov chain Parameter estimation

show abstract

A New Block S-Random Interleaver for Shorter Length Frames for Turbo Codes

Cited by 2 publications

References 9 publications

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes

Exploiting 2-Dimensional Source Correlation in Channel Decoding with Parameter Estimation

Contact Info

Product

Resources

About