Iterative Decoding for the Davey-MacKay Construction over IDS-AWGN Channel

2013 ◽  
Vol E96.A (5) ◽  
pp. 1006-1009
Author(s):  
Xiaopeng JIAO ◽  
Jianjun MU ◽  
Rong SUN
Keyword(s):  
Iterative Decoding ◽  
Awgn Channel

scholarly journals Design of Nonbinary LDPC Cycle Codes with Large Girth from Circulants and Finite Fields

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hengzhou Xu ◽  
Huaan Li ◽  
Jixun Gao ◽  
Guixiang Zhang ◽  
Hai Zhu ◽  
...  
Keyword(s):  
Finite Fields ◽  
Gaussian Noise ◽  
Iterative Decoding ◽  
Additive White Gaussian Noise ◽  
Ldpc Codes ◽  
Parity Check ◽  
Undirected Graphs ◽  
Awgn Channel ◽  
Exponent Matrix ◽  
Large Girth

In this paper, we study a class of nonbinary LDPC (NBLDPC) codes whose parity-check matrices have column weight 2, called NBLDPC cycle codes. We propose a design framework of 2 , ρ -regular binary quasi-cyclic (QC) LDPC codes and then construct NBLDPC cycle codes of large girth based on circulants and finite fields by randomly choosing the nonzero field elements in their parity-check matrices. For enlarging the girth values, our approach is twofold. First, we give an exhaustive search of circulants with column/row weight ρ and design a masking matrix with good cycle distribution based on the edge-node relation in undirected graphs. Second, according to the designed masking matrix, we construct the exponent matrix based on finite fields. The iterative decoding performances of the constructed codes on the additive white Gaussian noise (AWGN) channel are finally provided.

scholarly journals Iterative Soft Permutation Decoding of Product Codes

2016 ◽  
Vol 9 (1) ◽  
pp. 128 ◽  
Author(s):  
Mohamed Askali ◽  
Fouad Ayoub ◽  
Idriss Chana ◽  
Mostafa Belkasmi
Keyword(s):  
Gaussian Noise ◽  
Iterative Decoding ◽  
Additive White Gaussian Noise ◽  
Quadratic Residue ◽  
White Gaussian Noise ◽  
Permutation Decoding ◽  
Product Codes ◽  
Quadratic Residue Codes ◽  
Numerical Result ◽  
Awgn Channel

<p>In this paper the performance of product codes based on quadratic residue codes is investigated. Our Proposed<br />Iterative decoding SISO based on a soft permutation decoding algorithm (SPDA) as a component decoder.<br />Numerical result for the proposed algorithm over Additive White Gaussian Noise (AWGN) channel is provided.<br />Results show that the turbo effect of the proposed decoder algorithm is established for this family of quadratic<br />residue codes.</p>

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.

Chase-Like Decoding of Arithmetic Codes with Applications

2013 ◽  
pp. 27-41
Author(s):  
Amin Zribi ◽  
Sonia Zaibi ◽  
Ramesh Pyndiah ◽  
Ammar Bouallègue
Keyword(s):  
Image Compression ◽  
Gaussian Noise ◽  
Iterative Decoding ◽  
Convolutional Code ◽  
Additive White Gaussian Noise ◽  
Error Rates ◽  
Sequence Estimation ◽  
Awgn Channel ◽  
Arithmetic Codes ◽  
Classical Arithmetic

Motivated by recent results in Joint Source/Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates (PER) in the case of transmission on an Additive White Gaussian Noise (AWGN) channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations.

Iterative decoding for coded noncoherent MPSK communications over phase-noisy AWGN channel

2000 ◽  
Vol 147 (2) ◽  
pp. 87 ◽  
Author(s):  
M. Peleg ◽  
S. Shamai (Shitz) ◽  
S. Galán
Keyword(s):  
Iterative Decoding ◽  
Awgn Channel

Chase-Like Decoding of Arithmetic Codes with Applications

2011 ◽  
Vol 1 (1) ◽  
pp. 27-40
Author(s):  
Amin Zribi ◽  
Sonia Zaibi ◽  
Ramesh Pyndiah ◽  
Ammar Bouallègue
Keyword(s):  
Image Compression ◽  
Iterative Decoding ◽  
Convolutional Code ◽  
Additive White Gaussian Noise ◽  
Error Rates ◽  
Symbol Sequence ◽  
Sequence Estimation ◽  
Awgn Channel ◽  
Arithmetic Codes ◽  
Classical Arithmetic

Motivated by recent results in Joint Source/ Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symbol sequence and the compressed bit-stream lengths. First, Packet Error Rates (PER) in the case of transmission on an Additive White Gaussian Noise (AWGN) channel are investigated. Compared to classical arithmetic decoding, the Chase-like decoder shows significant improvements. Results are provided for Chase-like decoding for image compression and transmission on an AWGN channel. Both lossy and lossless image compression schemes were studied. As a final application, the serial concatenation of an AC with a convolutional code was considered. Iterative decoding, performed between the two decoders showed substantial performance improvement through iterations.

Sign in / Sign up

Export Citation Format

Share Document