Optimization of LDPC Codes for Receiver Frontends

The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is compu...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Lechner, G., Sayir, J., Land, I.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Communications technology Curve fitting Demodulation Design optimization Detectors Equalizers Iterative decoding Parity check codes Robustness Transfer functions
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	2392
container_issue
container_start_page	2388
container_title
container_volume
creator	Lechner, G. Sayir, J. Land, I.
description	The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is computed, based on the code's own EXIT chart, under the Gaussian assumption. While the optimization of the variable node distribution is a nonlinear problem, the optimization of the check node distribution is shown to be a linear problem. This fact is exploited to design codes where both the variable and the check node distributions are optimized, resulting in more robust constructions. The technique presented requires only knowledge of the measured EXIT function of the receiver frontend
doi_str_mv	10.1109/ISIT.2006.262016
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4036398</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4036398</ieee_id><sourcerecordid>4036398</sourcerecordid><originalsourceid>FETCH-LOGICAL-i283t-cfa3f2f80948925aa877902e8b9d9fd9101228bb28def19c38308974a4d824703</originalsourceid><addsrcrecordid>eNpFjc1KxDAURuMfOI6zF9zkBVrvvUmaZCl1RguFER3B3ZA2CUScdmiLoE_vgIpn8y0OfIexK4QcEexN9VxtcgIocioIsDhiFyhJSlAg8ZjNCJXODKI--Rfq9fRPgFXnbDGOb3BAKkm2mDFc76e0S19uSn3H-8jru8eSl70PI4_9wJ9CG9JHGPhq6LspdH68ZGfRvY9h8btz9rJabsqHrF7fV-VtnSUyYsra6ESkeKhKY0k5Z7S2QME01tvoLQISmaYh40NE2wojwFgtnfSGpAYxZ9c_vymEsN0PaeeGz60EUQhrxDdpmUZi</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimization of LDPC Codes for Receiver Frontends</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lechner, G. ; Sayir, J. ; Land, I.</creator><creatorcontrib>Lechner, G. ; Sayir, J. ; Land, I.</creatorcontrib><description>The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is computed, based on the code's own EXIT chart, under the Gaussian assumption. While the optimization of the variable node distribution is a nonlinear problem, the optimization of the check node distribution is shown to be a linear problem. This fact is exploited to design codes where both the variable and the check node distributions are optimized, resulting in more robust constructions. The technique presented requires only knowledge of the measured EXIT function of the receiver frontend</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 142440505X</identifier><identifier>ISBN: 9781424405053</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 1424405041</identifier><identifier>EISBN: 9781424405046</identifier><identifier>DOI: 10.1109/ISIT.2006.262016</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communications technology ; Curve fitting ; Demodulation ; Design optimization ; Detectors ; Equalizers ; Iterative decoding ; Parity check codes ; Robustness ; Transfer functions</subject><ispartof>2006 IEEE International Symposium on Information Theory, 2006, p.2388-2392</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4036398$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4036398$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lechner, G.</creatorcontrib><creatorcontrib>Sayir, J.</creatorcontrib><creatorcontrib>Land, I.</creatorcontrib><title>Optimization of LDPC Codes for Receiver Frontends</title><title>2006 IEEE International Symposium on Information Theory</title><addtitle>ISIT</addtitle><description>The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is computed, based on the code's own EXIT chart, under the Gaussian assumption. While the optimization of the variable node distribution is a nonlinear problem, the optimization of the check node distribution is shown to be a linear problem. This fact is exploited to design codes where both the variable and the check node distributions are optimized, resulting in more robust constructions. The technique presented requires only knowledge of the measured EXIT function of the receiver frontend</description><subject>Communications technology</subject><subject>Curve fitting</subject><subject>Demodulation</subject><subject>Design optimization</subject><subject>Detectors</subject><subject>Equalizers</subject><subject>Iterative decoding</subject><subject>Parity check codes</subject><subject>Robustness</subject><subject>Transfer functions</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>142440505X</isbn><isbn>9781424405053</isbn><isbn>1424405041</isbn><isbn>9781424405046</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFjc1KxDAURuMfOI6zF9zkBVrvvUmaZCl1RguFER3B3ZA2CUScdmiLoE_vgIpn8y0OfIexK4QcEexN9VxtcgIocioIsDhiFyhJSlAg8ZjNCJXODKI--Rfq9fRPgFXnbDGOb3BAKkm2mDFc76e0S19uSn3H-8jru8eSl70PI4_9wJ9CG9JHGPhq6LspdH68ZGfRvY9h8btz9rJabsqHrF7fV-VtnSUyYsra6ESkeKhKY0k5Z7S2QME01tvoLQISmaYh40NE2wojwFgtnfSGpAYxZ9c_vymEsN0PaeeGz60EUQhrxDdpmUZi</recordid><startdate>200607</startdate><enddate>200607</enddate><creator>Lechner, G.</creator><creator>Sayir, J.</creator><creator>Land, I.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200607</creationdate><title>Optimization of LDPC Codes for Receiver Frontends</title><author>Lechner, G. ; Sayir, J. ; Land, I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i283t-cfa3f2f80948925aa877902e8b9d9fd9101228bb28def19c38308974a4d824703</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Communications technology</topic><topic>Curve fitting</topic><topic>Demodulation</topic><topic>Design optimization</topic><topic>Detectors</topic><topic>Equalizers</topic><topic>Iterative decoding</topic><topic>Parity check codes</topic><topic>Robustness</topic><topic>Transfer functions</topic><toplevel>online_resources</toplevel><creatorcontrib>Lechner, G.</creatorcontrib><creatorcontrib>Sayir, J.</creatorcontrib><creatorcontrib>Land, I.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lechner, G.</au><au>Sayir, J.</au><au>Land, I.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimization of LDPC Codes for Receiver Frontends</atitle><btitle>2006 IEEE International Symposium on Information Theory</btitle><stitle>ISIT</stitle><date>2006-07</date><risdate>2006</risdate><spage>2388</spage><epage>2392</epage><pages>2388-2392</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>142440505X</isbn><isbn>9781424405053</isbn><eisbn>1424405041</eisbn><eisbn>9781424405046</eisbn><abstract>The degree distribution of low-density parity-check (LDPC) codes is optimized for systems that iterate over the receiver frontend, e.g., soft detector, demodulator, equalizer, etc., and the LDPC decoder. The overall extrinsic information transfer (EXIT) function of an iterative LDPC decoder is computed, based on the code's own EXIT chart, under the Gaussian assumption. While the optimization of the variable node distribution is a nonlinear problem, the optimization of the check node distribution is shown to be a linear problem. This fact is exploited to design codes where both the variable and the check node distributions are optimized, resulting in more robust constructions. The technique presented requires only knowledge of the measured EXIT function of the receiver frontend</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2006.262016</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2157-8095
ispartof	2006 IEEE International Symposium on Information Theory, 2006, p.2388-2392
issn	2157-8095 2157-8117
language	eng
recordid	cdi_ieee_primary_4036398
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Communications technology Curve fitting Demodulation Design optimization Detectors Equalizers Iterative decoding Parity check codes Robustness Transfer functions
title	Optimization of LDPC Codes for Receiver Frontends
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T02%3A27%3A53IST&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=Optimization%20of%20LDPC%20Codes%20for%20Receiver%20Frontends&rft.btitle=2006%20IEEE%20International%20Symposium%20on%20Information%20Theory&rft.au=Lechner,%20G.&rft.date=2006-07&rft.spage=2388&rft.epage=2392&rft.pages=2388-2392&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=142440505X&rft.isbn_list=9781424405053&rft_id=info:doi/10.1109/ISIT.2006.262016&rft_dat=%3Cieee_6IE%3E4036398%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424405041&rft.eisbn_list=9781424405046&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4036398&rfr_iscdi=true