A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
[article]
2007
arXiv
pre-print
Preserved Fulltext
Other Versions
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. ...
Furthermore, the paper shows that informed scheduling solves some standard trapping set errors. Therefore, it also outperforms traditional scheduling for a large numbers of iterations. ...
This scheduling is known as Layered Belief Propagation (LBP) and guarantees a parallelism degree equal to the sub-matrix size of the LDPC code (54 in our case). ...
arXiv:cs/0702111v2
fatcat:qtkqfaxlrfhntbz7cgmoa3lv3q
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
2007
2007 IEEE International Conference on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. ...
Furthermore, the paper shows that informed scheduling solves some standard trapping set errors. Therefore, it also outperforms traditional scheduling for a large numbers of iterations. ...
This scheduling is known as Layered Belief Propagation (LBP) and guarantees a parallelism degree equal to the sub-matrix size of the LDPC code (54 in our case). ...
doi:10.1109/icc.2007.158
dblp:conf/icc/CasadoGW07
fatcat:6q7x7lsn7fc3vb4be6irwnln4q
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. ...
The simulation results validate the advantages of the proposed schemes. INDEX TERMS LDPC codes, belief-propagation decoding, informed dynamic scheduling, residualdecaying, greediness. ...
BP AND RBP DECODING OF LDPC CODES
A. ...
doi:10.1109/access.2019.2899106
fatcat:czk5qew67vg4hncsvpgdijyxfi
Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes
2009
IEEE Communications Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Two of the practical sequential decoding schemes known are the ones by Casado et al. [1] in which informed dynamic scheduling is used for scheduling the sequential updates of the messages. ...
Recent studies have shown that sequential belief propagation decoding of low-density parity-check codes can increase the decoding convergence speed while simultaneously improving the asymptotic performance ...
INFORMED DYNAMIC SCHEDULING Consider the bipartite graph of an LDPC code with the set of variable nodes V and the set of check nodes C. ...
doi:10.1109/lcomm.2009.081938
fatcat:yua6ijvpsvcvzaysefvp65qa7y
Variable-to-check residual belief propagation for LDPC codes
2009
Electronics Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
It is similar to residual belief propagation (RBP) that was recently applied to LDPC decoding by Vila Casado et al. because it is also a dynamic scheduling belief propagation using residuals, but it is ...
Variable-to-check residual belief propagation for LDPC decoding for faster convergence, better error performance and lower complexity is proposed. ...
Residual belief propagation for LDPC codes: Original BP decoding for LDPC codes is achieved by exchange of messages between variable nodes and check nodes. ...
doi:10.1049/el:20092505
fatcat:6xiy6ax2kjhhbbcqltckunsfd4
Adaptive Mixed Scheduling for Correcting Errors in Trapping Sets of LDPC Codes
2010
IEEE Communications Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Adoption of mixed scheduling for belief propagation decoding has shown to be very effective in solving some of the trapping sets. ...
Trapping sets of low-density parity-check codes are the problematic substructures that contribute to the error floor behavior under iterative decoding. ...
Fig. 2 . 2 WER performance of belief propagation decoding algorithms for = 500, = 1 2 PEG algorithm-generated LDPC code at 3.0dB. ...
doi:10.1109/lcomm.2010.07.092417
fatcat:oab4enh6yfeqnasjzbnjtjabzm
A low-power 1-Gbps reconfigurable LDPC decoder design for multiple 4G wireless standards
2008
2008 IEEE International SOC Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We utilize a pipelined version of the layered belief propagation algorithm to achieve partial-parallel decoding of structured LDPC codes. ...
In this paper we present an efficient system-onchip implementation of a 1-Gbps LDPC decoder for 4G (or beyond 3G) wireless standards. ...
In
1-th Layer
4-th Layer z 2z 3z 4z 5z 6z 7z 8z z 2z 3z 4z x I x 0 2-th Layer order to efficiently decode structured LDPC codes, we adopt the layered belief propagation (LBP) algorithm [6] , which ...
doi:10.1109/socc.2008.4641546
dblp:conf/socc/SunC08
fatcat:uhbkjhnv5na3vmxaxhks2s4niu
Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes
2013
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP) over the corresponding Tanner graph. ...
Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes. ...
The work of this paper is sponsored by the State 863 Project (2008AA01Z227), the National Natural Science Foundation of China (NSFC), under Grant 61271204. ...
doi:10.1155/2013/371206
fatcat:kdffofmv5zaojgxkywhyypuy5e
Improving LDPC Decoders via Informed Dynamic Scheduling
2007
2007 IEEE Information Theory Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation (BP), or message-passing, algorithm over the factor graph of the code. ...
The message-passing schedule of the BP algorithm significantly affects the performance of the LDPC decoder. ...
Introduction LDPC codes are usually decoded using a messagepassing algorithm, called Belief Propagation (BP), over a factor-graph representation of the code, as shown in [1] and [2] . ...
doi:10.1109/itw.2007.4313075
fatcat:l3gotj25rvdwvjycvwsfomcvei
Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
2015
IEEE Communications Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this letter, we propose a novel shuffled BP decoding schedule, specifically for irregular LDPC codes, based on the column weight of variable nodes. ...
In addition to rate-1{2 LDPC codes optimized for AWGN channel [11] , we also plot the normalized decoding iterations for rate-1{2 LDPC codes optimized for Rayleigh fading channel [14] . ...
doi:10.1109/lcomm.2015.2444381
fatcat:44a7y73m6nggznmi2ch32i4bha
LDPC Decoders with Informed Dynamic Scheduling
2010
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation (BP), or message-passing, algorithm over the factor graph of the code. ...
We propose Informed Dynamic Scheduling (IDS) strategies that select the message-passing schedule according to the observed rate of change of the messages. ...
To our knowledge, these and the simultaneous work in [14] are the first works on the subject of dynamic scheduling for LDPC decoding. ...
doi:10.1109/tcomm.2010.101910.070303
fatcat:rmwbldq4rfa6hn34yxqfbmmu6u
Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling
2022
Modelling and Simulation in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The informed dynamic scheduling (IDS) strategies for the low-density parity check (LDPC) decoding have shown superior performance in error correction and convergence speed, particularly those based on ...
reliability measures and residual belief propagation (RBP). ...
Acknowledgments This research was supported through computational resources of HPC-MARWAN (http://www.marwan.ma/ hpc) provided by National Center for Scientific and Technical Research (CNRST), Rabat, Morocco ...
doi:10.1155/2022/1407788
fatcat:7sbmmtndwrftpcbkqn2bk3xnn4
Iterative Detection and Decoding Algorithms for MIMO Systems in Block-Fading Channels Using LDPC Codes
2016
IEEE Transactions on Vehicular Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Moreover, we present a scheduling algorithm for decoding LDPC codes in block-fading channels. ...
We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading ...
A family of LDPC codes called Root-Check codes were proposed in [4] and can achieve the maximum diversity of a block-fading channel when decoded with the Belief Propagation (BP) algorithm. ...
doi:10.1109/tvt.2015.2432099
fatcat:6gp7y5t7frb3xeoozoc474vwsq
Design and Evaluation of the Efficiency of Channel Coding LDPC Codes for 5G Information Technology
2021
Indonesian Journal of Electrical Engineering and Informatics (IJEEI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This solution eventually allowed to develop a strategy for decoder designing of such codes and to optimize the code structure for a specific information network. ...
This paper proposes a result of an investigation of a topical problem and the development of models for efficient coding in information networks based on codes with a low density of parity check. ...
SCC noise immunity schedules based on LDPC codes and various decoding algorithms: 1 is Belief Propagation; 2 is Layered Belief Propagation; 3 is Normalized Min-Sum; 4 is Offset Min-Sum The Normalized Min-Sum ...
doi:10.52549/ijeei.v9i4.3188
fatcat:3kxl7ekbnvab7duy5qunfqci2y
Parallel vs. sequential belief propagation decoding of LDPC codes over and Markov sources
2007
Physica A: Statistical Mechanics and its Applications
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2006 pre-print arXiv:cs/0605069v1 fatcat:m5e5aedmwnabbprzfotqpzoona
A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, GF(q), and correlated Markov sources is proposed, and compared with the standard parallel updating ...
These results may imply on the 'universality' of the one half convergence speed-up of SUS decoding. ...
Acknowledgment The research of I.K. is supported in part by the Israel Science Foundation. ...
doi:10.1016/j.physa.2006.12.009
fatcat:ffezdpaujbfwtjgk6eev5sagqq
« Previous
Showing results 1 — 15 out of 384 results