A NEW METHOD FOR SHORT BLOCK LENGTH LDPC CODE DESIGN

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

TAKI MEHRDAD; NEZAFATI MOHAMMAD BAGHER

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, A- MUHANDISI -I BARQ Year:2008 | Volume:5 | Issue:4 Page(s): 249-254

Download Full-Text

Persian Verion

View:

927

Download:

Cites:

Information Journal Paper

Title

A NEW METHOD FOR SHORT BLOCK LENGTH LDPC CODE DESIGN

Author(s)

TAKI MEHRDAD | NEZAFATI MOHAMMAD BAGHER | Issue Writer Certificate

Keywords

SEMI-RANDOM PARITY CHECK MATRIXQ4

EXTENDED BIT FILLINGQ4

FINITE LENGTH IRREGULAR LDPC CODESQ4

Abstract

In this paper, we propose a new method for short block length Low Density Parity Check (LDPC) code design. The experimental results show that codes designed using the proposed algorithm have better performance compare to the other short block length LDPC codes. For LDPC code design in short block length, two problems arise: first analytical estimation of code performance using density evolution method is unusable because of infinity of code length in this method. Second because of high code density, the probability of short loop in code graph (Girth) is high that dramatically reduces the code performance. We propose solution for both problems. First, code structure is designed in such a way that the code performance is near to that of the density evolution method estimates and second by improving EXTENDED BIT FILLING algorithm, short block length is controlled.

Cites

No record.

References

No record.

Cite

APA: Copy

TAKI, MEHRDAD, & NEZAFATI, MOHAMMAD BAGHER. (2008). A NEW METHOD FOR SHORT BLOCK LENGTH LDPC CODE DESIGN. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), 5(4), 249-254. SID. https://sid.ir/paper/53765/en

Vancouver: Copy

TAKI MEHRDAD, NEZAFATI MOHAMMAD BAGHER. A NEW METHOD FOR SHORT BLOCK LENGTH LDPC CODE DESIGN. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN)[Internet]. 2008;5(4):249-254. Available from: https://sid.ir/paper/53765/en

IEEE: Copy

MEHRDAD TAKI, and MOHAMMAD BAGHER NEZAFATI, “A NEW METHOD FOR SHORT BLOCK LENGTH LDPC CODE DESIGN,” NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), vol. 5, no. 4, pp. 249–254, 2008, [Online]. Available: https://sid.ir/paper/53765/en

Related Journal Papers