History

lavu/tx: implement 32 bit fixed point FFT and MDCT

Required minimal changes to the code so made sense to implement. FFT and MDCT tested, the output of both was properly rounded. Fun fact: the non-power-of-two fixed-point FFT and MDCT are the fastest ever non-power-of-two fixed-point FFT and MDCT written. This can replace the power of two integer MDCTs in aac and ac3 if the MIPS optimizations are ported across. Unfortunately the ac3 encoder uses a 16-bit fixed point forward transform, unlike the encoder which uses a 32bit inverse transform, so some modifications might be required there. The 3-point FFT is somewhat less accurate than it otherwise could be, having minor rounding errors with bigger transforms. However, this could be improved later, and the way its currently written is the way one would write assembly for it. Similar rounding errors can also be found throughout the power of two FFTs as well, though those are more difficult to correct. Despite this, the integer transforms are more than accurate enough.

Lynne committed 6 years ago

Commit e8f054b1 parent e0070598 files · +172 −90Browse files

Showing the changes to doc/APIchanges (1 of 8 files). Show all

Unified · Split

doc/APIchanges+3−0
@@ -15,6 +15,9 @@ libavutil: 2017-10-21 · 14 unmodified lines
15 15
16API changes, most recent first:16API changes, most recent first:
17 17
182020-02-13 - xxxxxxxxxx - lavu 56.41.100 - tx.h
19 Add AV_TX_INT32_FFT and AV_TX_INT32_MDCT
20
182020-02-12 - xxxxxxxxxx - lavu 56.40.100 - log.h212020-02-12 - xxxxxxxxxx - lavu 56.40.100 - log.h
19 Add av_log_once().22 Add av_log_once().
20 23

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t