Mapping interleaving laws to parallel turbo and LDPC decoder architectures (Articolo in rivista)

Type
Label
  • Mapping interleaving laws to parallel turbo and LDPC decoder architectures (Articolo in rivista) (literal)
Anno
  • 2004-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/TIT.2004.833353 (literal)
Alternative label
  • Tarable, A; Benedetto, S; Montorsi, G (2004)
    Mapping interleaving laws to parallel turbo and LDPC decoder architectures
    in IEEE transactions on information theory
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Tarable, A; Benedetto, S; Montorsi, G (literal)
Pagina inizio
  • 2002 (literal)
Pagina fine
  • 2009 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 50 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 8 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 9 (literal)
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Polytechnic University of Turin (literal)
Titolo
  • Mapping interleaving laws to parallel turbo and LDPC decoder architectures (literal)
Abstract
  • For high-data-rate applications, the implementation of iterative turbo-like decoders requires the use of parallel architectures posing some collision-free constraints to the reading/writing process from/into the memory. This consideration applies to the two main classes of turbo-like codes, i.e., turbo codes and low-density parity-check (LDPC) codes. Contrary to the literature belief, we prove in this paper that there is no need for an ad hoc code design to meet the parallelism requirement, because, for any code and any choice of the scheduling of the reading/writing operations, there is a suitable mapping of the variables in the memory that grants a collision-free access. The proof is constructive, i.e., it gives an algorithm that obtains the desired collision-free mapping. The algorithm is applied to two simple examples, one for turbo codes and one for LDPC codes, to illustrate how the algorithm works. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it