Technology Blogs

We play with technology. Sometimes we discover things we think are worth sharing.

Tag: "arithmetic"

Radix-n Fast Fourier Transforms (Part 3)
VHDL

Radix-n Fast Fourier Transforms (Part 3)

FFTs are generally defined recursively, so how hard can it be to write a recursive VHDL implementation of an FFT that can scale to any number of inputs for any chosen radix?
Radix-n Fast Fourier Transforms (Part 2)
VHDL

Radix-n Fast Fourier Transforms (Part 2)

FFTs are generally defined recursively, so how hard can it be to write a recursive VHDL implementation of an FFT that can scale to any number of inputs for any chosen radix?
Radix-n Fast Fourier Transforms (Part 1)
VHDL

Radix-n Fast Fourier Transforms (Part 1)

FFTs are generally defined recursively, so how hard can it be to write a recursive VHDL implementation of an FFT that can scale to any number of inputs for any chosen radix?
Compiling VHDL For The Missing Fixed And Floating Point Libraries
VHDL

Compiling VHDL For The Missing Fixed And Floating Point Libraries

VHDL-2008 has added types sfixed, ufixed and float for fixed and floating point arithmetic, but you may struggle to use them with older tools. Here's how to fix that.
Adder Trees Pipelined Efficiently by Recursion
VHDL

Adder Trees Pipelined Efficiently by Recursion

Amusing myself with recursive structures in HDL that are entirely synthesisable and optimal in both size and clock speed. This is primarily a hierarchical construction problem made interesting by having to copy with a non-balance tree.