% author names and affiliations
% use a multiple column layout for up to three different
% affiliations
-\author{\IEEEauthorblockN{Matthijs Kooijman, Christiaan P.R. Baaij, Jan Kuper, Marco E.T. Gerards}%, Bert Molenkamp, Sabih H. Gerez}
+\author{\IEEEauthorblockN{Christiaan P.R. Baaij, Matthijs Kooijman, Jan Kuper, Marco E.T. Gerards}%, Bert Molenkamp, Sabih H. Gerez}
\IEEEauthorblockA{%Computer Architecture for Embedded Systems (CAES)\\
Department of EEMCS, University of Twente\\
P.O. Box 217, 7500 AE, Enschede, The Netherlands\\
-matthijs@@stdin.nl, c.p.r.baaij@@utwente.nl, j.kuper@@utwente.nl}
+c.p.r.baaij@@utwente.nl, matthijs@@stdin.nl, j.kuper@@utwente.nl}
% \thanks{Supported through the FP7 project: S(o)OS (248465)}
}
% \and
T-Ruby,HML2,Hydra,Hawk1,Lava,Wired,ForSyDe1,reFLect}. The idea of using
functional languages for hardware descriptions started in the early 1980s
\cite{Cardelli1981,muFP,DAISY}, a time which also saw the birth of the
-currently popular hardware description languages, such as \VHDL. Functional
+currently popular \acrop{HDL}, such as \VHDL. Functional
languages are especially well suited to describe hardware because
combinational circuits can be directly modeled as mathematical functions and
-functional languages are very good at describing and composing these
-mathematical functions.
+functional languages are very good at describing and composing these
+functions.
-In an attempt to decrease the amount of work involved in creating all the
-required tooling, such as parsers and type-checkers, many functional
-\acrop{HDL} \cite{Hydra,Hawk1,Lava,Wired} are embedded as a domain
+In an attempt to ease the prototyping process of the language, such as
+creating all the required tooling, like parsers and type-checkers, many
+functional \acrop{HDL} \cite{Hydra,Hawk1,Lava,Wired} are embedded as a domain
specific language (\acro{DSL}) within the functional language Haskell
\cite{Haskell}. This means that a developer is given a library of Haskell
functions and types that together form the language primitives of the
\acro{DSL}. The primitive functions used to describe a circuit do not actually
-process any signals, they instead compose a large domain-specific datatype
-(which is usually hidden from the designer). This datatype is then further
+process any signals, they instead compose a large domain-specific graph
+(which is usually hidden from the designer). This graph is then further
processed by an embedded circuit compiler which can perform for example
-simulation or synthesis. As Haskell's choice elements (\hs{if}-expressions,
-\hs{case}-expressions, etc.) are evaluated at the time the domain-specific
-datatype is being build, they are no longer visible to the embedded compiler
-that processes the datatype. Consequently, it is impossible the capture
-Haskell's choice elements within a circuit description when taking the
-embedded language approach. This does not mean that circuits specified in an
-embedded language can not contain choice, just that choice elements only
-exists as functions, e.g. a multiplexer function, and not as language
-elements.
-
-The approach taken in this research is not to make another \acro{DSL} embedded
-in Haskell, but to use (a subset of) the Haskell language \emph{itself} for
-the purpose of describing hardware. By taking this approach, this research
-\emph{can} capture certain language constructs, such as Haskell's choice
-elements, within circuit descriptions. To the best knowledge of the authors,
-supporting polymorphism, higher-order functions and such an extensive array of
-choice-elements is new in the domain of (functional) \acrop{HDL}.
+simulation or synthesis. As Haskell's choice elements (\hs{case}-expressions,
+pattern-matching etc.) are evaluated at the time the domain-specific graph is
+being build, they are no longer visible to the embedded compiler that
+processes the datatype. Consequently, it is impossible to capture Haskell's
+choice elements within a circuit description when taking the embedded language
+approach. This does not mean that circuits specified in an embedded language
+can not contain choice, just that choice elements only exists as functions,
+e.g. a multiplexer function, and not as language elements.
+
+The approach taken in this research is to use (a subset of) the Haskell
+language \emph{itself} for the purpose of describing hardware. By taking this
+approach, this research \emph{can} capture certain language constructs, like
+all of Haskell's choice elements, within circuit descriptions. The more
+advanced features of Haskel, such as polymorphic typing and higher-order
+function, are also supported.
+
+% supporting polymorphism, higher-order functions and such an extensive array
+% of choice-elements, combined with a very concise way of specifying circuits
+% is new in the domain of (functional) \acrop{HDL}.
% As the hardware descriptions are plain Haskell
% functions, these descriptions can be compiled to an executable binary
% for simulation using an optimizing Haskell compiler such as the Glasgow
% Haskell Compiler (\GHC)~\cite{ghc}.
Where descriptions in a conventional \acro{HDL} have an explicit clock for the
-purposes state and synchronicity, the clock is implied in the context of the
-research presented in this paper. A circuit designer describes the behavior of
-the hardware between clock cycles. Many functional \acrop{HDL} model signals
-as a stream of all values over time; state is then modeled as a delay on this
-stream of values. The approach taken in this research is to make the current
-state an additional input and the updated state a part of the output of a
-function. This abstraction of state and time limits the descriptions to
-synchronous hardware, there is however room within the language to eventually
-add a different abstraction mechanism that will allow for the modeling of
-asynchronous systems.
+purposes state and synchronicity, the clock is implicit for the descriptions and research presented in this paper. A circuit designer describes the behavior of the hardware between clock cycles. Many functional \acrop{HDL} model signals as a stream of all values over time; state is then modeled as a delay on this stream of values. Descriptions presented in this research make the current state an additional input and the updated state a part of their output. This abstraction of state and time limits the descriptions to synchronous hardware, there is however room within the language to eventually add a different abstraction mechanism that will allow for the modeling of asynchronous systems.
Like the traditional \acrop{HDL}, descriptions made in a functional \acro{HDL}
must eventually be converted into a netlist. This research also features a
behaving synthesizable \VHDL\ code, ready to be converted to an actual netlist
format by an (optimizing) \VHDL\ synthesis tool.
-Besides trivial circuits such as variants of both the \acro{FIR} filter and
-the simple \acro{CPU} shown in \Cref{sec:usecases}, the \CLaSH\ compiler has
-also been able to successfully translate non-trivial functional descriptions
-such as a streaming reduction circuit~\cite{reductioncircuit} for floating
-point numbers.
+Besides simple circuits such as variants of both the \acro{FIR} filter and
+the higher-order \acro{CPU} shown in \Cref{sec:usecases}, the \CLaSH\ compiler
+has also been able to translate non-trivial functional descriptions such as a
+streaming reduction circuit~\cite{reductioncircuit} for floating point
+numbers.
+
+To the best knowledge of the authors, \CLaSH\ is the only (functional)
+\acro{HDL} that allows circuit specification to be written in a very concise
+way and at the same time support such advanced features as polymorphic typing,
+higher order functions and pattern matching.
\section{Hardware description in Haskell}
The following section describes the basic language elements of \CLaSH\ and the
eventual netlist representation is also highlighted.
\subsection{Function application}
- Two basic syntactic elements of a functional program are functions
- and function application. These have a single obvious translation to a
- netlist format:
+ Two basic elements of a functional program are functions and function
+ application. These have a single obvious translation to a netlist format:
\begin{inparaenum}
\item every function is translated to a component,
\item every function argument is translated to an input port,
% to understand and possibly hand-optimize the resulting \VHDL\ output of
% the \CLaSH\ compiler.
- The short example (\ref{lst:code1}) demonstrated below gives an indication
- of the level of conciseness that can be achieved with functional hardware
- description languages when compared with the more traditional hardware
- description languages. The example is a combinational multiply-accumulate
- circuit that works for \emph{any} word length (this type of polymorphism
- will be further elaborated in \Cref{sec:polymorhpism}). The corresponding
- netlist is depicted in \Cref{img:mac-comb}.
+ The short example (\ref{lst:code1}) seen below gives a demonstration of
+ the conciseness that can be achieved with \CLaSH\ when compared with
+ other (more traditional) \acrop{HDL}. The example is a combinational
+ multiply-accumulate circuit that works for \emph{any} word length (this
+ type of polymorphism will be further elaborated in
+ \Cref{sec:polymorhpism}). The corresponding netlist is depicted in
+ \Cref{img:mac-comb}.
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
\label{lst:code2}
\end{example}
\end{minipage}
+ \vspace{-1.5em}
\begin{figure}
+ \vspace{1em}
\centerline{\includegraphics{mac-nocurry.svg}}
\caption{Combinational Multiply-Accumulate (composite output)}
\label{img:mac-comb-composite}
% A \hs{case} expression can in turn simply be translated to a conditional
% assignment in \VHDL, where the conditions use equality comparisons
% against the constructors in the \hs{case} expressions.
- Two versions of a contrived example are displayed below, the first
- (\ref{lst:code3}) using a \hs{case} expression and the second
- (\ref{lst:code4}) using an \hs{if-then-else} expression. Both examples
- sum two values when they are equal or non-equal (depending on the given
- predicate, the \hs{pred} variable) and return 0 otherwise. The \hs{pred}
- variable is of the following, user-defined, enumeration datatype:
+
+ % Two versions of a contrived example are displayed below, the first
+ % (\ref{lst:code3}) using a \hs{case} expression and the second
+ % (\ref{lst:code4}) using an \hs{if-then-else} expression. Both examples
+ % sum two values when they are equal or non-equal (depending on the given
+ % predicate, the \hs{pred} variable) and return 0 otherwise.
+
+ An code example (\ref{lst:code3}) that uses a \hs{case} expression and
+ \hs{if-then-else} expressions is shown below. The function counts up or
+ down depending on the \hs{direction} variable, and has a \hs{wrap}
+ variable that determines both the upper bound and wrap-around point of the
+ counter. The \hs{direction} variable is of the following, user-defined,
+ enumeration datatype:
\begin{code}
- data Pred = Equal | NotEqual
+ data Direction = Up | Down
\end{code}
- The naive netlist corresponding to both versions of the example is
- depicted in \Cref{img:choice}. Note that the \hs{pred} variable is only
- compared to \hs{Equal}, as an inequality immediately implies that
- \hs{pred} is \hs{NotEqual}.
+ The naive netlist corresponding to this example is depicted in
+ \Cref{img:counter}. Note that the \hs{direction} variable is only
+ compared to \hs{Up}, as an inequality immediately implies that
+ \hs{direction} is \hs{Down}.
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
\begin{code}
- sumif pred a b = case pred of
- Equal -> case a == b of
- True -> a + b
- False -> 0
- NotEqual -> case a != b of
- True -> a + b
- False -> 0
+ counter direction wrap x = case direction of
+ Up -> if x < wrap then
+ x + 1 else
+ 0
+ Down -> if x > 0 then
+ x - 1 else
+ wrap
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
\label{lst:code3}
\end{example}
\end{minipage}
+
+ % \hspace{-1.7em}
+ % \begin{minipage}{0.93\linewidth}
+ % \begin{code}
+ % sumif pred a b =
+ % if pred == Equal then
+ % if a == b then a + b else 0
+ % else
+ % if a != b then a + b else 0
+ % \end{code}
+ % \end{minipage}
+ % \begin{minipage}{0.07\linewidth}
+ % \begin{example}
+ % \label{lst:code4}
+ % \end{example}
+ % \end{minipage}
- \hspace{-1.7em}
- \begin{minipage}{0.93\linewidth}
- \begin{code}
- sumif pred a b =
- if pred == Equal then
- if a == b then a + b else 0
- else
- if a != b then a + b else 0
- \end{code}
- \end{minipage}
- \begin{minipage}{0.07\linewidth}
- \begin{example}
- \label{lst:code4}
- \end{example}
- \end{minipage}
+ % \begin{figure}
+ % \vspace{1em}
+ % \centerline{\includegraphics{choice-case.svg}}
+ % \caption{Choice - sumif}
+ % \label{img:choice}
+ % \vspace{-1.5em}
+ % \end{figure}
\begin{figure}
- \vspace{1em}
- \centerline{\includegraphics{choice-case.svg}}
- \caption{Choice - sumif}
- \label{img:choice}
- \vspace{-1.5em}
+ \centerline{\includegraphics{counter.svg}}
+ \caption{Counter netlist}
+ \label{img:counter}
+ \vspace{-2em}
\end{figure}
A user-friendly and also very powerful form of choice that is not found in
clause if the guard evaluates to false. Like \hs{if-then-else}
expressions, pattern matching and guards have a (straightforward)
translation to \hs{case} expressions and can as such be mapped to
- multiplexers. A third version (\ref{lst:code5}) of the earlier example,
+ multiplexers. A second version (\ref{lst:code5}) of the earlier example,
now using both pattern matching and guards, can be seen below. The guard
is the expression that follows the vertical bar (\hs{|}) and precedes the
assignment operator (\hs{=}). The \hs{otherwise} guards always evaluate to
\hs{true}.
The version using pattern matching and guards corresponds to the same
- naive netlist representation (\Cref{img:choice}) as the earlier two
- versions of the example.
+ naive netlist representation (\Cref{img:counter}) as the earlier example.
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
\begin{code}
- sumif Equal a b | a == b = a + b
- | otherwise = 0
- sumif NotEqual a b | a != b = a + b
+ counter Up wrap x | x < wrap = x + 1
| otherwise = 0
+ counter Down wrap x | x > 0 = x - 1
+ | otherwise = wrap
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
% \hs{RegisterState} type is a vector of 8 32-bit words. A fixed size
% vector is translated to a \VHDL\ array type.
\item[\bf{Index}]
- this is another type to describe integers, but unlike the previous
- two it has no specific bit-width, but an upper bound. This means that
- its range is not limited to powers of two, but can be any number.
- An \hs{Index} only has an upper bound, its lower bound is
- implicitly zero. If a value of this type exceeds either bounds, an
- error will be thrown at simulation-time. The main purpose of the
- \hs{Index} type is to be used as an index into a \hs{Vector}.
+ the main purpose of the \hs{Index} type is to be used as an index into
+ a \hs{Vector}, and has no specified bit-size, but a specified upper
+ bound. This means that its range is not limited to powers of two, but
+ can be any number. An \hs{Index} only has an upper bound, its lower
+ bound is implicitly zero. If a value of this type exceeds either
+ bounds, an error will be thrown at \emph{simulation}-time.
% \comment{TODO: Perhaps remove this example?} To define an index for
% the 8 element vector above, we would do:
\end{xlist}
\subsubsection{User-defined types}
- There are three ways to define new types in Haskell: algebraic
- data-types with the \hs{data} keyword, type synonyms with the \hs{type}
- keyword and datatype renaming constructs with the \hs{newtype} keyword.
+ % There are three ways to define new types in Haskell: algebraic
+ % data-types with the \hs{data} keyword, type synonyms with the \hs{type}
+ % keyword and datatype renaming constructs with the \hs{newtype} keyword.
% \GHC\ offers a few more advanced ways to introduce types (type families,
% existential typing, {\acro{GADT}}s, etc.) which are not standard
% Haskell. As it is currently unclear how these advanced type constructs
% correspond to hardware, they are for now unsupported by the \CLaSH\
% compiler.
-
- Only an algebraic datatype declaration actually introduces a
- completely new type. Type synonyms and type renaming only define new
- names for existing types, where synonyms are completely interchangeable
- and a type renaming requires an explicit conversion. Type synonyms and
- type renaming do not need any particular translation, a synonym or
- renamed type will just use the same representation as the original type.
+ A completely new type is introduced by an algebraic datatype declaration
+ which is defined using the \hs{data} keyword. Type synonyms can be
+ introduced using the \hs{type} keyword.
+ % Only an algebraic datatype declaration actually introduces a
+ % completely new type. Type synonyms and type renaming only define new
+ % names for existing types, where synonyms are completely interchangeable
+ % and a type renaming requires an explicit conversion.
+ Type synonyms do not need any particular translation, as a synonym will
+ just use the same representation as the original type.
For algebraic types, we can make the following distinctions:
\begin{xlist}
\item[\bf{Single constructor}]
Algebraic datatypes with a single constructor with one or more
- fields, are essentially a way to pack a few values together in a
- record-like structure. Haskell's built-in tuple types are also defined
- as single constructor algebraic types (but with a bit of
- syntactic sugar). An example of a single constructor type with
- multiple fields is the following pair of integers:
+ fields allow values to be packed together in a record-like structure.
+ Haskell's built-in tuple types are also defined as single constructor
+ algebraic types (using a bit of syntactic sugar). An example of a
+ single constructor type with multiple fields is the following pair of
+ integers:
\begin{code}
data IntPair = IntPair Int Int
\end{code}
% for every field in the constructor.
\item[\bf{No fields}]
Algebraic datatypes with multiple constructors, but without any
- fields are essentially a way to get an enumeration-like type
- containing alternatives. Note that Haskell's \hs{Bool} type is also
- defined as an enumeration type, but that there is a fixed translation
- for that type within the \CLaSH\ compiler. An example of such an
- enumeration type is the type that represents the colors in a traffic
- light:
+ fields are essentially enumeration types. Note that Haskell's
+ \hs{Bool} type is also defined as an enumeration type, but that there
+ is a fixed translation for that type within the \CLaSH\ compiler. An
+ example of an enumeration type definition is the definition for a
+ traffic light:
\begin{code}
data TrafficLight = Red | Orange | Green
\end{code}
\item[\bf{Multiple constructors with fields}]
Algebraic datatypes with multiple constructors, where at least
one of these constructors has one or more fields are currently not
- supported.
+ supported. Additional research is required to allow for the overlap of
+ the fields belonging to the different constructors.
\end{xlist}
\subsection{Polymorphism}\label{sec:polymorhpism}
any number of new types.
As an example of a parametric polymorphic function, consider the type of
- the following \hs{append} function, which appends an element to a
- vector:\footnote{The \hs{::} operator is used to annotate a function
+ the following \hs{first} function, which returns the first element of a
+ tuple:\footnote{The \hs{::} operator is used to annotate a function
with its type.}
\begin{code}
- append :: [a|n] -> a -> [a|n + 1]
+ first :: (a,b) -> a
\end{code}
- This type is parameterized by \hs{a}, which can contain any type at
- all. This means that \hs{append} can append an element to a vector,
- regardless of the type of the elements in the list (as long as the type of
- the value to be added is of the same type as the values in the vector).
- This kind of polymorphism is extremely useful in hardware designs to make
- operations work on a vector without knowing exactly what elements are
- inside, routing signals without knowing exactly what kinds of signals
- these are, or working with a vector without knowing exactly how long it
- is. Polymorphism also plays an important role in most higher order
- functions, as we will see in the next section.
+ This type is parameterized in both \hs{a} and \hs{b}, which can both
+ represent any type at all (as long as that type is supported by the
+ \CLaSH\ compiler). This means that \hs{first} works for any tuple,
+ regardless of what elements it contains. This kind of polymorphism is
+ extremely useful in hardware designs, for example when routing signals
+ without knowing their exact type, or specifying vector operations that
+ work on vectors of any length and element type. Polymorphism also plays an
+ important role in most higher order functions, as will be shown in the
+ next section.
Another type of polymorphism is \emph{ad-hoc
polymorphism}~\cite{polymorphism}, which refers to polymorphic
functions which can be applied to arguments of different types, but which
behave differently depending on the type of the argument to which they are
applied. In Haskell, ad-hoc polymorphism is achieved through the use of
- type classes, where a class definition provides the general interface of a
- function, and class instances define the functionality for the specific
- types. An example of such a type class is the \hs{Num} class, which
- contains all of Haskell's numerical operations. A designer can make use
- of this ad-hoc polymorphism by adding a constraint to a parametrically
- polymorphic type variable. Such a constraint indicates that the type
- variable can only be instantiated to a type whose members supports the
- overloaded functions associated with the type class.
+ \emph{type classes}, where a class definition provides the general
+ interface of a function, and class \emph{instances} define the
+ functionality for the specific types. An example of such a type class is
+ the \hs{Num} class, which contains all of Haskell's numerical operations.
+ A designer can make use of this ad-hoc polymorphism by adding a
+ \emph{constraint} to a parametrically polymorphic type variable. Such a
+ constraint indicates that the type variable can only be instantiated to a
+ type whose members supports the overloaded functions associated with the
+ type class.
An example of a type signature that includes such a constraint if the
signature of the \hs{sum} function, which sums the values in a vector:
This type is again parameterized by \hs{a}, but it can only contain
types that are \emph{instances} of the \emph{type class} \hs{Num}, so that
the compiler knows that the addition (+) operator is defined for that
- type.
+ type.
+
+ A place where class constraints also play a role is in the size and range
+ parameters of the \hs{Vector} and numeric types. The reason being that
+ these parameters have to be limited to types that can represent
+ \emph{natural} numbers. This constraint will also be reflected in any of
+ the functions that work these types. The complete type of for example the
+ \hs{Vector} type is:
+ \begin{code}
+ Natural n => Vector n a
+ \end{code}
+
% \CLaSH's built-in numerical types are also instances of the \hs{Num}
% class.
% so we can use the addition operator (and thus the \hs{sum}
type as the first argument of the function passed to \hs{map}. The element
type of the resulting vector is equal to the return type of the function
passed, which need not necessarily be the same as the element type of the
- input vector. All of these characteristics can readily be inferred from
- the type signature belonging to \hs{map}:
+ input vector. All of these characteristics can be inferred from the type
+ signature belonging to \hs{map}:
\begin{code}
- map :: (a -> b) -> [a|n] -> [b|n]
+ map :: Natural n => (a -> b) -> [a|n] -> [b|n]
\end{code}
So far, only functions have been used as higher-order values. In
% \comment{TODO: Describe ALU example (no code)}
\subsection{State}
- A very important concept in hardware is the concept of state. In a
- stateful design, the outputs depend on the history of the inputs, or the
- state. State is usually stored in registers, which retain their value
+ In a stateful design, the outputs depend on the history of the inputs, or
+ the state. State is usually stored in registers, which retain their value
during a clock cycle. As we want to describe more than simple
combinational designs, \CLaSH\ needs an abstraction mechanism for state.
- An important property in Haskell, and in most other functional languages,
+ An important property in Haskell, and in many other functional languages,
is \emph{purity}. A function is said to be \emph{pure} if it satisfies two
conditions:
\begin{inparaenum}
As the \hs{run} function, the hardware description, and the test
inputs are also valid Haskell, the complete simulation can be compiled to
an executable binary by an optimizing Haskell compiler, or executed in an
- Haskell interpreter. Both simulation paths are much faster than first
- translating the description to \VHDL\ and then running a \VHDL\
- simulation.
+ Haskell interpreter. Both simulation paths require less effort from a
+ circuit designer than first translating the description to \VHDL\ and then
+ running a \VHDL\ simulation; it is also very likely that both simulation
+ paths are much faster.
\section{The \CLaSH\ compiler}
An important aspect in this research is the creation of the prototype
\end{figure}
The output of the \GHC\ front-end consists of the translation of the original
-Haskell description in \emph{Core}~\cite{Sulzmann2007}, which is a smaller,
+Haskell description to \emph{Core}~\cite{Sulzmann2007}, which is a smaller,
typed, functional language. This \emph{Core} language is relatively easy to
process compared to the larger Haskell language. A description in \emph{Core}
can still contain elements which have no direct translation to hardware, such
The final step in the compiler pipeline is the translation to a \VHDL\
\emph{netlist}, which is a straightforward process due to resemblance of a
normalized description and a set of concurrent signal assignments. We call the
-end-product of the \CLaSH\ compiler a \VHDL\ \emph{netlist} as the resulting
-\VHDL\ resembles an actual netlist description and not idiomatic \VHDL.
+end-product of the \CLaSH\ compiler a \VHDL\ \emph{netlist} as the result
+resembles an actual netlist description, and the fact that it is \VHDL\ is
+only an implementation detail; the output could for example also be in
+Verilog.
\section{Use cases}
\label{sec:usecases}
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
\begin{code}
-as *+* bs = foldl1 (+) (zipWith (*) as bs)
+as *+* bs = fold (+) (zipWith (*) as bs)
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
each of the elements in the two vectors pairwise (\emph{e.g.}, \hs{zipWith (*)
[1, 2] [3, 4]} becomes \hs{[1 * 3, 2 * 4]}).
-The \hs{foldl1} function takes a binary function, a single vector, and applies
+The \hs{fold} function takes a binary function, a single vector, and applies
the function to the first two elements of the vector. It then applies the
function to the result of the first application and the next element in the
vector. This continues until the end of the vector is reached. The result of
-the \hs{foldl1} function is the result of the last application. It is obvious
+the \hs{fold} function is the result of the last application. It is obvious
that the \hs{zipWith (*)} function is pairwise multiplication and that the
-\hs{foldl1 (+)} function is summation.
+\hs{fold (+)} function is summation.
% Returning to the actual \acro{FIR} filter, we will slightly change the
% equation describing it, so as to make the translation to code more obvious and
% concise. What we do is change the definition of the vector of input samples
\begin{minipage}{0.93\linewidth}
\begin{code}
fir (State (xs,hs)) x =
- (State (x >> xs,hs), (x +> xs) *+* hs)
+ (State (shiftInto x xs,hs), (x +> xs) *+* hs)
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
\hs{hs} contains the \acro{FIR} coefficients, and \hs{x} is the current input
sample. The concatenate operator (\hs{+>}) creates a new vector by placing the
current sample (\hs{x}) in front of the previous samples vector (\hs{xs}). The
-code for the shift (\hs{>>}) operator, that adds the new input sample (\hs{x})
+code for the \hs{shiftInto} function, that adds the new input sample (\hs{x})
to the list of previous input samples (\hs{xs}) and removes the oldest sample,
is shown below:
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
\begin{code}
-x >> xs = x +> init xs
+shiftInto x xs = x +> init xs
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
The vector \hs{inputs} is the set of data sources, which is passed to
each function unit as a set of possible operants. The \acro{CPU} also receives
a vector of address pairs, which are used by each function unit to select
-their operand. The application of the function units to the \hs{inputs} and
-\hs{addrs} arguments seems quite repetitive and could be rewritten to use
-a combination of the \hs{map} and \hs{zipwith} functions instead.
-However, the prototype compiler does not currently support working with lists
-of functions, so a more explicit version of the code is given instead.
+their operand.
+% The application of the function units to the \hs{inputs} and
+% \hs{addrs} arguments seems quite repetitive and could be rewritten to use
+% a combination of the \hs{map} and \hs{zipwith} functions instead.
+% However, the prototype compiler does not currently support working with
+% lists of functions, so a more explicit version of the code is given instead.
\hspace{-1.7em}
\begin{minipage}{0.93\linewidth}
, fu mul inputs (addrs!3)
]
inputs = 0 +> (1 +> (input +> s))
- out = head s'
+ out = last s
\end{code}
\end{minipage}
\begin{minipage}{0.07\linewidth}
\acro{HML}~\cite{HML2} is a hardware modeling language based on the strict
functional language \acro{ML}, and has support for polymorphic types and
-higher-order functions. Published work suggests that there is no direct
-simulation support for \acro{HML}, but that a description in \acro{HML} has to
-be translated to \VHDL\ and that the translated description can then be
-simulated in a \VHDL\ simulator. Certain aspects of HML, such as higher-order
-functions are however not supported by the \VHDL\ translator~\cite{HML3}. The
-\CLaSH\ compiler on the other hand can correctly translate all of the language
-constructs mentioned in this paper. % to a netlist format.
+higher-order functions. There is no direct simulation support for \acro{HML},
+so a description in \acro{HML} has to be translated to \VHDL\ and that the
+translated description can then be simulated in a \VHDL\ simulator. Certain
+aspects of HML, such as higher-order functions are however not supported by
+the \VHDL\ translator~\cite{HML3}. The \CLaSH\ compiler on the other hand can
+correctly translate all of the language constructs mentioned in this paper.
\begin{figure}
\centerline{\includegraphics{highordcpu.svg}}
Like the research presented in this paper, many functional hardware
description languages have some sort of foundation in the functional
-programming language Haskell. Hawk~\cite{Hawk1} uses Haskell to describe
-system-level executable specifications used to model the behavior of
-superscalar microprocessors. Hawk specifications can be simulated; to the best
-knowledge of the authors there is however no support for automated circuit
-synthesis.
+programming language Haskell. Hawk~\cite{Hawk1} is a hardware modeling
+language embedded in Haskell and has sequential environments that make it
+easier to specify stateful computation. Hawk specifications can be simulated;
+to the best knowledge of the authors there is however no support for automated
+circuit synthesis.
The ForSyDe~\cite{ForSyDe2} system uses Haskell to specify abstract system
models. A designer can model systems using heterogeneous models of
Though ForSyDe offers higher-order functions and polymorphism, ForSyDe's
choice elements are limited to \hs{if} and \hs{case} expressions. ForSyDe's
explicit conversions, where function have to be wrapped in processes and
-process have to be wrapped in systems, combined with the explicit
-instantiations of components also makes ForSyDe more verbose than
-\CLaSH.
+processes have to be wrapped in systems, combined with the explicit
+instantiations of components, also makes ForSyDe more verbose than \CLaSH.
Lava~\cite{Lava} is a hardware description language, embedded in Haskell, and
focuses on the structural representation of hardware. Like \CLaSH, Lava has
\CLaSH\ differs from Lava, in that all of Haskell's choice elements, such as
\hs{case}-expressions and pattern matching, are synthesized to choice elements
in the eventual circuit. Consequently, descriptions containing rich control
-structures can be specified in a far more user-friendly way in \CLaSH\ than
-possible within Lava. As a result, the control structures are also less
-error-prone.
+structures can be specified in a more user-friendly way in \CLaSH\ than possible within Lava, and are hence less error-prone.
Bluespec~\cite{Bluespec} is a high-level synthesis language that features
guarded atomic transactions and allows for the automated derivation of control
\section{Future Work}
The choice of describing state explicitly as extra arguments and results can
be seen as a mixed blessing. Even though the description that use state are
-usually very clear, one finds that dealing with unpacking, passing, receiving
-and repacking can become tedious and even error-prone, especially in the case
-of sub-states. Removing this boilerplate, or finding a more suitable
-abstraction mechanism would make \CLaSH\ easier to use.
+usually very clear, one finds that distributing and collecting substate can
+become tedious and even error-prone. Removing the required boilerplate for
+distribution and collection, or finding a more suitable abstraction mechanism
+for state would make \CLaSH\ easier to use.
The transformations in normalization phase of the prototype compiler were
developed in an ad-hoc manner, which makes the existence of many desirable
projects / matthijs / master-project / dsd-paper.git / blobdiff