Results 121 to 130 of about 18,008 (158)
Some of the next articles are maybe not open access.
Improved reversible LDPC codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005We provide a thorough analysis for a class of iteratively encodable low-density parity-check codes. The iterative encoding technique is based upon the graphical representation of the code and allows the decoder circuit to also be used for encoding, thus saving circuit area.
David Haley, Alex J. Grant
openaire +2 more sources
Decoding techniques of LDPC codes
Proceedings of the International Conference & Workshop on Emerging Trends in Technology - ICWET '11, 2011In this paper, we will Discuss Decoding technique of Low Density Parity check (LDPC) codes. Using Results we can evaluate which decoding procedure is better.
D. S. Marotkar, N. A. Bodhaye
openaire +1 more source
Stochastic decoding of LDPC codes
IEEE Communications Letters, 2006This letter presents the first successful method for iterative stochastic decoding of state-of-the-art low-density parity-check (LDPC) codes. The proposed method shows the viability of the stochastic approach for decoding LDPC codes on factor graphs.
Saeed Sharifi Tehrani +2 more
openaire +1 more source
2013 21st Signal Processing and Communications Applications Conference (SIU), 2013
Sudoku is a very popular number placement puzzle. Usually defined on a matrix of size 9 × 9, the puzzle involves the solver to determine the missing elements of the matrix using certain rules. There is a very strong connection between solving Sudoku puzzles and determining the erased symbols of a codeword that was transmitted over an erasure channel ...
M. Sevi Baltaoglu +2 more
openaire +1 more source
Sudoku is a very popular number placement puzzle. Usually defined on a matrix of size 9 × 9, the puzzle involves the solver to determine the missing elements of the matrix using certain rules. There is a very strong connection between solving Sudoku puzzles and determining the erased symbols of a codeword that was transmitted over an erasure channel ...
M. Sevi Baltaoglu +2 more
openaire +1 more source
Results on punctured LDPC codes
Manufacturing Engineer, 2005In this paper we study some fundamental properties of punctured LDPC codes. We first prove that for any ensemble of LDPC codes, there exists a puncturing threshold p*. We then find lower bounds on the achievable rates of punctured codes over general MBIOS channels. These bounds are satisfied by using only one encoder and decoder for all rates.
Hossein Pishro-Nik, Faramarz Fekri
openaire +1 more source
Protograph-based LDPC-Hadamard Codes
2020 IEEE Wireless Communications and Networking Conference (WCNC), 2020In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the generalized protograph.
Peng-Wei Zhang 0001 +2 more
openaire +2 more sources
2006 IEEE International Symposium on Information Theory, 2006
The design of generalized low-density parity-check (GLDPC) codes at both check and bit nodes over AWGN channel is considered in this paper. The new codes are referred to as doubly generalized LDPC codes. EXIT charts are used to optimize the parameters of these codes.
Yige Wang, Marc P. C. Fossorier
openaire +1 more source
The design of generalized low-density parity-check (GLDPC) codes at both check and bit nodes over AWGN channel is considered in this paper. The new codes are referred to as doubly generalized LDPC codes. EXIT charts are used to optimize the parameters of these codes.
Yige Wang, Marc P. C. Fossorier
openaire +1 more source
A comparative study of BMST-LDPC codes and staircase-LDPC codes
Physical Communication, 2023Yinchu Wang, Xiao Ma
openaire +1 more source
On products of graphs for LDPC codes
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004The notion of product block codes, whose generator matrix is the tensor product of the constituent generator matrices, is well established. Typically, they have good performance and a decoding algorithm with complexity on the order of the complexity of the decoding algorithms of the constituent codes.
Jun Xu 0004, Shu Lin 0001, Ian F. Blake
openaire +1 more source
On universal LDPC code ensembles
2010 IEEE International Symposium on Information Theory, 2010A universal design of low-density parity-check (LDPC) code ensembles which enables to operate reliably over various channels is of great theoretical and practical interest. This paper considers the universality of LDPC code ensembles over multitude memoryless binary-input output-symmetric (MBIOS) channels, addressing their universality under belief ...
Igal Sason, Boaz Shuval
openaire +1 more source