Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi
Soft decoding of block codes can be done by representing the block code into the trellis. One method of soft decoding commonly used is the maximum a posteriori probability (MAP). However, the implementation of this method requires a high computational complexity. Reducing the complexity can be done...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Gadjah Mada
2017-02-01
|
| Series: | Jurnal Nasional Teknik Elektro dan Teknologi Informasi |
| Subjects: | |
| Online Access: | http://ejnteti.jteti.ugm.ac.id/index.php/JNTETI/article/view/295 |
| _version_ | 1818445994173399040 |
|---|---|
| author | Emir Husni Dimas Pamungkas |
| author_facet | Emir Husni Dimas Pamungkas |
| author_sort | Emir Husni |
| collection | DOAJ |
| description | Soft decoding of block codes can be done by representing the block code into the trellis. One method of soft decoding commonly used is the maximum a posteriori probability (MAP). However, the implementation of this method requires a high computational complexity. Reducing the complexity can be done by changing the trellis shape of the block code. This paper shows the process of the block code’s trellis formation and the evaluation of computational complexity and bit error ratio for every trellis shape of block codes. The evaluation of codes using the MAP method is compared to the evaluation of the soft output Viterbi algorithm (SOVA) method. The result shows that soft decoding using MAP method is better than soft coding using SOVA method and hard decoding method. |
| first_indexed | 2024-12-14T19:40:40Z |
| format | Article |
| id | doaj.art-9cddf4f8f0c649c2802fd5e461abcd10 |
| institution | Directory Open Access Journal |
| issn | 2301-4156 2460-5719 |
| language | English |
| last_indexed | 2024-12-14T19:40:40Z |
| publishDate | 2017-02-01 |
| publisher | Universitas Gadjah Mada |
| record_format | Article |
| series | Jurnal Nasional Teknik Elektro dan Teknologi Informasi |
| spelling | doaj.art-9cddf4f8f0c649c2802fd5e461abcd102022-12-21T22:49:43ZengUniversitas Gadjah MadaJurnal Nasional Teknik Elektro dan Teknologi Informasi2301-41562460-57192017-02-0161586510.22146/jnteti.v6i1.295Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis TerbagiEmir Husni0Dimas Pamungkas1Institut Teknologi BandungInstitut Teknologi BandungSoft decoding of block codes can be done by representing the block code into the trellis. One method of soft decoding commonly used is the maximum a posteriori probability (MAP). However, the implementation of this method requires a high computational complexity. Reducing the complexity can be done by changing the trellis shape of the block code. This paper shows the process of the block code’s trellis formation and the evaluation of computational complexity and bit error ratio for every trellis shape of block codes. The evaluation of codes using the MAP method is compared to the evaluation of the soft output Viterbi algorithm (SOVA) method. The result shows that soft decoding using MAP method is better than soft coding using SOVA method and hard decoding method.http://ejnteti.jteti.ugm.ac.id/index.php/JNTETI/article/view/295pendekodean secara haluspendekodean mappembagian trelliskode blok |
| spellingShingle | Emir Husni Dimas Pamungkas Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi Jurnal Nasional Teknik Elektro dan Teknologi Informasi pendekodean secara halus pendekodean map pembagian trellis kode blok |
| title | Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi |
| title_full | Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi |
| title_fullStr | Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi |
| title_full_unstemmed | Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi |
| title_short | Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi |
| title_sort | evaluasi kompleksitas pendekodean map pada kode bch berdasarkan trellis terbagi |
| topic | pendekodean secara halus pendekodean map pembagian trellis kode blok |
| url | http://ejnteti.jteti.ugm.ac.id/index.php/JNTETI/article/view/295 |
| work_keys_str_mv | AT emirhusni evaluasikompleksitaspendekodeanmappadakodebchberdasarkantrellisterbagi AT dimaspamungkas evaluasikompleksitaspendekodeanmappadakodebchberdasarkantrellisterbagi |