High-performance binary and non-binary Low-density parity-check codes based on affine permutation matrices

2015 ◽  
Vol 9 (17) ◽  
pp. 2114-2123 ◽  
Author(s):  
Mohammad Gholami ◽  
Masoumeh Alinia
Keyword(s):  
High Performance ◽  
Low Density ◽  
Parity Check ◽  
Permutation Matrices ◽  
Low Density Parity Check ◽  
Parity Check Codes

Performance of IEEE 802.11n LDPC codes

2017 ◽  
Vol 11 (22) ◽  
pp. 1065-1073
Author(s):  
Yenny Alexandra Avendano Martinez ◽  
Octavio Jose Salcedo Parra ◽  
Giovanny Mauricio Tarazona Bermudez
Keyword(s):  
Error Detection ◽  
High Performance ◽  
Ldpc Codes ◽  
Low Density ◽  
Parity Check ◽  
Ieee 802.11N ◽  
Noise Environment ◽  
Low Density Parity Check ◽  
Parity Check Codes

LDPC (Low Density Parity Check Codes) is a set of algorithms that send, receive and correct in a noise environment, frames transmitted in a LAN environment. This article demonstrates the high performance of the LDPC in environments of noise, compared to the CRC error detection code highly currently implemented, in this way the efficiency of LDPC is shown specifically over the 802. 11n protocol.

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

2005 ◽  
Vol 41 (1) ◽  
pp. 33-44 ◽  
Author(s):  
A. Sridharan ◽  
M. Lentmaier ◽  
D. V. Truhachev ◽  
D. J. Costello ◽  
K. Sh. Zigangirov
Keyword(s):  
Minimum Distance ◽  
Low Density ◽  
Parity Check ◽  
Permutation Matrices ◽  
Low Density Parity Check ◽  
Parity Check Codes

scholarly journals Low Density Parity Check Codes Constructed from Hankel Matrices

2018 ◽  
Vol 3 ◽  
pp. 37-41
Author(s):  
Mohammed Amine Tehami ◽  
Ali Djebbari
Keyword(s):  
Channel Coding ◽  
Additive White Gaussian Noise ◽  
Hankel Matrix ◽  
Low Density ◽  
Parity Check ◽  
Hankel Matrices ◽  
Permutation Matrices ◽  
Low Density Parity Check ◽  
The Matrix ◽  
Parity Check Codes

In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4. To ensure that parity check bits can be recursively calculated with linear computational complexity, a dual-diagonal structure is applied to the parity check matrices of those codes. The proposed codes provide a very low encoding complexity and reduce the stored memory of the matrix H in which this matrix can be easily implemented comparing to others codes used in channel coding. The new LDPC codes are compared, by simulation, with uncoded bi-phase shift keying (BPSK). The result shows that the proposed codes perform very well over additive white Gaussian noise (AWGN) channels.

Sign in / Sign up

Export Citation Format

Share Document