Behavioural synthesis utilising recursive definitions

A. D. Brown, D. J. D. Milton, A. J. Rushton, P. R. Wilson

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Behavioural synthesis is the process of automatically translating an abstract specification to physical realisation - silicon. The endpoints of this process are accelerating apart (behavioural descriptions become more abstract, DSM silicon becomes less willing to behave as Boolean circuits) but there is still work outstanding in the middle ground. Recursion allows the elegant expression of complicated systems, and is supported by many languages (software and hardware). The electronic design automation (EDA) tool designers- task is to support the semantics of a language (both simulation and synthesis). Although recursive descriptions can always be re-cast into non-recursive iterative forms, if a language supports a construct, a user should be able to utilise it (the authors are not offering any opinion on the relative wisdom of using recursion or iteration). The authors describe the problems/solutions of supporting the semantics of recursion (single/multiple, direct/arbitrarily indirect) in synthesis. The hardware synthesised can be smaller and faster than that obtained by reformulating the description. It is dangerous, to conclude too much from this - recursion requires a stack and a heap (plus managers). In software, these are taken for granted (-free- resources that do not feature in footprint metrics); in hardware, every resource needed must be explicitly created.
Original languageEnglish
Pages (from-to)362-369
Number of pages8
JournalIET Computers and Digital Techniques
Volume6
Issue number6
DOIs
Publication statusPublished - Nov 2012

Fingerprint

Hardware
Semantics
Computer simulation languages
Silicon
Managers
Specifications
Networks (circuits)
Electronic design automation

Cite this

Behavioural synthesis utilising recursive definitions. / Brown, A. D.; Milton, D. J. D.; Rushton, A. J.; Wilson, P. R.

In: IET Computers and Digital Techniques, Vol. 6, No. 6, 11.2012, p. 362-369.

Research output: Contribution to journalArticle

Brown, A. D. ; Milton, D. J. D. ; Rushton, A. J. ; Wilson, P. R. / Behavioural synthesis utilising recursive definitions. In: IET Computers and Digital Techniques. 2012 ; Vol. 6, No. 6. pp. 362-369.
@article{45e6bb83bcf5423584a486f3d4337613,
title = "Behavioural synthesis utilising recursive definitions",
abstract = "Behavioural synthesis is the process of automatically translating an abstract specification to physical realisation - silicon. The endpoints of this process are accelerating apart (behavioural descriptions become more abstract, DSM silicon becomes less willing to behave as Boolean circuits) but there is still work outstanding in the middle ground. Recursion allows the elegant expression of complicated systems, and is supported by many languages (software and hardware). The electronic design automation (EDA) tool designers- task is to support the semantics of a language (both simulation and synthesis). Although recursive descriptions can always be re-cast into non-recursive iterative forms, if a language supports a construct, a user should be able to utilise it (the authors are not offering any opinion on the relative wisdom of using recursion or iteration). The authors describe the problems/solutions of supporting the semantics of recursion (single/multiple, direct/arbitrarily indirect) in synthesis. The hardware synthesised can be smaller and faster than that obtained by reformulating the description. It is dangerous, to conclude too much from this - recursion requires a stack and a heap (plus managers). In software, these are taken for granted (-free- resources that do not feature in footprint metrics); in hardware, every resource needed must be explicitly created.",
author = "Brown, {A. D.} and Milton, {D. J. D.} and Rushton, {A. J.} and Wilson, {P. R.}",
year = "2012",
month = "11",
doi = "10.1049/iet-cdt.2012.0006",
language = "English",
volume = "6",
pages = "362--369",
journal = "IET Computers and Digital Techniques",
issn = "1751-8601",
publisher = "Institution of Engineering and Technology",
number = "6",

}

TY - JOUR

T1 - Behavioural synthesis utilising recursive definitions

AU - Brown, A. D.

AU - Milton, D. J. D.

AU - Rushton, A. J.

AU - Wilson, P. R.

PY - 2012/11

Y1 - 2012/11

N2 - Behavioural synthesis is the process of automatically translating an abstract specification to physical realisation - silicon. The endpoints of this process are accelerating apart (behavioural descriptions become more abstract, DSM silicon becomes less willing to behave as Boolean circuits) but there is still work outstanding in the middle ground. Recursion allows the elegant expression of complicated systems, and is supported by many languages (software and hardware). The electronic design automation (EDA) tool designers- task is to support the semantics of a language (both simulation and synthesis). Although recursive descriptions can always be re-cast into non-recursive iterative forms, if a language supports a construct, a user should be able to utilise it (the authors are not offering any opinion on the relative wisdom of using recursion or iteration). The authors describe the problems/solutions of supporting the semantics of recursion (single/multiple, direct/arbitrarily indirect) in synthesis. The hardware synthesised can be smaller and faster than that obtained by reformulating the description. It is dangerous, to conclude too much from this - recursion requires a stack and a heap (plus managers). In software, these are taken for granted (-free- resources that do not feature in footprint metrics); in hardware, every resource needed must be explicitly created.

AB - Behavioural synthesis is the process of automatically translating an abstract specification to physical realisation - silicon. The endpoints of this process are accelerating apart (behavioural descriptions become more abstract, DSM silicon becomes less willing to behave as Boolean circuits) but there is still work outstanding in the middle ground. Recursion allows the elegant expression of complicated systems, and is supported by many languages (software and hardware). The electronic design automation (EDA) tool designers- task is to support the semantics of a language (both simulation and synthesis). Although recursive descriptions can always be re-cast into non-recursive iterative forms, if a language supports a construct, a user should be able to utilise it (the authors are not offering any opinion on the relative wisdom of using recursion or iteration). The authors describe the problems/solutions of supporting the semantics of recursion (single/multiple, direct/arbitrarily indirect) in synthesis. The hardware synthesised can be smaller and faster than that obtained by reformulating the description. It is dangerous, to conclude too much from this - recursion requires a stack and a heap (plus managers). In software, these are taken for granted (-free- resources that do not feature in footprint metrics); in hardware, every resource needed must be explicitly created.

UR - http://dx.doi.org/10.1049/iet-cdt.2012.0006

U2 - 10.1049/iet-cdt.2012.0006

DO - 10.1049/iet-cdt.2012.0006

M3 - Article

VL - 6

SP - 362

EP - 369

JO - IET Computers and Digital Techniques

JF - IET Computers and Digital Techniques

SN - 1751-8601

IS - 6

ER -