EEPIS Repository

Perbandingan Kinerja LDPC (Low Density Parity Check) Dengan Metode Decoding Log Domain Sum Product Pada Kanal AWGN Dan Multipath Fading

HAMKA, HAMKA and Moegiharto, Yoedy (2011) Perbandingan Kinerja LDPC (Low Density Parity Check) Dengan Metode Decoding Log Domain Sum Product Pada Kanal AWGN Dan Multipath Fading. EEPIS Final Project.

[img]
Preview
PDF - Published Version
Download (230Kb) | Preview

    Abstract

    As an effect of the globalization era, telecomunication technology, especially in wireless comunication system is forced to prepare high data rate with reliable Quality of Services (QOS) with Low Bit Error Rate (BER) and very small power. The problem in mobile comunication is AWGN and multipath fading, which affected the rising of error data receive on receiver side. This final project simulates the coding tehnique�s Low Density Parity Check Code (LDPC) on AWGN and multipath fading. Encoding on transmitter with sparse matrx method based on Approximation Lower Triangular in rate ½.While decoding apply with decoding sum product log domain. The simulation result is analyzed With a different matrix size, the result of LDPC isn�t to variably in LDPC performance. At different iteration, more iteration influence LDPC with the result that good. BER acquired 10-3 in AWGN channel acquired at average values Eb/No = 2,06 dB. Whereas in multipath fading EbNo = 6.05 dB. Keywords : Low Density Parity Check Code, sparse matriks based on Approximation Lower Triangular, AWGN, Multipath Fading , decoding sum product log domain, BER

    Item Type: Article
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Q Science > QA Mathematics > QA76 Computer software
    Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
    Depositing User: Mrs fariny masna
    Date Deposited: 15 Apr 2011 21:33
    Last Modified: 15 Apr 2011 21:33
    URI: http://repo.pens.ac.id/id/eprint/573

    Actions (login required)

    View Item