Serial and parallel turbo code test over AWGN channel with different modulation

2022 ◽  
Author(s):  
Mohammed Abdulhamza Lafta ◽  
Samir Jasim Mohammed
Keyword(s):  
Turbo Code ◽  
Awgn Channel

scholarly journals Performance of Turbo Code in CDMA under AWGN Channel

2017 ◽  
Vol 10 (5) ◽  
pp. 19-28
Author(s):  
Mohanad Babiker ◽  
Othman Omran Khalifa ◽  
Aisha Hassan Abdullah Hashim ◽  
Momoh J. E. Salami ◽  
Muhammed Zaharadeen Ahmed
Keyword(s):  
Turbo Code ◽  
Awgn Channel

A Study on Turbo Code Performance Based on AWGN Channel

2013 ◽  
Vol 347-350 ◽  
pp. 1720-1726
Author(s):  
Peng Zhu ◽  
Jun Zhu ◽  
Xiang Liu
Keyword(s):  
Mobile Communications ◽  
Turbo Codes ◽  
Turbo Code ◽  
Signal To Noise Ratio ◽  
Satellite Communications ◽  
Decoding Algorithm ◽  
Awgn Channel ◽  
Code Performance ◽  
Wide Range ◽  
Number Of Iterations

Turbo codes have a wide range of applications in 3G mobile communications, deep-sea communications, satellite communications and other power constrained fields. In the paper, the Turbo Code Decoding Principle and several major decoding methods are introduced. Simulations of Turbo code performance under different parameters of AWGN channel are made and the effects of the different interleaving length, the number of iterations, and the decoding algorithm to Turbo code performance are also discussed in AWGN channel. Simulation results show that under the same signal-to-noise ratio, the more the number of iterations is, the longer the sequence of information is, and the more excellent decoding algorithm is, the better the performance of Turbo codes is.

scholarly journals Irregular Vector Turbo Codes with Low Complexity

2021 ◽  
Author(s):  
Abiodun Sholiyi ◽  
Timothy O Farrell
Keyword(s):  
Turbo Codes ◽  
Iterative Decoding ◽  
Turbo Code ◽  
Block Code ◽  
Low Complexity ◽  
Modulation Scheme ◽  
Awgn Channel ◽  
Block Turbo Code ◽  
Serially Concatenated ◽  
Block Turbo Codes

Abstract The term Block Turbo Code typically refers to the iterative decoding of a serially concatenated two-dimensional systematic block code. This paper introduces a Vector Turbo Code that is irregular but with code rates comparable to those of a Block Turbo Code (BTC) when the Bahl Cocke Jelinek Raviv (BCJR) algorithm is used. In Block Turbo Codes, the horizontal (or vertical) blocks are encoded first and the vertical (or horizontal) blocks second. The irregular Vector Turbo Code (iVTC) uses information bits that participate in varying numbers of trellis sections, which are organized into blocks that are encoded horizontally (or vertical) without vertical (or horizontal) encoding. The decoding requires only one soft-input soft-output (SISO) decoder. In general, a reduction in complexity, in comparison to a Block Turbo Code was achieved for the same very low probability of bit error (10−5 ). Performance in the AWGN channel shows that iVTC is capable of achieving a significant coding gain of 1.28 dB for a 64QAM modulation scheme, at a bit error rate (BER) of 10−5over its corresponding Block Turbo Code. Simulation results also show that some of these codes perform within 0.49 dB of capacity for binary transmission over an AWGN channel.

Performance Comparison between Turbo Code and Rate-Compatible LDPC Code for Evolved UTRA Downlink OFDM Radio Access

2009 ◽  
Vol E92-B (5) ◽  
pp. 1504-1515 ◽  
Author(s):  
Naoto OKUBO ◽  
Nobuhiko MIKI ◽  
Yoshihisa KISHIYAMA ◽  
Kenichi HIGUCHI ◽  
Mamoru SAWAHASHI
Keyword(s):  
Turbo Code ◽  
Ldpc Code ◽  
Performance Comparison ◽  
Radio Access

scholarly journals Threshold Computation for Spatially Coupled Turbo-Like Codes on the AWGN Channel

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 240
Author(s):  
Muhammad Umar Farooq ◽  
Alexandre Graell i Amat ◽  
Michael Lentmaier
Keyword(s):  
Gaussian Noise ◽  
Belief Propagation ◽  
Additive White Gaussian Noise ◽  
Maximum A Posteriori ◽  
Prediction Methods ◽  
Threshold Analysis ◽  
A Posteriori ◽  
Awgn Channel ◽  
Efficient Prediction ◽  
Binary Erasure Channel

In this paper, we perform a belief propagation (BP) decoding threshold analysis of spatially coupled (SC) turbo-like codes (TCs) (SC-TCs) on the additive white Gaussian noise (AWGN) channel. We review Monte-Carlo density evolution (MC-DE) and efficient prediction methods, which determine the BP thresholds of SC-TCs over the AWGN channel. We demonstrate that instead of performing time-consuming MC-DE computations, the BP threshold of SC-TCs over the AWGN channel can be predicted very efficiently from their binary erasure channel (BEC) thresholds. From threshold results, we conjecture that the similarity of MC-DE and predicted thresholds is related to the threshold saturation capability as well as capacity-approaching maximum a posteriori (MAP) performance of an SC-TC ensemble.

Sign in / Sign up

Export Citation Format

Share Document