| 1. |
- Axelsson, Emil, 1978, et al.
(författare)
-
Feldspar: A Domain Specific Language for Digital Signal Processing algorithms
- 2010
-
Ingår i: Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign. - 9781424478859 ; , s. 169-178
-
Konferensbidrag (refereegranskat)abstract
- A new language, Feldspar, is presented, enabling high-level and platform-independent description of digital signal processing (DSP) algorithms. Feldspar is a pure functional language embedded in Haskell. It offers a high-level dataflow style of programming, as well as a more mathematical style based on vector indices. The key to generating efficient code from such descriptions is a high-level optimization technique called vector fusion. Feldspar is based on a low-level, functional core language which has a relatively small semantic gap to machine-oriented languages like C. The core language serves as the interface to the back-end code generator, which produces C. For very small examples, the generated code performs comparably to hand-written C code when run on a DSP target. While initial results are promising, to achieve good performance on larger examples, issues related to memory access patterns and array copying will have to be addressed.
|
|
| 2. |
- Axelsson, Emil, 1978, et al.
(författare)
-
The Design and Implementation of Feldspar: An Embedded Language for Digital Signal Processing
- 2011
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783642242755 ; 6647, s. 121-136
-
Konferensbidrag (refereegranskat)abstract
- Feldspar is a domain specific language, embedded in Haskell, for programming digital signal processing algorithms. The final aim of a Feldspar program is to generate low level code with good performance. Still, we chose to provide the user with a purely functional DSL. The language is implemented as a minimal, deeply embedded core language, with shallow extensions built upon it. This paper presents full details of the essential parts of the implementation. Our initial conclusion is that this approach works well in our domain, although much work remains.
|
|
| 3. |
- Axelsson, Emil, 1978, et al.
(författare)
-
The Design and Implementation of Feldspar: an Embedded Language for Digital Signal Processing
- 2010
-
Ingår i: IFL 2010, the 22nd Symposium on Implementation and Application of Functional Languages.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Feldspar is a Domain Specific Language, embedded in Haskell, for programming Digital Signal Processing algorithms. The final aim of a Feldspar program is to generate low level code with good performance. Still, we chose to provide the user with a purely functional DSL. The language is implemented as a minimal, deeply embedded core language, with shallow extensions built upon it. This paper presents full details of the essential parts of the implementation. Our initial conclusion is that this approach works well in our domain, although much work remains.
|
|
| 4. |
- Dévai, Gergely, et al.
(författare)
-
Efficient Code Generation from the High-level Domain-specific Language Feldspar for DSPs
- 2010
-
Ingår i: ODES-8: 8th Workshop on Optimizations for DSP and Embedded Systems, workshop associated with IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
-
Konferensbidrag (refereegranskat)abstract
- Software for digital signal processors (DSPs) is traditionally highly hardware-dependent and hence porting it to new processors usually requires significant design effort. In this paper we present Feldspar (Functional Embedded Language for DSP and Parallelism), an embedded, high-level, domain-specific language for DSP algorithm design and the compilation techniques we developed for generating C code from specifications written in Feldspar. While Feldspar allows description of algorithms on specification level, we show that with the right set of abstractions and transformations this high level, functional specification can be transformed into C code that is comparable or better than reference, hand-crafted C language implementations. The Feldspar compiler is highly modular and plugin-based, hence future hardware-specific plugins will enable automatic generation of efficient, hardware-specific code. This approach enables the encapsulation of knowledge of hardware completely in the compiler and thus allows description of algorithms in completely hardware-independent, portable manner.
|
|
| 5. |
- Persson, Anders, 1972, et al.
(författare)
-
Generic Monadic Constructs for Embedded Languages
- 2012
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. ; 7257
-
Konferensbidrag (refereegranskat)abstract
- We present a library of generic monadic constructs for embedded languages. It is an extension of Syntactic, a Haskell library for defining and processing generic abstract syntax. Until now, Syntactic has been mostly suited to implement languages based on pure, side effect free, expressions. The presented extension allows the pure expressions to also contain controlled side effects, enabling the representation of expressions that rely on destructive updates for efficiency. We demonstrate the use- fulness of the extension by giving examples from the embedded language Feldspar which is implemented using Syntactic.
|
|
| 6. |
- Persson, Anders, 1972, et al.
(författare)
-
Generic monadic constructs for embedded languages
- 2011
-
Ingår i: IFL 2011, the 23rd Symposium on Implementation and Application of Functional Languages.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- We present a library for generic monadic constructs for em- bedded languages. It is an extension of Syntactic, a Haskell library for defining and processing generic abstract syntax. Syntactic works best to implement languages based on pure, side effect free, expressions. The presented extension allows the pure expressions to also contain controlled side effects, enabling efficient representation of expressions that rely on destructive updates for efficiency.
|
|
| 7. |
- Persson, Anders, 1972, et al.
(författare)
-
Programmable Signatures
- 2015
-
Ingår i: Trends in Functional Programming.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- When compiling EDSLs into other languages, types in the source language must be translated into corresponding types in the target language. The translation is often driven by a small set of rules that map a single type in the source language into a single type in the target language. However, this simple approach is limiting when there are multiple possible mappings, and it may lead to poor interoperability and performance in the generated code. Instead of hard-wiring a single set of translation rules into a compiler, this paper introduces a small language that lets the programmer describe the mapping of each argument and function separately.
|
|
| 8. |
- Persson, Anders, 1972, et al.
(författare)
-
Programmable Signatures
- 2016
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. ; 9547, s. 124-135
-
Konferensbidrag (refereegranskat)abstract
- When compiling Embedded Domain Specific Languages (EDSLs) into other languages, the compiler translates types in the source language into corresponding types in the target language. The translation is often driven by a small set of rules that map a single type in the source language into a single type in the target language. This simple approach is limiting when there are multiple possible mappings, and it may lead to poor interoperability and poor performance in the generated code. Instead of hard-wiring a single set of translation rules into a compiler, this paper introduces a small language that lets the programmer describe the mapping of each argument and function separately.
|
|
| 9. |
- Persson, Anders, 1972
(författare)
-
Towards a Functional Programming Language for Baseband Signal Processing
- 2014
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Developing software for resource constrained embedded systems is a daunting task. In addition to getting the functionality right, a programmer must consider several non-functional properties, including data layout, the target memory hierarchy, concurrency and parallelism. The programmer has to decide on a specific and reasonable solution on these properties upfront during development However, these decisions are necessarily based on incomplete information, since the optimial solution depends on the actual deployment on the target hardware.In this thesis we explore a generative approach, with a staged functional domain specific language, to postpone many of these decisions to a much later stage of the development process.The staged approach gives the progammer explicit control over much of the code generation by using combinators to build the application from reusable components and skeletons.Currently, Feldspar is focused on the data processing part of signal processing in embedded systems. The Feldspar compiler generates single C functions that can be integrated into existing systems. The Feldspar language is based on a combination of shallow and deep embedding, which makes it modular both for the language developer and the end user. This modularity made it easy to add monadic expressions to support mutable updates and deterministic parallelism. Future work includes generation, deployment and orchestration of systems of data processing functions and control processing.Additionally, this thesis presents a technique, and supporting library that allows the programmer to test, profile and analyze compiled Feldspar programs from the host language environment.
|
|
| 10. |
- Svenningsson, Josef, 1976, et al.
(författare)
-
Efficient Monadic Streams
- 2015
-
Ingår i: Trends in Functional Programming.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Functional stream representations allow for a high-level, compositional way of programming digital signal processing algorithms. However, some algorithms, such as filters, cannot be efficiently implemented using purely functional techniques, due to excessive copying of data. We present a monadic representation of streams which introduces the ability to use mutation for efficiency when implementing algorithms. Still, our representation enjoys many of the benefits of purely functional streams, such as a functional API and fusion. Our representation enables further optimizations: we show how to remove duplicate loop variables, and how to keep buffers entirely in references. Our measurements show that the new monadic representation consistently outperforms the functional representation by at least a factor of four when evaluated in the context of the Feldspar embedded DSL.
|
|
