Conflict resolution for pipelined layered LDPC decoders

Many of the current LDPC implementations of DVB-S2, T2 or WiMAX standard use the so-called layered architecture combined with pipeline. However, the pipeline process may introduce memory access conflicts. The resolution of these conflicts requires careful scheduling combined with dedicated hardware...

Full description

Saved in:
Bibliographic Details
Main Authors: Marchand, C., Dore, J.-B., Conde-Canencia, L., Boutillon, E.
Format: Conference Proceeding
Language:English
Subjects:
Digital video broadcasting
genetic algorithm
Genetic algorithms
Iterative decoding
layered decoding
Low-density parity-check code (LDPC)
memory conflicts
Parity check codes
Pipeline processing
Scheduling
Throughput
Traveling salesman problems
WiMAX
Wireless LAN
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 225
container_issue
container_start_page 220
container_title
container_volume
creator Marchand, C.
Dore, J.-B.
Conde-Canencia, L.
Boutillon, E.
description Many of the current LDPC implementations of DVB-S2, T2 or WiMAX standard use the so-called layered architecture combined with pipeline. However, the pipeline process may introduce memory access conflicts. The resolution of these conflicts requires careful scheduling combined with dedicated hardware and/or idle cycle insertion. In this paper, based on the DVB-T2 example, we explain explicitly how the scheduling can solve most of the pipeline conflicts. The two contributions of the paper are 1) how to split the matrix to relax the pipeline conflicts at a cost of a reduced maximum available parallelism 2) how to project the problem of the research of an efficient scheduling to the well-known ldquoTravelling Salesman Problemrdquo and use a genetic algorithm to solve it.
doi_str_mv 10.1109/SIPS.2009.5336255
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_5336255</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5336255</ieee_id><sourcerecordid>5336255</sourcerecordid><originalsourceid>FETCH-LOGICAL-i284t-8558ec07ecbd64992a0083bfe6814e171c5a101856cc1f57b0fa6e95d623fb793</originalsourceid><addsrcrecordid>eNo9j8tKw0AUQEdRsK1-gLjJDyTeedx5LCW-CgEL1XWZTO7ASEzCJC769woWV-esDhzGbjlUnIO73293-0oAuAql1ALxjK25EkopKRHO2UpwLUqJBi7-XYsrtp7nTwCtUOgVM_U4xD6Fpcg0j_33ksahiGMupjRRnwbqit4fKf-yedzVRUdh7CjP1-wy-n6mmxM37OP56b1-LZu3l2390JRJWLWUFtFSAEOh7bRyTngAK9tI2nJF3PCAngO3qEPgEU0L0Wty2GkhY2uc3LC7v24iosOU05fPx8NpWP4AHtRHEQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Conflict resolution for pipelined layered LDPC decoders</title><source>IEEE Xplore All Conference Series</source><creator>Marchand, C. ; Dore, J.-B. ; Conde-Canencia, L. ; Boutillon, E.</creator><creatorcontrib>Marchand, C. ; Dore, J.-B. ; Conde-Canencia, L. ; Boutillon, E.</creatorcontrib><description>Many of the current LDPC implementations of DVB-S2, T2 or WiMAX standard use the so-called layered architecture combined with pipeline. However, the pipeline process may introduce memory access conflicts. The resolution of these conflicts requires careful scheduling combined with dedicated hardware and/or idle cycle insertion. In this paper, based on the DVB-T2 example, we explain explicitly how the scheduling can solve most of the pipeline conflicts. The two contributions of the paper are 1) how to split the matrix to relax the pipeline conflicts at a cost of a reduced maximum available parallelism 2) how to project the problem of the research of an efficient scheduling to the well-known ldquoTravelling Salesman Problemrdquo and use a genetic algorithm to solve it.</description><identifier>ISSN: 2162-3562</identifier><identifier>EISSN: 2162-3570</identifier><identifier>EISBN: 1424443350</identifier><identifier>EISBN: 9781424443352</identifier><identifier>DOI: 10.1109/SIPS.2009.5336255</identifier><language>eng</language><publisher>IEEE</publisher><subject>Digital video broadcasting ; genetic algorithm ; Genetic algorithms ; Iterative decoding ; layered decoding ; Low-density parity-check code (LDPC) ; memory conflicts ; Parity check codes ; Pipeline processing ; Scheduling ; Throughput ; Traveling salesman problems ; WiMAX ; Wireless LAN</subject><ispartof>2009 IEEE Workshop on Signal Processing Systems, 2009, p.220-225</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/5336255$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,23912,23913,25122,27907,54537,54914</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5336255$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Marchand, C.</creatorcontrib><creatorcontrib>Dore, J.-B.</creatorcontrib><creatorcontrib>Conde-Canencia, L.</creatorcontrib><creatorcontrib>Boutillon, E.</creatorcontrib><title>Conflict resolution for pipelined layered LDPC decoders</title><title>2009 IEEE Workshop on Signal Processing Systems</title><addtitle>SIPS</addtitle><description>Many of the current LDPC implementations of DVB-S2, T2 or WiMAX standard use the so-called layered architecture combined with pipeline. However, the pipeline process may introduce memory access conflicts. The resolution of these conflicts requires careful scheduling combined with dedicated hardware and/or idle cycle insertion. In this paper, based on the DVB-T2 example, we explain explicitly how the scheduling can solve most of the pipeline conflicts. The two contributions of the paper are 1) how to split the matrix to relax the pipeline conflicts at a cost of a reduced maximum available parallelism 2) how to project the problem of the research of an efficient scheduling to the well-known ldquoTravelling Salesman Problemrdquo and use a genetic algorithm to solve it.</description><subject>Digital video broadcasting</subject><subject>genetic algorithm</subject><subject>Genetic algorithms</subject><subject>Iterative decoding</subject><subject>layered decoding</subject><subject>Low-density parity-check code (LDPC)</subject><subject>memory conflicts</subject><subject>Parity check codes</subject><subject>Pipeline processing</subject><subject>Scheduling</subject><subject>Throughput</subject><subject>Traveling salesman problems</subject><subject>WiMAX</subject><subject>Wireless LAN</subject><issn>2162-3562</issn><issn>2162-3570</issn><isbn>1424443350</isbn><isbn>9781424443352</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo9j8tKw0AUQEdRsK1-gLjJDyTeedx5LCW-CgEL1XWZTO7ASEzCJC769woWV-esDhzGbjlUnIO73293-0oAuAql1ALxjK25EkopKRHO2UpwLUqJBi7-XYsrtp7nTwCtUOgVM_U4xD6Fpcg0j_33ksahiGMupjRRnwbqit4fKf-yedzVRUdh7CjP1-wy-n6mmxM37OP56b1-LZu3l2390JRJWLWUFtFSAEOh7bRyTngAK9tI2nJF3PCAngO3qEPgEU0L0Wty2GkhY2uc3LC7v24iosOU05fPx8NpWP4AHtRHEQ</recordid><startdate>200910</startdate><enddate>200910</enddate><creator>Marchand, C.</creator><creator>Dore, J.-B.</creator><creator>Conde-Canencia, L.</creator><creator>Boutillon, E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200910</creationdate><title>Conflict resolution for pipelined layered LDPC decoders</title><author>Marchand, C. ; Dore, J.-B. ; Conde-Canencia, L. ; Boutillon, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i284t-8558ec07ecbd64992a0083bfe6814e171c5a101856cc1f57b0fa6e95d623fb793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Digital video broadcasting</topic><topic>genetic algorithm</topic><topic>Genetic algorithms</topic><topic>Iterative decoding</topic><topic>layered decoding</topic><topic>Low-density parity-check code (LDPC)</topic><topic>memory conflicts</topic><topic>Parity check codes</topic><topic>Pipeline processing</topic><topic>Scheduling</topic><topic>Throughput</topic><topic>Traveling salesman problems</topic><topic>WiMAX</topic><topic>Wireless LAN</topic><toplevel>online_resources</toplevel><creatorcontrib>Marchand, C.</creatorcontrib><creatorcontrib>Dore, J.-B.</creatorcontrib><creatorcontrib>Conde-Canencia, L.</creatorcontrib><creatorcontrib>Boutillon, E.</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>Marchand, C.</au><au>Dore, J.-B.</au><au>Conde-Canencia, L.</au><au>Boutillon, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Conflict resolution for pipelined layered LDPC decoders</atitle><btitle>2009 IEEE Workshop on Signal Processing Systems</btitle><stitle>SIPS</stitle><date>2009-10</date><risdate>2009</risdate><spage>220</spage><epage>225</epage><pages>220-225</pages><issn>2162-3562</issn><eissn>2162-3570</eissn><eisbn>1424443350</eisbn><eisbn>9781424443352</eisbn><abstract>Many of the current LDPC implementations of DVB-S2, T2 or WiMAX standard use the so-called layered architecture combined with pipeline. However, the pipeline process may introduce memory access conflicts. The resolution of these conflicts requires careful scheduling combined with dedicated hardware and/or idle cycle insertion. In this paper, based on the DVB-T2 example, we explain explicitly how the scheduling can solve most of the pipeline conflicts. The two contributions of the paper are 1) how to split the matrix to relax the pipeline conflicts at a cost of a reduced maximum available parallelism 2) how to project the problem of the research of an efficient scheduling to the well-known ldquoTravelling Salesman Problemrdquo and use a genetic algorithm to solve it.</abstract><pub>IEEE</pub><doi>10.1109/SIPS.2009.5336255</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2162-3562
ispartof 2009 IEEE Workshop on Signal Processing Systems, 2009, p.220-225
issn 2162-3562
2162-3570
language eng
recordid cdi_ieee_primary_5336255
source IEEE Xplore All Conference Series
subjects Digital video broadcasting
genetic algorithm
Genetic algorithms
Iterative decoding
layered decoding
Low-density parity-check code (LDPC)
memory conflicts
Parity check codes
Pipeline processing
Scheduling
Throughput
Traveling salesman problems
WiMAX
Wireless LAN
title Conflict resolution for pipelined layered LDPC decoders
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T09%3A29%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Conflict%20resolution%20for%20pipelined%20layered%20LDPC%20decoders&rft.btitle=2009%20IEEE%20Workshop%20on%20Signal%20Processing%20Systems&rft.au=Marchand,%20C.&rft.date=2009-10&rft.spage=220&rft.epage=225&rft.pages=220-225&rft.issn=2162-3562&rft.eissn=2162-3570&rft_id=info:doi/10.1109/SIPS.2009.5336255&rft.eisbn=1424443350&rft.eisbn_list=9781424443352&rft_dat=%3Cieee_CHZPO%3E5336255%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i284t-8558ec07ecbd64992a0083bfe6814e171c5a101856cc1f57b0fa6e95d623fb793%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5336255&rfr_iscdi=true