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!
Description
Summary: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.
ISSN:2162-3562
2162-3570
DOI:10.1109/SIPS.2009.5336255