An Efficient Construction of Regular Low-Density Parity-Check Codes for Encoding

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 775
  • Download : 0
In this paper, we propose an efficient constructions of regular LDPC codes having code rate 1/2 for encoding. The previous triangulation algorithm [4] has two disadvantages for applying ordinary regular LDPC codes. The proposed algorithm can eliminate the disadvantages of triangulation algorithm without performance degradation. We illustrate the advantages of the proposed constructions scheme and the analysis of performance of the codes constructed by proposed scheme.
Publisher
ETRI
Issue Date
2003-10-28
Language
ENG
Citation

International Conference on Cellular and Intelligent Communications

URI
http://hdl.handle.net/10203/151214
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0