Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Synthèse d’architecture pour la réalisation comportementale de l’algorithme MAP pour Turbo Décodeur

High-level synthesis for behavioral design of the MAP algorithm for turbo decoder

  • Published:
Annales des Télécommunications Aims and scope Submit manuscript

Résumé

Les gains de productivité en conception de circuits ont considérablement crû ces 20 dernières années en franchissant différents niveaux d’abstraction : des polygones (dessin de masques) aux transistors, puis aux portes, et ensuite aux registres (niveau des transferts entre registres,rtl). Pour chaque niveau d’abstraction, le gain de productivité est d’un ordre de grandeur supérieur à celui du niveau précédent. La synthèse d’architecture permet de franchir un nouveau palier d’abstraction et d’améliorer la conception de systèmes de télécommunication. Les spécificités et possibilités des outils de synthèse d’architecture sont présentés et évalués sur un exemple d’algorithme non trivial : l’algorithme Aller-Retour ou du maximuma posteriori (Map) utilisé dans les turbo décodeurs. L’algorithmeMap a été dans un premier temps décomposé en niveaux hiérarchiques. Afin de maîtriser la complexité admissible par l’outil Monet, la synthèse d’architecture a été restreinte aux niveaux hiérarchiques intermédiaires. Les résultats des différentes synthèses réalisées sont présentés et analysés. Cette étude permet de déterminer les limites et imperfections des outils de synthèse d’architecture.

Abstract

The productivity in circuit design have significantly increased during past 20 years, thanks to spanning over several levels of abstraction: from polygons (masks description), to transistors, to logic gates and then tortl description. For each abstraction level, the productivity increases by one order of magnitude with respect to the previous level. High-level synthesis makes it possible to rise to a new level of abstraction and to improve the design of telecommunication systems. The capabilities of the high-level synthesis tools are presented and evaluated through an example of a non trivial algorithm: the Forward-Backward (Map) algorithm used in turbo decoders. First, theMap algorithm is divided into hierarchical levels. In order to control the allowed complexity for the high-level tool Monet, the high-level synthesis is carried out on intermediate levels. The results of the several synthesis experiments are presented and analyzed. This study enables us to determine the limits and imperfections of the currently available high-level synthesis tools.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliographie

  1. Semiconductor Industry Association, “The National Technology Roadmap For Semiconductors”, Édition 2001.

  2. Berrou (C.),Glavieux (A.),Thitimajshima (P.), Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes,Proc.icc’93, Geneva, Switzerland, May 23–26, 1993, pp. 1064–1070.

  3. Chang (R. W.),Hancock (J. C.) On Receiver Structures for Channels Having Memory,ieeeTransactions on Information Theory, IT-12, no 4, pp. 463–468, October 1966.

    Article  Google Scholar 

  4. Bahl (L. R.),Cocke (J.),Jelinek (F.),Raviv (J.), Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate,ieeeTransactions on Information Theory, pp.284–287, March 1974.

  5. Dingninou (A.),Rafaoui (F.),Berrou (C.), Organisation de la mémoire dans un turbo décodeur utilisant l’algorithmeSub-map,Proceedings ofgretsi, pages 71–74, Sept. 1999, France.

  6. Boutillon (E.),Demassieux (N.), A generalized precompiling scheme for surviving path memory management in Viterbi decoders,Iscas’93, New-Orleans, May 1993,3, pp. 1579–82.

    Google Scholar 

  7. Savaton (G.),Coussy (P.),Casseau (E.),Martin (E.), A Methodology for Behavioral Virtual Component Specification Targeting SoC Design with High-Level Synthesis Tools,Fdl2001, Forum on Design Languages, Lyon, France, Septembre 2001.

  8. Lester, Gaut. http://lester.univ-ubs.fr:8080/tools/tool.htm

Download references

Author information

Authors and Affiliations

  1. LESTER. Université de Bretagne Sud, BP 92116, 56321, Lorient Cedex, France

    David Gnaedig, Emmanuel Boutillon, Éric Martin & Amor Nafkha

  2. GET/ENST Bretagne, Technopôle Brest-Iroise, CS 83818, 29238, Brest Cedex 3, France

    David Gnaedig & Michel Jézéquel

  3. TurboConcept, Technopôle Brest-Iroise, 115 avenue Claude Chappe, 29280, Plouzané, France

    David Gnaedig, Jacky Tousch & Nathalie Brengarth

Authors
  1. David Gnaedig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel Boutillon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Éric Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amor Nafkha
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Michel Jézéquel
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jacky Tousch
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Nathalie Brengarth
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gnaedig, D., Boutillon, E., Martin, É. et al. Synthèse d’architecture pour la réalisation comportementale de l’algorithme MAP pour Turbo Décodeur. Ann. Télécommun. 59, 325–348 (2004). https://doi.org/10.1007/BF03179701

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03179701

Mots clés

Key words

Search

Navigation