The Experts below are selected from a list of 276 Experts worldwide ranked by ideXlab platform

Khaled Abdelghaffar - One of the best experts on this subject based on the ideXlab platform.

  • quasi cyclic ldpc codes an Algebraic Construction rank analysis and codes on latin squares
    IEEE Transactions on Communications, 2010
    Co-Authors: Li Zhang, Qin Huang, Shu Lin, Khaled Abdelghaffar, Ian F Blake
    Abstract:

    Quasi-cyclic LDPC codes are the most promising class of structured LDPC codes due to their ease of implementation and excellent performance over noisy channels when decoded with message-passing algorithms as extensive simulation studies have shown. In this paper, an approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields is presented. By analyzing the parity-check matrices of these codes, combinatorial expressions for their ranks and dimensions are derived. Experimental results show that, with iterative decoding algorithms, the constructed codes perform very well over the AWGN and the binary erasure channels.

  • Algebraic Construction of quasi cyclic ldpc codes for the awgn and erasure channels
    IEEE Transactions on Communications, 2006
    Co-Authors: Ying Yu Tai, Shu Lin, Lan Lan, Lingqi Zeng, Khaled Abdelghaffar
    Abstract:

    This paper is concerned with Construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes for three different types of channels: the additive white Gaussian noise, the binary random erasure, and the binary burst erasure channels. Two Algebraic methods for systematic Construction of QC-LDPC codes are presented. Codes constructed perform well over all three types of channels

  • Algebraic Construction of quasi cyclic ldpc codes part ii for awgn and binary random and burst erasure channels
    Lecture Notes in Computer Science, 2006
    Co-Authors: Ying Yu Tai, Shu Lin, Lan Lan, Lingqi Zeng, Shumei Song, Khaled Abdelghaffar
    Abstract:

    This paper is the second part of a sequence of two papers that present several Algebraic methods for constructing quasi-cyclic (QC) LDPC codes for AWGN, binary random and burst erasure channels. In the first paper, we presented a class of QC-LDPC codes for both the AWGN and binary random erasure channels. The Construction of this class of QC-LDPC codes is based on finite fields and location vector representations of finite field elements. In this paper, we presented two other Algebraic methods for constructing QC-LDPC codes for the AWGN, binary random and burst erasure channels.

  • on Algebraic Construction of gallager and circulant low density parity check codes
    IEEE Transactions on Information Theory, 2004
    Co-Authors: Heng Tang, Shu Lin, Yu Kou, Khaled Abdelghaffar
    Abstract:

    This correspondence presents three Algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are based on the structural properties of finite geometries. The first method gives a class of Gallager codes and a class of complementary Gallager codes. The second method results in two classes of circulant-LDPC codes, one in cyclic form and the other in quasi-cyclic form. The third method is a two-step hybrid method. Codes in these classes have a wide range of rates and minimum distances, and they perform well with iterative decoding.

Shu Lin - One of the best experts on this subject based on the ideXlab platform.

  • quasi cyclic ldpc codes an Algebraic Construction rank analysis and codes on latin squares
    IEEE Transactions on Communications, 2010
    Co-Authors: Li Zhang, Qin Huang, Shu Lin, Khaled Abdelghaffar, Ian F Blake
    Abstract:

    Quasi-cyclic LDPC codes are the most promising class of structured LDPC codes due to their ease of implementation and excellent performance over noisy channels when decoded with message-passing algorithms as extensive simulation studies have shown. In this paper, an approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields is presented. By analyzing the parity-check matrices of these codes, combinatorial expressions for their ranks and dimensions are derived. Experimental results show that, with iterative decoding algorithms, the constructed codes perform very well over the AWGN and the binary erasure channels.

  • quasi cyclic ldpc codes an Algebraic Construction
    IEEE Transactions on Communications, 2010
    Co-Authors: Jingyu Kang, Qin Huang, Li Zhang, Bo Zhou, Shu Lin
    Abstract:

    This paper presents two new large classes of QC-LDPC codes, one binary and one non-binary. Codes in these two classes are constructed by array dispersions of row-distance constrained matrices formed based on additive subgroups of finite fields. Experimental results show that codes constructed perform very well over the AWGN channel with iterative decoding based on belief propagation. Codes of a subclass of the class of binary codes have large minimum distances comparable to finite geometry LDPC codes and they offer effective tradeoff between error performance and decoding complexity when decoded with low-complexity reliability-based iterative decoding algorithms such as binary message passing decoding algorithms. Non-binary codes decoded with a Fast-Fourier Transform based sum-product algorithm achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with either the hard-decision Berlekamp-Massey algorithm or the Algebraic soft-decision Kotter-Vardy algorithm. They have potential to replace Reed-Solomon codes in some communication or storage systems where combinations of random and bursts of errors (or erasures) occur.

  • Algebraic Construction of quasi cyclic ldpc codes for the awgn and erasure channels
    IEEE Transactions on Communications, 2006
    Co-Authors: Ying Yu Tai, Shu Lin, Lan Lan, Lingqi Zeng, Khaled Abdelghaffar
    Abstract:

    This paper is concerned with Construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes for three different types of channels: the additive white Gaussian noise, the binary random erasure, and the binary burst erasure channels. Two Algebraic methods for systematic Construction of QC-LDPC codes are presented. Codes constructed perform well over all three types of channels

  • Algebraic Construction of quasi cyclic ldpc codes part ii for awgn and binary random and burst erasure channels
    Lecture Notes in Computer Science, 2006
    Co-Authors: Ying Yu Tai, Shu Lin, Lan Lan, Lingqi Zeng, Shumei Song, Khaled Abdelghaffar
    Abstract:

    This paper is the second part of a sequence of two papers that present several Algebraic methods for constructing quasi-cyclic (QC) LDPC codes for AWGN, binary random and burst erasure channels. In the first paper, we presented a class of QC-LDPC codes for both the AWGN and binary random erasure channels. The Construction of this class of QC-LDPC codes is based on finite fields and location vector representations of finite field elements. In this paper, we presented two other Algebraic methods for constructing QC-LDPC codes for the AWGN, binary random and burst erasure channels.

  • on Algebraic Construction of gallager and circulant low density parity check codes
    IEEE Transactions on Information Theory, 2004
    Co-Authors: Heng Tang, Shu Lin, Yu Kou, Khaled Abdelghaffar
    Abstract:

    This correspondence presents three Algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are based on the structural properties of finite geometries. The first method gives a class of Gallager codes and a class of complementary Gallager codes. The second method results in two classes of circulant-LDPC codes, one in cyclic form and the other in quasi-cyclic form. The third method is a two-step hybrid method. Codes in these classes have a wide range of rates and minimum distances, and they perform well with iterative decoding.

Ridha Bouallegue - One of the best experts on this subject based on the ideXlab platform.

  • the capacity performance of astc mimo ofdm system in a correlated rayleigh frequency selective channel
    Wireless Personal Communications, 2013
    Co-Authors: Ahmed Bannour, Mohamed Ammari, Yichuang Sun, Ridha Bouallegue
    Abstract:

    Algebraic Space-Time Codes (ASTC) for Multiple Input Multiple Output (MIMO) systems are based on quaternion algebras. Thanks to their Algebraic Construction, the ASTC codes are full-rank, full-rate and have the non-vanishing determinant property. These codes have been proposed for MIMO flat fading channels in order to increase the spectral efficiency and to maximize the coding gain. The purpose of this work is to analyze the performance of the ASTC in a frequency selective Rayleigh channel. To deal with the frequency selectivity, we use the OFDM modulation. The capacity performances of an ASTC-MIMO-OFDM system, under correlated Rayleigh frequency-selective channel, have been evaluated.

  • on the capacity of astc mimo ofdm system in a correlated rayleigh frequency selective channel
    Vehicular Technology Conference, 2011
    Co-Authors: Bannour Ahmed, Yichuang Sun, Mohamed Ammari, Ridha Bouallegue
    Abstract:

    Algebraic Space-Time Codes (ASTC) for MIMO systems are based on quaternion algebras. Thanks to their Algebraic Construction, the ASTC codes are full-rank, full-rate and have the non-vanishing determinant property. These codes have been proposed for MIMO flat fading channels in order to increase the spectral efficiency and to maximize the coding gain. The purpose of this work is to analyze the performance of the ASTC in a frequency selective Rayleigh channel. To deal with the frequency selectivity, we use the OFDM modulation. The capacity performances of an ASTC-MIMO-OFDM system, under correlated Rayleigh frequency-selective channel, have been evaluated. Index Terms-

  • adaptation of golden codes with a correlated rayleigh frequency selective channel in ofdm system with imperfect channel estimation
    International Symposium on Wireless Communication Systems, 2010
    Co-Authors: Ahmed Bannour, Mohamed Ammari, Ridha Bouallegue
    Abstract:

    The Golden Code (GC) is an Algebraic SpaceTime Code (ASTC) for MIMO systems, based on quaternion algebras. Thanks to the Algebraic Construction, the Golden codes are full-rank, full-rate and have the non-vanishing determinant property. These codes have been proposed for MIMO flat fading channels in order to increase the spectral efficiency and to maximize the coding gain. The purpose of this work is to analyze the performance of the GC in a frequency selective Rayleigh channel. To deal with the frequency selectivity, we use the OFDM modulation. The BER performance of an ASTC-MIMO-OFDM system, under several propagation conditions, have been evaluated.

Li Zhang - One of the best experts on this subject based on the ideXlab platform.

  • quasi cyclic ldpc codes an Algebraic Construction rank analysis and codes on latin squares
    IEEE Transactions on Communications, 2010
    Co-Authors: Li Zhang, Qin Huang, Shu Lin, Khaled Abdelghaffar, Ian F Blake
    Abstract:

    Quasi-cyclic LDPC codes are the most promising class of structured LDPC codes due to their ease of implementation and excellent performance over noisy channels when decoded with message-passing algorithms as extensive simulation studies have shown. In this paper, an approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields is presented. By analyzing the parity-check matrices of these codes, combinatorial expressions for their ranks and dimensions are derived. Experimental results show that, with iterative decoding algorithms, the constructed codes perform very well over the AWGN and the binary erasure channels.

  • quasi cyclic ldpc codes an Algebraic Construction
    IEEE Transactions on Communications, 2010
    Co-Authors: Jingyu Kang, Qin Huang, Li Zhang, Bo Zhou, Shu Lin
    Abstract:

    This paper presents two new large classes of QC-LDPC codes, one binary and one non-binary. Codes in these two classes are constructed by array dispersions of row-distance constrained matrices formed based on additive subgroups of finite fields. Experimental results show that codes constructed perform very well over the AWGN channel with iterative decoding based on belief propagation. Codes of a subclass of the class of binary codes have large minimum distances comparable to finite geometry LDPC codes and they offer effective tradeoff between error performance and decoding complexity when decoded with low-complexity reliability-based iterative decoding algorithms such as binary message passing decoding algorithms. Non-binary codes decoded with a Fast-Fourier Transform based sum-product algorithm achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with either the hard-decision Berlekamp-Massey algorithm or the Algebraic soft-decision Kotter-Vardy algorithm. They have potential to replace Reed-Solomon codes in some communication or storage systems where combinations of random and bursts of errors (or erasures) occur.

Ian F Blake - One of the best experts on this subject based on the ideXlab platform.

  • quasi cyclic ldpc codes an Algebraic Construction rank analysis and codes on latin squares
    IEEE Transactions on Communications, 2010
    Co-Authors: Li Zhang, Qin Huang, Shu Lin, Khaled Abdelghaffar, Ian F Blake
    Abstract:

    Quasi-cyclic LDPC codes are the most promising class of structured LDPC codes due to their ease of implementation and excellent performance over noisy channels when decoded with message-passing algorithms as extensive simulation studies have shown. In this paper, an approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields is presented. By analyzing the parity-check matrices of these codes, combinatorial expressions for their ranks and dimensions are derived. Experimental results show that, with iterative decoding algorithms, the constructed codes perform very well over the AWGN and the binary erasure channels.