An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel

Manabu Kobayashi, Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, we investigate the design of low-density parity-check (LDPC) codes for the Gilbert-Elliott (GE) channel. Recently, Eckford et al. proposed a design method of irregular LDPC codes using approximate density-evolution (DE) for Markov channels [7]. In the design method proposed by Eckford et al., the probability density function (PDF) of the messages from variable nodes to check nodes is approximated by the Gaussian distribution. In this paper, we first show the method to obtain the accurate PDF of the messages from variable nodes to check nodes by utilizing two DE steps for the Gaussian distribution. We call this method the iterative density approximation (IDA). Using this method, we can design the good LDPC codes. Next, we propose an efficient design method of irregular LDPC codes by using Beta approximation to the PDF of the channel state probability for the GE channel. Consequently, we show that the complexity to calculate PDFs of the channel messages is considerably reduced though the rates of LDPC codes obtained by using the proposed approximation are almost the same as that of the IDA method.

    Original languageEnglish
    Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
    DOIs
    Publication statusPublished - 2008
    Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland
    Duration: 2008 Dec 72008 Dec 10

    Other

    Other2008 International Symposium on Information Theory and its Applications, ISITA2008
    CityAuckland
    Period08/12/708/12/10

    Fingerprint

    Probability density function
    Gaussian distribution

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Kobayashi, M., Yagi, H., Matsushima, T., & Hirasawa, S. (2008). An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel. In 2008 International Symposium on Information Theory and its Applications, ISITA2008 [4895649] https://doi.org/10.1109/ISITA.2008.4895649

    An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel. / Kobayashi, Manabu; Yagi, Hideki; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895649.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kobayashi, M, Yagi, H, Matsushima, T & Hirasawa, S 2008, An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel. in 2008 International Symposium on Information Theory and its Applications, ISITA2008., 4895649, 2008 International Symposium on Information Theory and its Applications, ISITA2008, Auckland, 08/12/7. https://doi.org/10.1109/ISITA.2008.4895649
    Kobayashi M, Yagi H, Matsushima T, Hirasawa S. An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel. In 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895649 https://doi.org/10.1109/ISITA.2008.4895649
    Kobayashi, Manabu ; Yagi, Hideki ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel. 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008.
    @inproceedings{d47e187c1277466783acb1b6a63e3266,
    title = "An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel",
    abstract = "In this paper, we investigate the design of low-density parity-check (LDPC) codes for the Gilbert-Elliott (GE) channel. Recently, Eckford et al. proposed a design method of irregular LDPC codes using approximate density-evolution (DE) for Markov channels [7]. In the design method proposed by Eckford et al., the probability density function (PDF) of the messages from variable nodes to check nodes is approximated by the Gaussian distribution. In this paper, we first show the method to obtain the accurate PDF of the messages from variable nodes to check nodes by utilizing two DE steps for the Gaussian distribution. We call this method the iterative density approximation (IDA). Using this method, we can design the good LDPC codes. Next, we propose an efficient design method of irregular LDPC codes by using Beta approximation to the PDF of the channel state probability for the GE channel. Consequently, we show that the complexity to calculate PDFs of the channel messages is considerably reduced though the rates of LDPC codes obtained by using the proposed approximation are almost the same as that of the IDA method.",
    author = "Manabu Kobayashi and Hideki Yagi and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "2008",
    doi = "10.1109/ISITA.2008.4895649",
    language = "English",
    isbn = "9781424420698",
    booktitle = "2008 International Symposium on Information Theory and its Applications, ISITA2008",

    }

    TY - GEN

    T1 - An efficient design of irregular LDPC codes using beta approximation for the Gilbert-Elliott channel

    AU - Kobayashi, Manabu

    AU - Yagi, Hideki

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 2008

    Y1 - 2008

    N2 - In this paper, we investigate the design of low-density parity-check (LDPC) codes for the Gilbert-Elliott (GE) channel. Recently, Eckford et al. proposed a design method of irregular LDPC codes using approximate density-evolution (DE) for Markov channels [7]. In the design method proposed by Eckford et al., the probability density function (PDF) of the messages from variable nodes to check nodes is approximated by the Gaussian distribution. In this paper, we first show the method to obtain the accurate PDF of the messages from variable nodes to check nodes by utilizing two DE steps for the Gaussian distribution. We call this method the iterative density approximation (IDA). Using this method, we can design the good LDPC codes. Next, we propose an efficient design method of irregular LDPC codes by using Beta approximation to the PDF of the channel state probability for the GE channel. Consequently, we show that the complexity to calculate PDFs of the channel messages is considerably reduced though the rates of LDPC codes obtained by using the proposed approximation are almost the same as that of the IDA method.

    AB - In this paper, we investigate the design of low-density parity-check (LDPC) codes for the Gilbert-Elliott (GE) channel. Recently, Eckford et al. proposed a design method of irregular LDPC codes using approximate density-evolution (DE) for Markov channels [7]. In the design method proposed by Eckford et al., the probability density function (PDF) of the messages from variable nodes to check nodes is approximated by the Gaussian distribution. In this paper, we first show the method to obtain the accurate PDF of the messages from variable nodes to check nodes by utilizing two DE steps for the Gaussian distribution. We call this method the iterative density approximation (IDA). Using this method, we can design the good LDPC codes. Next, we propose an efficient design method of irregular LDPC codes by using Beta approximation to the PDF of the channel state probability for the GE channel. Consequently, we show that the complexity to calculate PDFs of the channel messages is considerably reduced though the rates of LDPC codes obtained by using the proposed approximation are almost the same as that of the IDA method.

    UR - http://www.scopus.com/inward/record.url?scp=77951101790&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77951101790&partnerID=8YFLogxK

    U2 - 10.1109/ISITA.2008.4895649

    DO - 10.1109/ISITA.2008.4895649

    M3 - Conference contribution

    AN - SCOPUS:77951101790

    SN - 9781424420698

    BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008

    ER -