Design of irregular LDPC codes with degree-set and degree-sum distributions
In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree di...
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 | 1930 |
|---|---|
| container_issue | |
| container_start_page | 1925 |
| container_title | |
| container_volume | |
| creator | Min Jang Jin Whan Kang Sang-Hyo Kim |
| description | In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution. |
| doi_str_mv | 10.1109/PIMRC.2012.6362668 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6362668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6362668</ieee_id><sourcerecordid>6362668</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-78ad29ea1204780ab78b6071f15ac2723a8fb8c0cc3ed1eb0002a380cd80b14b3</originalsourceid><addsrcrecordid>eNpVkM1KxDAUhSMqOIx9Ad3kBTrem7RJupSOjoMVB9H1kDS3NTI_krSIb--Ag-DZHL7Nx-EwdoUwQ4TqZrV8eqlnAlDMlFRCKXPCskobLJSWolSmOP3HCs7YRKBSeVVquGBZSh9wiBFYgJiwxzml0O_4vuMhRurHjY28ma9q3u49Jf4VhnfuqY9EeaKB253_w3HLfUhDDG4cwn6XLtl5ZzeJsmNP2dv93Wv9kDfPi2V92-QBdTnk2lgvKrIooNAGrNPGKdDYYWlboYW0pnOmhbaV5JHcYa2w0kDrDTgsnJyy619vIKL1ZwxbG7_XxzvkD37bUNs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Design of irregular LDPC codes with degree-set and degree-sum distributions</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Min Jang ; Jin Whan Kang ; Sang-Hyo Kim</creator><creatorcontrib>Min Jang ; Jin Whan Kang ; Sang-Hyo Kim</creatorcontrib><description>In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution.</description><identifier>ISSN: 2166-9570</identifier><identifier>ISBN: 9781467325660</identifier><identifier>ISBN: 146732566X</identifier><identifier>EISBN: 9781467325684</identifier><identifier>EISBN: 1467325694</identifier><identifier>EISBN: 9781467325691</identifier><identifier>EISBN: 1467325686</identifier><identifier>DOI: 10.1109/PIMRC.2012.6362668</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Bipartite graph ; Error analysis ; Iterative decoding ; Polynomials ; Sockets</subject><ispartof>2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC), 2012, p.1925-1930</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/6362668$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6362668$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Min Jang</creatorcontrib><creatorcontrib>Jin Whan Kang</creatorcontrib><creatorcontrib>Sang-Hyo Kim</creatorcontrib><title>Design of irregular LDPC codes with degree-set and degree-sum distributions</title><title>2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC)</title><addtitle>PIMRC</addtitle><description>In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution.</description><subject>Algorithm design and analysis</subject><subject>Bipartite graph</subject><subject>Error analysis</subject><subject>Iterative decoding</subject><subject>Polynomials</subject><subject>Sockets</subject><issn>2166-9570</issn><isbn>9781467325660</isbn><isbn>146732566X</isbn><isbn>9781467325684</isbn><isbn>1467325694</isbn><isbn>9781467325691</isbn><isbn>1467325686</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkM1KxDAUhSMqOIx9Ad3kBTrem7RJupSOjoMVB9H1kDS3NTI_krSIb--Ag-DZHL7Nx-EwdoUwQ4TqZrV8eqlnAlDMlFRCKXPCskobLJSWolSmOP3HCs7YRKBSeVVquGBZSh9wiBFYgJiwxzml0O_4vuMhRurHjY28ma9q3u49Jf4VhnfuqY9EeaKB253_w3HLfUhDDG4cwn6XLtl5ZzeJsmNP2dv93Wv9kDfPi2V92-QBdTnk2lgvKrIooNAGrNPGKdDYYWlboYW0pnOmhbaV5JHcYa2w0kDrDTgsnJyy619vIKL1ZwxbG7_XxzvkD37bUNs</recordid><startdate>201209</startdate><enddate>201209</enddate><creator>Min Jang</creator><creator>Jin Whan Kang</creator><creator>Sang-Hyo Kim</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201209</creationdate><title>Design of irregular LDPC codes with degree-set and degree-sum distributions</title><author>Min Jang ; Jin Whan Kang ; Sang-Hyo Kim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-78ad29ea1204780ab78b6071f15ac2723a8fb8c0cc3ed1eb0002a380cd80b14b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Bipartite graph</topic><topic>Error analysis</topic><topic>Iterative decoding</topic><topic>Polynomials</topic><topic>Sockets</topic><toplevel>online_resources</toplevel><creatorcontrib>Min Jang</creatorcontrib><creatorcontrib>Jin Whan Kang</creatorcontrib><creatorcontrib>Sang-Hyo Kim</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>Min Jang</au><au>Jin Whan Kang</au><au>Sang-Hyo Kim</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Design of irregular LDPC codes with degree-set and degree-sum distributions</atitle><btitle>2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC)</btitle><stitle>PIMRC</stitle><date>2012-09</date><risdate>2012</risdate><spage>1925</spage><epage>1930</epage><pages>1925-1930</pages><issn>2166-9570</issn><isbn>9781467325660</isbn><isbn>146732566X</isbn><eisbn>9781467325684</eisbn><eisbn>1467325694</eisbn><eisbn>9781467325691</eisbn><eisbn>1467325686</eisbn><abstract>In this paper, we introduce new attributes of low-density parity-check graphs, degree-set and degree-sum, which explains the connectivity of a check node with more detail. Then, we consider more specified ensembles defined by degree-set/sum distribution of the graph than one defined by the degree distribution. As the degree set/sum distribution varies, tradeoff between the performance at the waterfall and that at the error-floor is observed. The trade-off point can be managed by controlling degree-set/sum distribution.</abstract><pub>IEEE</pub><doi>10.1109/PIMRC.2012.6362668</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2166-9570 |
| ispartof | 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC), 2012, p.1925-1930 |
| issn | 2166-9570 |
| language | eng |
| recordid | cdi_ieee_primary_6362668 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Bipartite graph Error analysis Iterative decoding Polynomials Sockets |
| title | Design of irregular LDPC codes with degree-set and degree-sum distributions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T02%3A46%3A20IST&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=Design%20of%20irregular%20LDPC%20codes%20with%20degree-set%20and%20degree-sum%20distributions&rft.btitle=2012%20IEEE%2023rd%20International%20Symposium%20on%20Personal,%20Indoor%20and%20Mobile%20Radio%20Communications%20-%20(PIMRC)&rft.au=Min%20Jang&rft.date=2012-09&rft.spage=1925&rft.epage=1930&rft.pages=1925-1930&rft.issn=2166-9570&rft.isbn=9781467325660&rft.isbn_list=146732566X&rft_id=info:doi/10.1109/PIMRC.2012.6362668&rft_dat=%3Cieee_6IE%3E6362668%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467325684&rft.eisbn_list=1467325694&rft.eisbn_list=9781467325691&rft.eisbn_list=1467325686&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6362668&rfr_iscdi=true |