Results 111 to 120 of about 18,008 (158)
Differentially Encoded LDPC Codes—Part II: General Case and Code Optimization
EURASIP Journal on Wireless Communications and Networking, 2008 This two-part series of papers studies the theory and practice of differentially encoded low-density parity-check (DE-LDPC) codes, especially in the context of noncoherent detection.
Li (Tiffany) Jing
doaj
Low-density parity-check codes based on sparse binary sequences
Tongxin xuebao, 2005 A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes.
HE Shan-bao +3 more
doaj
High performance full diversity LDPC codes construction and performance analysis for H-ARQ channels
Tongxin xuebao, 2012 In order to improve the performance of communication system with hybrid automatic repeat request(H-ARQ),a kind of full diversity low density parity check(LDPC)codes on H-ARQ block-fading channels was proposed.First,the outage probability and inherent ...
Rui GUO, Fang-ning HU, Ji-lin LIU
doaj
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Irregular LDPC codes as concatenation of regular LDPC codes
IEEE Communications Letters, 2005In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained ...
Marc P. C. Fossorier, Nenad Miladinovic
openaire +1 more source
7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire +1 more source
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire +1 more source
The rate of regular LDPC codes
IEEE International Symposium on Information Theory, 2003. Proceedings., 2003Summary: We find the rate of a typical code from the regular low-density parity-check (LDPC) ensemble. We then show that the rate of a code from the ensemble converges to the design rate in quadratic mean and almost surely.
G. Miller, Gérard D. Cohen
openaire +2 more sources
An Improvement on LDPC Coded Queued Codes
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008The queued-code based on low-density parity-check (LDPC) codes, which exploit both the near Shannon-limit performance LDPC codes and the instantaneous channel state information (CSI), can provide excellent performance in the block fading channels. The existing work utilized the conventional random puncturing and repetition operation, which may lead to ...
Ming Jiang 0012 +3 more
openaire +1 more source
Design of optimal LDPC code for the system of GMSK concatenated with LDPC codes
2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA), 2011This 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
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
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), 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