More Accurate Analysis of Sum-Product Decoding of LDPC Codes Using a Gaussian Approximation

Vatta, F.; Soranzo, Alessandro; Babich, F.

doi:10.1109/lcomm.2018.2886261

Cited by 19 publications

(32 citation statements)

References 12 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, beside the expected higher BER in LoS conditions with respect to that in NLoS ones for a given modulation and mmWave band, one may specifically notice the very low performance that characterizes the 73 GHz channel in the NLoS case. This aspect may be clarified in mathematical terms by jointly observing (7) and (10) in [30], from which one may infer that the increase of the average path-loss exponent β has a relevant impact on the average power E[T ] received at the BS in the absence of mobility. Similar arguments may be exploited to justify the better error performance achievable in the 28 GHz LoS channel.…”

Section: Ber Resultsmentioning

confidence: 99%

Limiting Performance of Millimeter-Wave Communications in the Presence of a 3D Random Waypoint Mobility Model

Comisso

Vatta

Buttazzoni

et al. 2021

JCOMSS

Self Cite

View full text Add to dashboard Cite

This paper proposes a mathematical framework for evaluating the limiting capacity of a millimeter-wave (mmWave) communication involving a mobile user (MU) and a cellular base station. The investigation is realized considering a threedimensional (3D) space in which the random waypoint mobility model is used to probabilistically identify the location of the MUs. Besides, the analysis is developed accounting for path-loss attenuation, directional antenna gains, shadowing, and modulation scheme. Closed-form formulas for the received signal power, the Shannon capacity, and the bit error rate (BER) are obtained for both line-of-sight (LoS) and non-LoS scenarios in the presence of a noise-limited operating regime. The conceived theoretical model is firstly checked by Monte Carlo validations, and then employed to explore the influence of the antenna gain and of the cell radius on the capacity and on the BER of a fifth-generation (5G) link in a 3D environment, taking into account both the 28 and 73 GHz mmWave bands.

show abstract

Section: Ber Resultsmentioning

confidence: 99%

Limiting Performance of Millimeter-Wave Communications in the Presence of a 3D Random Waypoint Mobility Model

Comisso

Vatta

Buttazzoni

et al. 2021

JCOMSS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Through this modified computation, a maximum coding gain improvement of 1 dB can be achieved when compared with SPA 44 . Furthermore, this algorithm is shown to minimize the decoding complexity by lowering computational overflow which occurs during the iterative message passing process.…”

Section: Sum‐product‐based Decoding Algorithms For Ldpc Codesmentioning

confidence: 99%

“…The main drawback of BPA‐based decoding schemes is the requirement of logarithmic and multiplicative computations while updating the check node computation. To overcome this drawback, Kschischang and his research team proposed a new variant of BPA, which is popularly known as the SPA 5,44 . In this novel approach, computational overhead is minimized by replacing complicated multiplications with less complex addition operations.…”

Section: Sum‐product‐based Decoding Algorithms For Ldpc Codesmentioning

confidence: 99%

Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications

Roberts¹,

Kumari

Anguraj³

2021

Int J Communication

View full text Add to dashboard Cite

Summary Information theory coding is an impressive and most celebrated field of research that has spawned numerous extremely important solutions to the intractable problems of secure data communications. Recent advancements in error control coding methods have seen a huge surge in using low‐density parity‐check (LDPC) code‐based decoding algorithms to solve imperative issues related to reliable data transmission and reception. Till date, extensive research efforts have been consistently being made on LDPC codes which focus on algorithm‐driven and hardware‐realization‐based approaches. The main intension of this research work is to provide an extensive systematic elucidation on the recent advancements in LDPC decoding algorithms. In addition, a thorough performance evaluation and analysis of several outstanding LDPC decoding techniques is presented. Finally, conclusions are drawn by summarizing the important research findings, interesting open problems, current challenges and broader perspectives for future directions of research.

show abstract

“…The received code words are y i = x i + n i , n i is independent and identically distributed Gaussian random variable and bilateral power spectral density is n 0 2 . Hence, y i is a Gauss variable with a mean value of 1 and variance of σ 2 [18].…”

Section: The Initializationmentioning

confidence: 99%

“…In the performance analysis of low-density parity check-bit interleaved coded modulation system in [17], the probability density function (PDF) of the log-likelihood ratio (LLR) messages transmitted between variables and check nodes is calculated using a Gaussian mixture approximation method for reducing the complexity of the density evolution process. Francesca analyzed the function φ(x) involved in Gaussian approximation on the basis in Reference [16] and obtained a new approximation function [18]. The threshold of the new approximation function is closer to that of density evolution compared with the approximation function in Reference [16].…”

mentioning

confidence: 92%

Analysis of TDMP Algorithm of LDPC Codes Based on Density Evolution and Gaussian Approximation

Wang

Chang

et al. 2019

Entropy

View full text Add to dashboard Cite

Based on density evolution analysis of the existing belief propagation (BP) algorithm, the Turbo Decoding Message Passing (TDMP) algorithm was analyzed from the perspective of density evolution and Gaussian approximation, and the theoretical analysis process of TDMP algorithm was given. When calculating the prior message of each layer of the TDMP algorithm, the check message of the previous iteration should be subtracted. Therefore, the result will not be convergent, if the TDMP algorithm is directly analyzed based on density evolution and Gaussian approximation. We researched the TDMP algorithm based on the symmetry conditions to obtain the convergent result. When using density evolution (DE) and Gaussian approximation to analyze the decoding convergence of the TDMP algorithm, we can provide a theoretical basis for proving the superiority of the algorithm. Then, based on the DE theory, we calculated the probability density function (PDF) of the check-to-variable information of TDMP and its simplified algorithm, and then gave it a calculation based on the process of the normalization factor. Simulation results show that the decoding convergence speed of the TDMP algorithm was faster and the iterations were smaller compared to the BP algorithm under the same conditions.

show abstract

More Accurate Analysis of Sum-Product Decoding of LDPC Codes Using a Gaussian Approximation

Cited by 19 publications

References 12 publications

Limiting Performance of Millimeter-Wave Communications in the Presence of a 3D Random Waypoint Mobility Model

Limiting Performance of Millimeter-Wave Communications in the Presence of a 3D Random Waypoint Mobility Model

Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications

Analysis of TDMP Algorithm of LDPC Codes Based on Density Evolution and Gaussian Approximation

Contact Info

Product

Resources

About