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
Efficient Compilation for Application Specific Instruction set DSP Processors with Multi-bank Memories
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.
2015 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Modern signal processing systems require more and more processing capacity as times goes on. Previously, large increases in speed and power efficiency have come from process technology improvements. However, lately the gain from process improvements have been greatly reduced. Currently, the way forward for high-performance systems is to use specialized hardware and/or parallel designs.

Application Specific Integrated Circuits (ASICs) have long been used to accelerate the processing of tasks that are too computationally heavy for more general processors. The problem with ASICs is that they are costly to develop and verify, and the product life time can be limited with newer standards. Since they are very specific the applicable domain is very narrow.

More general processors are more flexible and can easily adapt to perform the functions of ASIC based designs. However, the generality comes with a performance cost that renders general designs unusable for some tasks. The question then becomes, how general can a processor be while still being power efficient and fast enough for some particular domain?

Application Specific Instruction set Processors (ASIPs) are processors that target a specific application domain, and can offer enough performance  with power efficiency and silicon cost that is comparable to ASICs. The flexibility allows for the same hardware design to be used over several system designs, and also for multiple functions in the same system, if some functions are not used simultaneously.

One problem with ASIPs is that they are more difficult to program than a general purpose processor, given that we want efficient software. Utilizing all of the features that give an ASIP its performance advantage can be difficult at times, and new tools and methods for programming them are needed.

This thesis will present ePUMA (embedded Parallel DSP platform with Unique Memory Access), an ASIP architecture that targets algorithms with predictable data access. These kinds of algorithms are very common in e.g. baseband processing or multimedia applications. The primary focus will be on the specific features of ePUMA that are utilized to achieve high performance, and how it is possible to automatically utilize them using tools. The most significant features include data permutation for conflict-free data access, and utilization of address generation features for overhead free code execution. This sometimes requires specific information; for example the exact sequences of addresses in memory that are accessed, or that some operations may be performed in parallel. This is not always available when writing code using the traditional way with traditional languages, e.g. C, as extracting this information is still a very active research topic. In the near future at least, the way that software is written needs to change to exploit all hardware features, but in many cases in a positive way. Often the problem with current methods is that code is overly specific, and that a more general abstractions are actually easier to generate code from.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2015. , 188 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1641
National Category
Computer Engineering Signal Processing
Identifiers
URN: urn:nbn:se:liu:diva-113702DOI: 10.3384/diss.diva-113702ISBN: 978-91-7519-151-5 (print)OAI: oai:DiVA.org:liu-113702DiVA: diva2:784329
Public defence
2015-02-27, Visionen, Hus B, Campus Valla, Linköpings universitet, Linköping, 10:15 (Swedish)
Opponent
Supervisors
Available from: 2015-01-29 Created: 2015-01-29 Last updated: 2015-01-29Bibliographically approved

Open Access in DiVA

fulltext(4433 kB)572 downloads
File information
File name FULLTEXT01.pdfFile size 4433 kBChecksum SHA-512
b608ed5cf3878b17c1c7f519a79e1e49e7392fc4518657fdf8bc31cfbc4cfba1576102873810636561da30135a18955c7d6a639587171c1228031c376c6f4a3c
Type fulltextMimetype application/pdf
omslag(50 kB)19 downloads
File information
File name COVER01.pdfFile size 50 kBChecksum SHA-512
6db36ebd88d3ee32bddd920dfe740430cae193fd94c06ea08c046593b4a4e4254ad1e019616524e8aa915e9dc694da633bda43eaabf0f80263aee212b9fdfce2
Type coverMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Sohl, Joar

Search in DiVA

By author/editor
Sohl, Joar
By organisation
Computer EngineeringThe Institute of Technology
Computer EngineeringSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 572 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1197 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