fastest method for DCT implementation on FPGA

Thread starter ghattas.akkad
Start date Mar 21, 2014

Status: Not open for further replies.

Mar 21, 2014

ghattas.akkad

Member level 1

hello i want to implement a 2D DCT on FPGA i have little experience working with complex implementations as such
i did some reasearch and was wondering what is the difference between several implementation methods in speed and efficiency for 2D DCT

does anybody know what's better to use to calculate the cosine values and avoid much floating point operations?

taylor series implementation to calculate the cosine values?
or
CORDIC implementation?

Status: Not open for further replies.

Similar threads

S
PLL implementation through FPGA
- Started by sushl
- Dec 6, 2023
- Replies: 6
PLD, SPLD, GAL, CPLD, FPGA Design
N
usb host controller on fpga
- Started by nawel
- Oct 15, 2023
- Replies: 2
PLD, SPLD, GAL, CPLD, FPGA Design
R
problem of fpga
- Started by rllv24
- Mar 24, 2024
- Replies: 3
PLD, SPLD, GAL, CPLD, FPGA Design
S
Neural network Equalizer on FPGA
- Started by Sarvanisatya00
- Aug 26, 2023
- Replies: 0
PLD, SPLD, GAL, CPLD, FPGA Design
E
DSP slices in FPGA
- Started by engr_joni_ee
- Apr 3, 2024
- Replies: 1
PLD, SPLD, GAL, CPLD, FPGA Design

fastest method for DCT implementation on FPGA

ghattas.akkad

Member level 1

Similar threads

Privacy & Transparency

Privacy & Transparency