Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Behavioural synthesis utilising recursive definitions

Behavioural synthesis utilising recursive definitions

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: network synthesis

Other keywords: behavioural synthesis; EDA tool; electronic design automation tool; nonrecursive iterative forms; recursive definitions; Boolean circuits; DSM silicon

Subjects: General circuit analysis and synthesis methods

References

    1. 1)
    2. 2)
      • Canis, A., Choi, J., Aldham, M.: `LegUp: high-level synthesis for FPGA-based processor/accelerator systems', FPGA’11, Monterey, California.
    3. 3)
    4. 4)
      • Ghica, D.R., Smith, A., Singh, S.: `Geometry of synthesis IV', ICFP’11, Tokyo, Japan.
    5. 5)
      • Oberg, J., Kumar, A., Hemani, A.: `Grammar-based hardware synthesis of data communication protocols', 1996 Int. Symp. on Systems Synthesis.
    6. 6)
      • Milton, D.J.D.: `Dynamic memory allocation within a behavioural synthesis system', January 2002, PhD, University of Southampton, England.
    7. 7)
      • Soderman, D., Panchul, Y.: `Implementing C designs in hardware: a full-featured ANSI C to RTL Verilog compiler in action', Int. Verilog HDL Conf. (IVC), March 1998, Santa Clara, California, p. 22–29.
    8. 8)
      • Bardsley, A., Edwards, D.A.: `The balsa asynchronous circuit synthesis system', FDL’00, 2000, Tubingen, Germany, p. 37–44.
    9. 9)
      • Smria, L., Sato, K., De Micheli, G.: `Resolution of dynamic memory allocation and pointers for the behavioural synthesis from C', DATE’00, 2000, p. 312–319.
    10. 10)
      • Peng, Z.: `Synthesis of VLSI systems with the CAMAD design aid', 23rdACM/IEEE DAC, 1986, p. 278–284.
    11. 11)
      • Cook, B., Gupta, A., Magill, S.: `Finding heap-bounds for hardware synthesis', Formal Methods in Computer Aided Design (FMCAD), November 2009.
    12. 12)
      • Williams, A.C.: `A behavioural VHDL synthesis system using data path optimisation', October 1997, PhD, University of Southampton, England.
    13. 13)
      • Simsa, J., Singh, S.: `Designing hardware with dynamic memory abstraction', ACM/SIGA Int. Symp. on Field Programmable Gate Arrays (FPGA), February 2010, Association for Computing Machinery, Inc.
    14. 14)
      • Soderman, D., Panchul, Y.: `Implementing C algorithms in reconfigurable hardware using C2Verilog', IEEE Symp. on FPGAs for Custom Computing Machines (FCCM), April 1998, Los Alamitos, CA, p. 339–342.
    15. 15)
      • www.forteds.com.
    16. 16)
      • mesl.ucsd.edu/spark.
    17. 17)
    18. 18)
      • www.bluespec.com.
    19. 19)
    20. 20)
      • A. Aho , R. Sethi , J. Ullman . (1986) Compilers – principles, techniques and tools.
    21. 21)
    22. 22)
    23. 23)
      • A.V. Aho , J.D. Ullman . (1977) Principles of compiler design.
    24. 24)
      • Ferizis, G., ElGindy, H.: `Mapping recursive functions to reconfigurable hardware', FPL’06, 2006, p. 1–6.
    25. 25)
    26. 26)
      • Panchul, Y., Soderman, D., Coleman, D.: `System for converting hardware designs in high-level programming language to hardware implementations', US, 6,226,776, May 2001.
    27. 27)
      • www.mentor.com.
    28. 28)
      • cadlab.cs.ucla.edu/soc.
    29. 29)
    30. 30)
    31. 31)
      • Baker, K.R.: `Multiple objective optimisation of data and control paths in a behavioural silicon compiler', September 1992, PhD, University of Southampton, England.
    32. 32)
      • Verkest, D., Da Silva, J.L., Ykman, C.: `Matisse: a system-on-chip design methodology emphasizing dynamic memory management', IEEE Computer Society Workshop on VLSI System Level Design, 1998.
    33. 33)
    34. 34)
      • Ramachandran, L., Narayan, S., Vahid, F., Gajski, D.D.: `Synthesis of functions and procedures in behavioral VHDL', EuroDAC‘93, 1993, p. 560–565.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cdt.2012.0006
Loading

Related content

content/journals/10.1049/iet-cdt.2012.0006
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address