Advanced search ?

Object

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes, Journal of Telecommunications and Information Technology, 2022, nr 2
Download

Title: Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes, Journal of Telecommunications and Information Technology, 2022, nr 2

Creator:

Abderrahmane, Lahcene Hadj ; Ali-Pacha, Adda ; Iftene, Essedik

Date:

2022, nr 2

Resource Type:

artykuł

Description:

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.

Publisher:

Instytut Łączności - Państwowy Instytut Badawczy

Format:

application/pdf

Resource Identifier:

ISSN 1509-4553, on-line: ISSN 1899-8852 ; oai:bc.itl.waw.pl:2224

Source:

Journal of Telecommunications and Information Technology

Language:

ang

Rights Management:

Biblioteka Naukowa Instytutu Łączności

Subject and keywords:

interleaver key iterative decoding Rayleigh fading channel golden section theory turbo code AWGN channel

Object collections:

Last modified:

Mar 12, 2024

In our library since:

Jul 21, 2022

Number of object content hits:

33

All available object's versions:

https://ribes-54.man.poznan.pl/publication/2531

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Edition name Date
Iftene, Essedik; Ali-Pacha, Adda; Abderrahmane, Lahcene Hadj,Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes, Journal of Telecommunications and Information Technology, 2022, nr 2 Mar 12, 2024

Objects Similar
Modified PSO Based Channel Allocation Scheme for Interference Management in 5G Wireless Mesh Networks, Journal of Telecommunications and Information Technology, 2022, nr 2

Manvi, Sunilkumar S. Benni, Nirmalkumar S.

2022, nr 2
artykuł
Product of Three Random Variables and its Application in Relay Telecommunication Systems in the Presence of Multipath Fading, Journal of Telecommunications and Information Technology, 2019, nr 1

Minic, Sinisa Krstic, Dragana Nikolic, Petar Vuckovic, Dragan Aleksic, Danijela Stefanovic, Mihajlo

2019, nr 1
artykuł
Interleaving Technique Implementation to Reduce PAPR of OFDM Signal in Presence of Nonlinear Amplification with Memory Effects, Journal of Telecommunications and Information Technology, 2018, nr 3

Aimer, Younes Duvanaud, Claude Bachir, Smai Bouazza, Boubakar Seddik

2018, nr 3
artykuł
A Modified Approach to Punctured Product Polar Codes, Journal of Telecommunications and Information Technology, 2019, nr 3

Vafi, Sina Hanif, Mohammad Abu

2019, nr 3
artykuł
2024, nr 1, JTIT-artykuły
2024, nr 1, JTIT-artykuły
Low Complexity Stopping Rule for Turbo Decoding: the Max-log Criterion, Journal of Telecommunications and Information Technology, 2024, nr 1

Ouardi, Aissa

2024
artykuł
More
×

Citation

Citation style:

Contact details

Address

Instytut Łączności – Państwowy Instytut Badawczy ul. Szachowa 1 04-894 Warszawa

Phone

(+48) 5128 696

E-Mail

biblioteka@il-pib.pl

Visit us!

This page uses 'cookies'. More information