Results 191 to 200 of about 4,441 (227)
Continuous Transmission of Spatially Coupled LDPC Code Chains [PDF]
IEEE Transactions on Communications, 2017 We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially coupled low-density parity-check (SC-LDPC) codes.
Pablo M． Olmos +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the design of LDPC codes for MSK
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002We investigate serial concatenation of low-density parity check (LDPC) codes and minimum shift keying (MSK) with iterative decoding. We show that the design of LDPC codes is crucially dependent on the realization of the MSK modulator. For MSK modulators with nonrecursive continuous phase encoders (CPEs), optimal codes for BPSK are optimal, whereas for ...
Krishna R. Narayanan +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
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 +1 more source
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
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
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
A comparative study of BMST-LDPC codes and staircase-LDPC codes
Physical Communication, 2023Yinchu Wang, Xiao Ma
openaire +1 more source