Design of an Efficient Segmented Parallel Turbo Decoder

A segmented parallel Turbo decoder was designed to address the performance loss of sub-block parallel algorithms and the optimization of the decoding delay for Turbo codes. The proposed decoding algorithm is based on the idea of sub-block parallelism, introduces pre-calculation operations, optimizes...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2025 8th World Conference on Computing and Communication Technologies (WCCCT) s. 191 - 198
Hlavní autoři: Zhang, Yining, Zheng, Zhe, Zhou, Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 11.04.2025
Témata:
Convergence
Decoding
Delays
Iterative decoding
MAP algorithm
Optimization
parallel processing
Resource management
Satellites
Signal to noise ratio
Throughput
Turbo Code
Turbo codes
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A segmented parallel Turbo decoder was designed to address the performance loss of sub-block parallel algorithms and the optimization of the decoding delay for Turbo codes. The proposed decoding algorithm is based on the idea of sub-block parallelism, introduces pre-calculation operations, optimizes the decoding performance of parallel decoding algorithms, reduces the number of iterations, and utilizing methods such as segmentation processing, the running efficiency of the algorithm block has been improved. The results show that the segmented parallel decoding algorithm can effectively improve the decoding performance and convergence speed of each iteration compared to the sub-block parallel decoding algorithm, and according to the different choices of parallelism, the decoding speed of the segmented parallel decoding algorithm is several times higher than that of the traditional Turbo decoding algorithm and sliding window algorithm.
DOI:10.1109/WCCCT65447.2025.11028014