Results 191 to 200 of about 8,172 (227)

Design of optimal LDPC code for the system of GMSK concatenated with LDPC codes

2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA), 2011
This paper mainly concerns on the continuous phase modulation system of GMSK concatenated with LDPC codes. Decomposing GMSK signal into differential coding and PAM modulating manner, we analyze the iterative demodulating and decoding principle and design optimal LDPC codes based on EXIT chart.
Aimin Zhu, Xiaogang Huang, Senjie Yao
openaire   +1 more source

eIRA LDPC Codes on FPGA

IEEE Communications Letters, 2011
eIRA codes are iteratively decodable low-density parity-check (LDPC) codes. They not only offer superior performance to alternative approaches, but they allow linear-time encoding. Well-designed eIRA codes also achieve extremely low error-rate floors. In this letter, we successfully implement a common FPGA platform for eIRA codes.
John Ding, Michael Yang
openaire   +1 more source

On the design of LDPC codes for MSK

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
We 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, Ibrahim Altunbas, R. Sekhar Narayanaswami   +2 more
openaire   +1 more source

Sudoku puzzle as an LDPC code

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, Burak Onal, Ali Emre Pusane   +2 more
openaire   +1 more source

Improved reversible LDPC codes

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
We 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, 2011
In 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, 2006
This 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, Warren J. Gross, Shie Mannor   +2 more
openaire   +1 more source

Doubly Generalized LDPC Codes

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

Results on punctured LDPC codes

Manufacturing Engineer, 2005
In 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), 2020
In 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, Francis C. M. Lau 0002, Chiu-Wing Sham   +2 more
openaire   +2 more sources