Sky Blue Trades | Haskell FFT 10: Building a package
So far in this series, we’ve been looking at code piecemeal, writing little test modules to explore the algorithms we’ve been developing. Before we start trying to optimise this code, it makes sense to put it into a Cabal package with a more organised module structure, to provide a sensible API and to make a few other small changes. From now on, the code we’re going to be talking about will be the
accelerate-fft
Rank-polymorphic discrete Fourier transform (DFT), computed with a fast Fourier transform (FFT) algorithm using the Accelerate library. Note that optimised implementations are available via foreign libraries (enabled by default). Refer to the main Accelerate package for more information: http://hackage.haskell.org/package/accelerate [Skip to Readme]
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
arb-fft
How to apply data parallelim on haskell Fast Fourier Transformation?
pure-fft
