liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automatic Port and Bus Sizing in NoGAP
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
2010 (English)In: International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, 2010, 258-264 p.Conference paper, Published paper (Refereed)
Abstract [en]

ASIP processors and programmable accelerators are replacing monolithic ASICs in more and more areas. However the design and implementation of a new ASIP processor or programmable accelerator requires a substantial design effort. There are a number of existing tools that promise to ease this design effort, but using these tools usually means that the designer get locked into the tools a priori assumtions and it is therefore hard to develop truly novel ASIPs or accelerators. NoGAP is a tool that delivers design support while not locking the designer into any predefined template architecture. An important aspect of NoGAPs design process is the ability to design the data path of each instruction individually. Therefore the size of input/output ports can sometimes not be known while designing the individual functional units. For this reason we have introduced the concept of dynamic port sizes, which is an extension of the parameter/generic concept in Verilog/VHDL. A problem arises if the data path graph contains loops, either due to intra or inter instruction dependencies. This paper will present the algorithm used to solve this looping problem.

Place, publisher, year, edition, pages
2010. 258-264 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-58302DOI: 10.1109/ICSAMOS.2010.5642057ISBN: 978-1-4244-7938-2 (print)ISBN: 978-1-4244-7936-8 (print)OAI: oai:DiVA.org:liu-58302DiVA: diva2:337857
Conference
SAMOS X: International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation
Available from: 2010-08-09 Created: 2010-08-09 Last updated: 2014-09-19

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Karlström, PerZhou, WenbiaoLiu, Dake

Search in DiVA

By author/editor
Karlström, PerZhou, WenbiaoLiu, Dake
By organisation
Computer EngineeringThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 221 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf