... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA... more
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA (e-mail: {yifeiz, ryan}@ece.arizona.edu). ...
Research Interests:
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... more
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
Research Interests:
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
Research Interests:
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai,... more
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai, shulin@ece.ucdvis.edu
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
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... more
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.
Research Interests:
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block... more
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings
Research Interests:
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA... more
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA (e-mail: {yifeiz, ryan}@ece.arizona.edu). ...
Research Interests:
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... more
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
Research Interests:
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
Research Interests:
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai,... more
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai, shulin@ece.ucdvis.edu
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
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... more
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.
Research Interests:
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block... more
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings
Research Interests:
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA... more
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA (e-mail: {yifeiz, ryan}@ece.arizona.edu). ...
Research Interests:
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... more
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
Research Interests:
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
Research Interests:
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai,... more
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai, shulin@ece.ucdvis.edu
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
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... more
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.
Research Interests:
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block... more
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings
Research Interests:
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA... more
... Gianluigi Liva, Shumei Song, Lan Lan, Yifei Zhang, Shu Lin, and William E. Ryan AbstractThis survey paper provides fundamentals in the design of LDPC codes. ... Yifei Zhang and William E.Ryan are with the University of Arizona, USA (e-mail: {yifeiz, ryan}@ece.arizona.edu). ...
Research Interests:
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... more
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
Research Interests:
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
Research Interests:
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai,... more
Decoding and Construction of q-ary LDPC Codes ... Lingqi Zeng, Lan Lan, Ying Y. Tai and Shu Lin ... Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616 Email: lqzeng, squash, yytai, shulin@ece.ucdvis.edu
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
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... more
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.
Research Interests:
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block... more
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings
