Chase-Like Decoding of Arithmetic Codes with Applications

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.

Download Full-text

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

Wireless Communications and Mobile Computing ◽

10.1155/2021/4099918 ◽

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.

Download Full-text

Iterative Soft Permutation Decoding of Product Codes

Computer and Information Science ◽

10.5539/cis.v9n1p128 ◽

2016 ◽

Vol 9 (1) ◽

pp. 128 ◽

Cited By ~ 1

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

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

Download Full-text

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

Entropy ◽

10.3390/e23020240 ◽

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.

Download Full-text

BER Performance Analysis of Non-Coherent Q-Ary Pulse Position Modulation Receivers on AWGN Channel

Sensors ◽

10.3390/s21186102 ◽

2021 ◽

Vol 21 (18) ◽

pp. 6102

Author(s):

Xianhua Shi ◽

Yimao Sun ◽

Jie Tian ◽

Maolin Chen ◽

Youjiang Liu ◽

...

Keyword(s):

Gaussian Noise ◽

Additive White Gaussian Noise ◽

Theoretical Formula ◽

Pulse Position Modulation ◽

Error Performance ◽

Optimal Receiver ◽

Awgn Channel ◽

Simulation Results ◽

The Relationship ◽

Better Than

This paper introduces the structure of a Q-ary pulse position modulation (PPM) signal and presents a noncoherent suboptimal receiver and a noncoherent optimal receiver. Aiming at addressing the lack of an accurate theoretical formula of the bit error rate (BER) of a Q-ary PPM receiver in the additive white Gaussian noise (AWGN) channel in the existing literature, the theoretical formulas of the BER of a noncoherent suboptimal receiver and noncoherent optimal receiver are derived, respectively. The simulation results verify the correctness of the theoretical formulas. The theoretical formulas can be applied to a Q-ary PPM system including binary PPM. In addition, the analysis shows that the larger the Q, the better the error performance of the receiver and that the error performance of the optimal receiver is about 2 dB better than that of the suboptimal receiver. The relationship between the threshold coefficient of the suboptimal receiver and the error performance is also given.

Download Full-text

A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes

Wireless Communications and Mobile Computing ◽

10.1155/2021/6698602 ◽

2021 ◽

Vol 2021 ◽

pp. 1-11

Author(s):

Chakir Aqil ◽

Ismail Akharraz ◽

Abdelaziz Ahaitouf

Keyword(s):

Gaussian Noise ◽

Additive White Gaussian Noise ◽

Ldpc Codes ◽

Low Density ◽

Parity Check ◽

Coding Gain ◽

Decoding Complexity ◽

Low Density Parity Check ◽

Awgn Channel ◽

Infinite Loop

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low-Density Parity-Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.

Download Full-text

Rate-compatible LDPC convolutional codes over non-gaussian noise channel

MATEC Web of Conferences ◽

10.1051/matecconf/202030901010 ◽

2020 ◽

Vol 309 ◽

pp. 01010

Author(s):

Qiang Liu

Keyword(s):

Gaussian Noise ◽

Iterative Decoding ◽

Belief Propagation ◽

Additive White Gaussian Noise ◽

Convolutional Codes ◽

Gaussian Mixture ◽

Performance Study ◽

Shift Keying ◽

Non Gaussian ◽

The Impact

This paper is aimed to study the characteristics of the underwater acoustic channel with non-Gaussian noise channel. And Gaussian mixture model (GMM) is utilized to fit the background noise over the non-Gaussian noise channel. Furthermore, coding techniques which use a sequence of rate-compatible low-density parity-check (RC-LDPC) convolutional codes with separate rates are constructed based on graph extension method. The performance study of RC-LDPC convolutional codes over non-Gaussian noise channel and the additive white Gaussian noise (AWGN) channel is performed. Study implementation of simulation is that modulation with binary phase shift keying (BPSK), and iterative decoding based on pipeline log-likelihood rate belief propagation (LLRBP) algorithm. Finally, it is shown that RC-LDPC convolutional codes have good bit-rate-error (BER) performance and can effectively reduce the impact of noise.

Download Full-text

Encoder Lipschitz Integers: The Lipschitz integers that have the ”division with small remainder” property

10.21203/rs.3.rs-1053517/v2 ◽

2021 ◽

Author(s):

Ramazan Duram ◽

Murat Güzeltepe

Keyword(s):

Gaussian Noise ◽

Figure Of Merit ◽

Residue Class ◽

Signal To Noise Ratio ◽

Additive White Gaussian Noise ◽

Average Energy ◽

Division Algorithm ◽

Prime Integer ◽

Awgn Channel ◽

Signal Constellations

Abstract The residue class set of a Lipschitz integer is constructed by modulo function with primitive Lipschitz integer whose norm is a prime integer, i.e. prime Lipschitz integer. In this study, we consider primitive Lipschitz integer whose norm is both a prime integer and not a prime integer. If the norm of each element of the residue class set of a Lipschitz integer is less than the norm of the primitive Lipschitz integer used to construct the residue class set of the Lipschitz integer, then, the Euclid division algorithm works for this primitive Lipschitz integer. The Euclid division algorithm always works for prime Lipschitz integers. In other words, the prime Lipschitz integers have the ”division with small remainder” property. However, this property is ignored in some studies that have a constructed Lipschitz residue class set that lies on primitive Lipschitz integers whose norm is not a prime integer. In this study, we solve this problem by defining Lipschitz integers that have the ”division with small remainder” property, namely, encoder Lipschitz integers set. Therefore, we can define appropriate metrics for codes over Lipschitz integers. Also, we investigate the performances of Lipschitz signal constellations (the left residue class set) obtained by modulo function with Lipschitz integers, which have the ”division with small remainder” property, over the additive white Gaussian noise (AWGN) channel by agency of the constellation figure of merit (CFM), average energy, and signal-to-noise ratio (SNR).

Download Full-text

Encoder Lipschitz Integers: The Lipschitz integers that have the ”division with small division” property

10.21203/rs.3.rs-1053517/v1 ◽

2021 ◽

Author(s):

Ramazan Duram ◽

Murat Güzeltepe

Keyword(s):

Gaussian Noise ◽

Figure Of Merit ◽

Residue Class ◽

Signal To Noise Ratio ◽

Additive White Gaussian Noise ◽

Average Energy ◽

Division Algorithm ◽

Prime Integer ◽

Awgn Channel ◽

Signal Constellations

Abstract The residue class set of a Lipschitz integer is constructed by modulo function with primitive Lipschitz integer whose norm is a prime integer, i.e. prime Lipschitz integer. In this study, we consider primitive Lipschitz integer whose norm is both a prime integer and not a prime integer. If the norm of each element of the residue class set of a Lipschitz integer is less than the norm of the primitive Lipschitz integer used to construct the residue class set of the Lipschitz integer, then, the Euclid division algorithm works for this primitive Lipschitz integer. The Euclid division algorithm always works for prime Lipschitz integers. In other words, the prime Lipschitz integers have the ”division with small remainder” property. However, this property is ignored in some studies that have a constructed Lipschitz residue class set that lies on primitive Lipschitz integers whose norm is not a prime integer. In this study, we solve this problem by defining Lipschitz integers that have the ”division with small remainder” property, namely, encoder Lipschitz integers set. Therefore, we can define appropriate metrics for codes over Lipschitz integers. Also, we investigate the performances of Lipschitz signal constellations (the left residue class set) obtained by modulo function with Lipschitz integers, which have the ”division with small remainder” property, over the additive white Gaussian noise (AWGN) channel by agency of the constellation figure of merit (CFM), average energy, and signal-to-noise ratio (SNR).

Download Full-text

Використання візуальних метрик для аналізу стиснення з втратами зашумлених зображень

Aerospace technic and technology ◽

10.32620/aktt.2021.6.09 ◽

2021 ◽

pp. 83-91

Author(s):

Богдан Віталійович Коваленко ◽

Володимир Васильович Лукін

Keyword(s):

Image Quality ◽

Image Compression ◽

Gaussian Noise ◽

Additive White Gaussian Noise ◽

Visual Image ◽

Visual Quality ◽

Low Complexity ◽

Quality Metrics ◽

Operating Point ◽

Noise Variance

The subject of the article is to analyze the effectiveness of lossy image compression using a BPG encoder using visual metrics as a quality criterion. The aim is to confirm the existence of an operating point for images of varying complexity for visual quality metrics. The objectives of the paper are the following: to analyze for a set of images of varying complexity, where images are distorted by additive white Gaussian noise with different variance values, build and analyze dependencies for visual image quality metrics, provide recommendations on the choice of parameters for compression in the vicinity of the operating point. The methods used are the following: methods of mathematical statistics; methods of digital image processing. The following results were obtained. Dependencies of visual quality metrics for images of various degrees of complexity affected by noise with variance equal to 64, 100, and 196. It can be seen from the constructed dependence that a working point is present for images of medium and low complexity for both the PSNR-HVS-M and MS-SSIM metrics. Recommendations are given for choosing a parameter for compression based on the obtained dependencies. Conclusions. Scientific novelty of the obtained results is the following: for a new compression method using Better Portable Graphics (BPG), research has been conducted and the existence of an operating point for visual quality metrics has been proven, previously such studies were conducted only for the PSNR metric.The test images were distorted by additive white Gaussian noise and then compressed using the methods implemented in the BPG encoder. The images were compressed with different values of the Q parameter, which made it possible to estimate the image compression quality at different values of compression ratio. The resulting data made it possible to visualize the dependence of the visual image quality metric on the Q parameter. Based on the obtained dependencies, it can be concluded that the operating point is present both for the PSNR-HVS-M metric and for the MS-SSIM for images of medium and low complexity, it is also worth noting that, especially clearly, the operating point is noticeable at large noise variance values. As a recommendation, a formula is presented for calculating the value of the compression control parameter (for the case with the BPG encoder, it is the Q parameter) for images distorted by noise with variance varying within a wide range, on the assumption that the noise variance is a priori known or estimated with high accuracy.

Download Full-text