Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes
Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to mod...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 674 |
---|---|
container_issue | |
container_start_page | 669 |
container_title | |
container_volume | |
creator | Farazi, M. M. R. Islam, M. R. Mahmood, K. S. Oshim, M. F. T. |
description | Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC) in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or Belief Propagation (BP) algorithm while adding a minimum amount of complexity. |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6174757</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6174757</ieee_id><sourcerecordid>6174757</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-520f3444b8bd3e0aeb1fe848367f2fcc064714bd30cd020510283dd73ed77f263</originalsourceid><addsrcrecordid>eNotjMtOwzAQRY0Aibb0C9j4ByKNM35licKrUhBIdMWmSuwxGFobxUGof08RXZ3FueeesLltlBKN0ChP2VxIbRCEAnPGZsKgrRop1QVblvIBAAcFUOOMva7SRKnEac9HCltyU8yJu0whRBcpTXzoC3n-GFP18r3jnlz2Mb3xkEfe5R9-c6yf-_EP7Tu5T95mT-WSnYd-W2h55IKt727X7UPVPd2v2uuuig1MlaohoJRysINHgp4GEchKi9qEOjgHWhohDw6chxqUgNqi9wbJm8NC44Jd_d9GItp8jXHXj_uNFkYaZfAX--VO8Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Farazi, M. M. R. ; Islam, M. R. ; Mahmood, K. S. ; Oshim, M. F. T.</creator><creatorcontrib>Farazi, M. M. R. ; Islam, M. R. ; Mahmood, K. S. ; Oshim, M. F. T.</creatorcontrib><description>Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC) in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or Belief Propagation (BP) algorithm while adding a minimum amount of complexity.</description><identifier>ISSN: 1738-9445</identifier><identifier>ISBN: 1467301507</identifier><identifier>ISBN: 9781467301503</identifier><identifier>EISBN: 8955191634</identifier><identifier>EISBN: 9788955191622</identifier><identifier>EISBN: 9788955191639</identifier><identifier>EISBN: 8955191626</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Belief Propagation algorithm ; Bit error rate ; bit error rate (BER) ; Complexity theory ; computational complexity ; Decoding ; IRC ; Iterative decoding ; Low-Density Parity-Check codes ; Min-Sum algorithm ; Reflection</subject><ispartof>2012 14th International Conference on Advanced Communication Technology (ICACT), 2012, p.669-674</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6174757$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6174757$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Farazi, M. M. R.</creatorcontrib><creatorcontrib>Islam, M. R.</creatorcontrib><creatorcontrib>Mahmood, K. S.</creatorcontrib><creatorcontrib>Oshim, M. F. T.</creatorcontrib><title>Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes</title><title>2012 14th International Conference on Advanced Communication Technology (ICACT)</title><addtitle>ICACT</addtitle><description>Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC) in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or Belief Propagation (BP) algorithm while adding a minimum amount of complexity.</description><subject>Algorithm design and analysis</subject><subject>Belief Propagation algorithm</subject><subject>Bit error rate</subject><subject>bit error rate (BER)</subject><subject>Complexity theory</subject><subject>computational complexity</subject><subject>Decoding</subject><subject>IRC</subject><subject>Iterative decoding</subject><subject>Low-Density Parity-Check codes</subject><subject>Min-Sum algorithm</subject><subject>Reflection</subject><issn>1738-9445</issn><isbn>1467301507</isbn><isbn>9781467301503</isbn><isbn>8955191634</isbn><isbn>9788955191622</isbn><isbn>9788955191639</isbn><isbn>8955191626</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjMtOwzAQRY0Aibb0C9j4ByKNM35licKrUhBIdMWmSuwxGFobxUGof08RXZ3FueeesLltlBKN0ChP2VxIbRCEAnPGZsKgrRop1QVblvIBAAcFUOOMva7SRKnEac9HCltyU8yJu0whRBcpTXzoC3n-GFP18r3jnlz2Mb3xkEfe5R9-c6yf-_EP7Tu5T95mT-WSnYd-W2h55IKt727X7UPVPd2v2uuuig1MlaohoJRysINHgp4GEchKi9qEOjgHWhohDw6chxqUgNqi9wbJm8NC44Jd_d9GItp8jXHXj_uNFkYaZfAX--VO8Q</recordid><startdate>201202</startdate><enddate>201202</enddate><creator>Farazi, M. M. R.</creator><creator>Islam, M. R.</creator><creator>Mahmood, K. S.</creator><creator>Oshim, M. F. T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201202</creationdate><title>Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes</title><author>Farazi, M. M. R. ; Islam, M. R. ; Mahmood, K. S. ; Oshim, M. F. T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-520f3444b8bd3e0aeb1fe848367f2fcc064714bd30cd020510283dd73ed77f263</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Belief Propagation algorithm</topic><topic>Bit error rate</topic><topic>bit error rate (BER)</topic><topic>Complexity theory</topic><topic>computational complexity</topic><topic>Decoding</topic><topic>IRC</topic><topic>Iterative decoding</topic><topic>Low-Density Parity-Check codes</topic><topic>Min-Sum algorithm</topic><topic>Reflection</topic><toplevel>online_resources</toplevel><creatorcontrib>Farazi, M. M. R.</creatorcontrib><creatorcontrib>Islam, M. R.</creatorcontrib><creatorcontrib>Mahmood, K. S.</creatorcontrib><creatorcontrib>Oshim, M. F. T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Farazi, M. M. R.</au><au>Islam, M. R.</au><au>Mahmood, K. S.</au><au>Oshim, M. F. T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes</atitle><btitle>2012 14th International Conference on Advanced Communication Technology (ICACT)</btitle><stitle>ICACT</stitle><date>2012-02</date><risdate>2012</risdate><spage>669</spage><epage>674</epage><pages>669-674</pages><issn>1738-9445</issn><isbn>1467301507</isbn><isbn>9781467301503</isbn><eisbn>8955191634</eisbn><eisbn>9788955191622</eisbn><eisbn>9788955191639</eisbn><eisbn>8955191626</eisbn><abstract>Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon's limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC) in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or Belief Propagation (BP) algorithm while adding a minimum amount of complexity.</abstract><pub>IEEE</pub><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1738-9445 |
ispartof | 2012 14th International Conference on Advanced Communication Technology (ICACT), 2012, p.669-674 |
issn | 1738-9445 |
language | eng |
recordid | cdi_ieee_primary_6174757 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis Belief Propagation algorithm Bit error rate bit error rate (BER) Complexity theory computational complexity Decoding IRC Iterative decoding Low-Density Parity-Check codes Min-Sum algorithm Reflection |
title | Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T14%3A19%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Intensity%20reflection%20coefficient%20based%20Min-Sum%20decoding%20for%20Low%20Density%20Parity%20Check%20Codes&rft.btitle=2012%2014th%20International%20Conference%20on%20Advanced%20Communication%20Technology%20(ICACT)&rft.au=Farazi,%20M.%20M.%20R.&rft.date=2012-02&rft.spage=669&rft.epage=674&rft.pages=669-674&rft.issn=1738-9445&rft.isbn=1467301507&rft.isbn_list=9781467301503&rft_id=info:doi/&rft_dat=%3Cieee_6IE%3E6174757%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=8955191634&rft.eisbn_list=9788955191622&rft.eisbn_list=9788955191639&rft.eisbn_list=8955191626&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6174757&rfr_iscdi=true |