From 937c5bec53506bc65db08132643444fbd97f726d Mon Sep 17 00:00:00 2001 From: github-actions Date: Wed, 15 Mar 2023 12:02:55 +0000 Subject: [PATCH] Update main documentation --- main/footer.js | 4 +-- main/group__MatrixMult.html | 3 +- main/group__RealFFT.html | 72 ++++++++++++++++++------------------- version.js | 2 +- 4 files changed, 41 insertions(+), 40 deletions(-) diff --git a/main/footer.js b/main/footer.js index a6387bad..b1dea902 100644 --- a/main/footer.js +++ b/main/footer.js @@ -1,7 +1,7 @@ function writeHeader() { - document.write('Version 1.14.5-dev5'); + document.write('Version 1.14.5-dev6'); }; function writeFooter() { - document.write('Generated on Wed Mar 15 2023 11:37:46 for CMSIS-DSP 1.14.5-dev5+ga5048f6. Copyright © 2022-2023 Arm Limited (or its affiliates). All rights reserved.'); + document.write('Generated on Wed Mar 15 2023 12:02:28 for CMSIS-DSP 1.14.5-dev6+ge13bd5a. Copyright © 2022-2023 Arm Limited (or its affiliates). All rights reserved.'); }; diff --git a/main/group__MatrixMult.html b/main/group__MatrixMult.html index 925bb82d..6015a3a7 100644 --- a/main/group__MatrixMult.html +++ b/main/group__MatrixMult.html @@ -518,7 +518,8 @@ This function is a faster implementation of arm_mat_mult_q31 for MVE but it is r
Scaling and Overflow Behavior
The function is implemented using an internal 64-bit accumulator. The inputs to the multiplications are in 1.15 format and multiplications yield a 2.30 result. The 2.30 intermediate results are accumulated in a 64-bit accumulator in 34.30 format. This approach provides 33 guard bits and there is no risk of overflow. The 34.30 result is then truncated to 34.15 format by discarding the low 15 bits and then saturated to 1.15 format.
-
Refer to arm_mat_mult_fast_q15() for a faster but less precise version of this function.
+
Refer to arm_mat_mult_fast_q15() for a faster but less precise version of this function.
+
pState
pState will contain the transpose of pSrcB
diff --git a/main/group__RealFFT.html b/main/group__RealFFT.html index c8a63663..6c26348d 100644 --- a/main/group__RealFFT.html +++ b/main/group__RealFFT.html @@ -795,46 +795,46 @@ Real Inverse Fast Fourier Transform RFFT Size Input Format Output Format Number of bits to upscale -32 1.15 5.11 5 +32 1.15 6.10 5 -64 1.15 6.10 6 +64 1.15 7.9 6 -128 1.15 7.9 7 +128 1.15 8.8 7 -256 1.15 8.8 8 +256 1.15 9.7 8 -512 1.15 9.7 9 +512 1.15 10.6 9 -1024 1.15 10.6 10 +1024 1.15 11.5 10 -2048 1.15 11.5 11 +2048 1.15 12.4 11 -4096 1.15 12.4 12 +4096 1.15 13.3 12 -8192 1.15 13.3 13 +8192 1.15 14.2 13
Input and Output formats for RIFFT Q15
- + - + - + - + - + - + - + - + - +
RIFFT Size Input Format Output Format Number of bits to upscale
32 1.15 5.11 0
32 1.15 6.10 0
64 1.15 6.10 0
64 1.15 7.9 0
128 1.15 7.9 0
128 1.15 8.8 0
256 1.15 8.8 0
256 1.15 9.7 0
512 1.15 9.7 0
512 1.15 10.6 0
1024 1.15 10.6 0
1024 1.15 11.5 0
2048 1.15 11.5 0
2048 1.15 12.4 0
4096 1.15 12.4 0
4096 1.15 13.3 0
8192 1.15 13.3 0
8192 1.15 14.2 0
If the input buffer is of length N (fftLenReal), the output buffer must have length 2N since it is containing the conjugate part (except for MVE version where N+2 is enough). The input buffer is modified by this function.
For the RIFFT, the source buffer must have length N+2 since the Nyquist frequency value is needed but conjugate part is ignored. It is not using the packing trick of the float version.
@@ -887,46 +887,46 @@ Real Inverse Fast Fourier Transform RFFT Size Input Format Output Format Number of bits to upscale -32 1.31 5.27 5 +32 1.31 6.26 5 -64 1.31 6.26 6 +64 1.31 7.25 6 -128 1.31 7.25 7 +128 1.31 8.24 7 -256 1.31 8.24 8 +256 1.31 9.23 8 -512 1.31 9.23 9 +512 1.31 10.22 9 -1024 1.31 10.22 10 +1024 1.31 11.21 10 -2048 1.31 11.21 11 +2048 1.31 12.20 11 -4096 1.31 12.20 12 +4096 1.31 13.19 12 -8192 1.31 13.19 13 +8192 1.31 14.18 13
Input and Output formats for RIFFT Q31
- + - + - + - + - + - + - + - + - +
RIFFT Size Input Format Output Format Number of bits to upscale
32 1.31 5.27 0
32 1.31 6.26 0
64 1.31 6.26 0
64 1.31 7.25 0
128 1.31 7.25 0
128 1.31 8.24 0
256 1.31 8.24 0
256 1.31 9.23 0
512 1.31 9.23 0
512 1.31 10.22 0
1024 1.31 10.22 0
1024 1.31 11.21 0
2048 1.31 11.21 0
2048 1.31 12.20 0
4096 1.31 12.20 0
4096 1.31 13.19 0
8192 1.31 13.19 0
8192 1.31 14.18 0
If the input buffer is of length N (fftLenReal), the output buffer must have length 2N since it is containing the conjugate part (except for MVE version where N+2 is enough). The input buffer is modified by this function.
For the RIFFT, the source buffer must have length N+2 since the Nyquist frequency value is needed but conjugate part is ignored. It is not using the packing trick of the float version.
diff --git a/version.js b/version.js index 023e0878..0545e4b9 100644 --- a/version.js +++ b/version.js @@ -1,6 +1,6 @@ //--- list of versions --- const versions = { - "main": "1.14.5-dev5", + "main": "1.14.5-dev6", "latest": "1.14.4", "v1.14.3": "1.14.3", "v1.14.2": "1.14.2",