Progressive edge growth LDPC Encoder with spiral search algorithm
نویسندگان
چکیده
منابع مشابه
Improved progressive edge-growth algorithm for fast encodable LDPC codes
The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....
متن کاملBlind Ldpc Encoder Identification
Nowadays, adaptive modulation and coding (AMC) techniques can facilitate flexible strategies subject to dynamic channel quality. The AMC transceivers select the most suitable coding and modulation mechanisms subject to the acquired channel information. Meanwhile, a control channel or a preamble is usually required to synchronously coordinate such changes between transmitters and receivers. On t...
متن کاملDesign of LDPC Codes using Multipath EMD Strategies and Progressive Edge Growth
Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length co...
متن کاملA search algorithm for linear codes: progressive dimension growth
This paper presents an algorithm, called progressive dimension growth (PDG), for the construction of linear codes with a pre-specified length and a minimum distance. A number of new linear codes over G F(5) that have been discovered via this algorithm are also presented.
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2017
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i1.3.10673