Sargia
Newbie level 3
sum product algorithm ldpc
Some useful references on LDPC
[1] R. G. Gallager. Low-Density Parity-Check Codes. Cambridge, Massachusetts: M.I.T Press, 1963
[2] Mackay. Good Error-Correcting Codes Based on Very Sparse Matrices. IEEE Transaction on Information Theory, Vol. IT-45, March 1999: 399～431
[3] M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman. Analysis of Low-Density Parity-Check Codes and Improved Designs using Irregular Graphs. Proceedings of the 30th annual Symposium on Theory of Computing, 1998: 249～258
[4] T. J. Richardson, R. L. Urbande. The Capacity of Low-Density Parity-Check Codes Under Massage-Passing Decoding. IEEE Transaction on Information Theory, Vol. IT-47, February 2001: 599～618
[5] Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold, Ajay Dholakia. Efficient Implementations of the Sum-Product Algorithm for Decoding LDPC Codes. GLOBECOM 2001 IEEE Global Telecommunications Conference, No. 1 , Nov. 2001:1036～1041
[6] Marc P. C. Fossorier, Miodrag Mihaljevic, Hideki Imai. Reduced Complexity Iterative Decoding of Low-Density Parity-Check Codes Based on Belief Propagation. IEEE Transaction on Communications, Vol. 47, No. 5, May 1999:673～680
[7] Yongyi Mao, Amir H. Banihashemi. A New Schedule for Decoding Low-Density Parity-Check Codes. GLOBECOM 2001-IEEE Global Telecommunications Conference, No. 1, Nov. 2001:1007～1010
[8] Marc P. C. Fossorier. Iterative Reliability-Based Decoding of Low-Density Parity-Check Codes. IEEE Journal on Selected Areas in Communications, Vol. 19, No. 5, May 2001:908～917
[9] Jinghu Chen, Marc P. C. Fossorier. Decoding Low-Density Parity-Check Codes with Normalized APP-Based Algorithm. GLOBECOM 2001-IEEE Global Telecommunications Conference, No. 1 Nov. 2001:1026～1030
[10] Jinghu Chen, Marc P. C. Fossorier. Near Optimum Universal Belief Propagation Based Decoding of Low-Density Parity-Check Codes - Communications, IEEE Transactions on Communications, Vol. 50, No. 3, Mar. 2002:406～414
[11] Marc P. C., Shu Lin. Soft-Decision Decoding of Linear Block Codes Based on Ordered Statistics. IEEE Transactions on Information Theory, Vol. 41, NO. 5, Sep. 1995:1379～1396
[12] Sae-Yount Chung, G. David Forney Jr., Thomas J. Richardson, Rüdiger Urbanke. On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit - IEEE Communications Letters, Vol. 5, No. 2, Feb. 2001:58～60
[13] Thomas J. Richardson, Rüdiger L. Urbanke. The Capacity of Low-Density Parity-Check Codes Under Massage-Passing Decoding. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:599～618
[14] T. J. Richardson, M. A. Shokrollahi, R. L. Urbanke. Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:619～637
[15] T. J. Richardson, R. L. Urbanke. Efficient Encoding of Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:638～656
[16] S. Y. Chung, T. J. Richardson, R. L. Urbanke. Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:657～670
[17] R. M. Tanner. A Recursive Approach to Low Complexity Codes. IEEE Transactions on Information Theory, Vol. 27, N0.5, Sep. 1981:533～547
[18] Niclas Wiberg. Codes and Decoding. on General Graphs. Ph.D. thesis, Linköping University, S-581 83 Linköping, Sweden, Department of Electrical Engineering, 1996.
[19] R. Ahlswede, G. Dueck. Good Codes Can Be Produced by a Few Permutations. IEEE Transactions on Information Theory, Vol. 28, N0.3, May. 1982:430～443
[20] F. R. Kschischang, B. J. Frey, H. A. Loeliger. Factor Graphs and the Sum-Product Algorithm. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:498～519
[21] Jinghu Chen, Ajay Dholakia, Evangelos Eleftheriou, Marc P. C. Fossorier, Xiao-Yu Hu. Reduced-Complexity Decoding of LDPC Codes. IEEE Transactions on Communications, Vol. 53, No. 8, Aug. 2005:1288～1299
[22] T. Etzion, A. Trachtenberg, A. Vardy. Which Codes Have Cycle-Free Tanner Graphs. IEEE Transactions on Information Theory, Vol. 45, N0.6, Sep. 1999:2173～2181
Some useful references on LDPC
[1] R. G. Gallager. Low-Density Parity-Check Codes. Cambridge, Massachusetts: M.I.T Press, 1963
[2] Mackay. Good Error-Correcting Codes Based on Very Sparse Matrices. IEEE Transaction on Information Theory, Vol. IT-45, March 1999: 399～431
[3] M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman. Analysis of Low-Density Parity-Check Codes and Improved Designs using Irregular Graphs. Proceedings of the 30th annual Symposium on Theory of Computing, 1998: 249～258
[4] T. J. Richardson, R. L. Urbande. The Capacity of Low-Density Parity-Check Codes Under Massage-Passing Decoding. IEEE Transaction on Information Theory, Vol. IT-47, February 2001: 599～618
[5] Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold, Ajay Dholakia. Efficient Implementations of the Sum-Product Algorithm for Decoding LDPC Codes. GLOBECOM 2001 IEEE Global Telecommunications Conference, No. 1 , Nov. 2001:1036～1041
[6] Marc P. C. Fossorier, Miodrag Mihaljevic, Hideki Imai. Reduced Complexity Iterative Decoding of Low-Density Parity-Check Codes Based on Belief Propagation. IEEE Transaction on Communications, Vol. 47, No. 5, May 1999:673～680
[7] Yongyi Mao, Amir H. Banihashemi. A New Schedule for Decoding Low-Density Parity-Check Codes. GLOBECOM 2001-IEEE Global Telecommunications Conference, No. 1, Nov. 2001:1007～1010
[8] Marc P. C. Fossorier. Iterative Reliability-Based Decoding of Low-Density Parity-Check Codes. IEEE Journal on Selected Areas in Communications, Vol. 19, No. 5, May 2001:908～917
[9] Jinghu Chen, Marc P. C. Fossorier. Decoding Low-Density Parity-Check Codes with Normalized APP-Based Algorithm. GLOBECOM 2001-IEEE Global Telecommunications Conference, No. 1 Nov. 2001:1026～1030
[10] Jinghu Chen, Marc P. C. Fossorier. Near Optimum Universal Belief Propagation Based Decoding of Low-Density Parity-Check Codes - Communications, IEEE Transactions on Communications, Vol. 50, No. 3, Mar. 2002:406～414
[11] Marc P. C., Shu Lin. Soft-Decision Decoding of Linear Block Codes Based on Ordered Statistics. IEEE Transactions on Information Theory, Vol. 41, NO. 5, Sep. 1995:1379～1396
[12] Sae-Yount Chung, G. David Forney Jr., Thomas J. Richardson, Rüdiger Urbanke. On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit - IEEE Communications Letters, Vol. 5, No. 2, Feb. 2001:58～60
[13] Thomas J. Richardson, Rüdiger L. Urbanke. The Capacity of Low-Density Parity-Check Codes Under Massage-Passing Decoding. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:599～618
[14] T. J. Richardson, M. A. Shokrollahi, R. L. Urbanke. Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:619～637
[15] T. J. Richardson, R. L. Urbanke. Efficient Encoding of Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:638～656
[16] S. Y. Chung, T. J. Richardson, R. L. Urbanke. Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:657～670
[17] R. M. Tanner. A Recursive Approach to Low Complexity Codes. IEEE Transactions on Information Theory, Vol. 27, N0.5, Sep. 1981:533～547
[18] Niclas Wiberg. Codes and Decoding. on General Graphs. Ph.D. thesis, Linköping University, S-581 83 Linköping, Sweden, Department of Electrical Engineering, 1996.
[19] R. Ahlswede, G. Dueck. Good Codes Can Be Produced by a Few Permutations. IEEE Transactions on Information Theory, Vol. 28, N0.3, May. 1982:430～443
[20] F. R. Kschischang, B. J. Frey, H. A. Loeliger. Factor Graphs and the Sum-Product Algorithm. IEEE Transactions on Information Theory, Vol. 47, N0.2, Feb. 2001:498～519
[21] Jinghu Chen, Ajay Dholakia, Evangelos Eleftheriou, Marc P. C. Fossorier, Xiao-Yu Hu. Reduced-Complexity Decoding of LDPC Codes. IEEE Transactions on Communications, Vol. 53, No. 8, Aug. 2005:1288～1299
[22] T. Etzion, A. Trachtenberg, A. Vardy. Which Codes Have Cycle-Free Tanner Graphs. IEEE Transactions on Information Theory, Vol. 45, N0.6, Sep. 1999:2173～2181