Root mean square (RMS)

void riscv_rms_f32(const float32_t *pSrc, uint32_t blockSize, float32_t *pResult)
void riscv_rms_q15(const q15_t *pSrc, uint32_t blockSize, q15_t *pResult)
void riscv_rms_q31(const q31_t *pSrc, uint32_t blockSize, q31_t *pResult)
group RMS

Calculates the Root Mean Square of the elements in the input vector. The underlying algorithm is used:

There are separate functions for floating point, Q31, and Q15 data types.

Functions

void riscv_rms_f32(const float32_t *pSrc, uint32_t blockSize, float32_t *pResult)

Root Mean Square of the elements of a floating-point vector.

Return

none

Parameters
  • [in] pSrc: points to the input vector

  • [in] blockSize: number of samples in input vector

  • [out] pResult: root mean square value returned here

void riscv_rms_q15(const q15_t *pSrc, uint32_t blockSize, q15_t *pResult)

Root Mean Square of the elements of a Q15 vector.

Return

none

Scaling and Overflow Behavior

The function is implemented using a 64-bit internal accumulator. The input is represented in 1.15 format. Intermediate multiplication yields a 2.30 format, and this result is added without saturation to a 64-bit accumulator in 34.30 format. With 33 guard bits in the accumulator, there is no risk of overflow, and the full precision of the intermediate multiplication is preserved. Finally, the 34.30 result is truncated to 34.15 format by discarding the lower 15 bits, and then saturated to yield a result in 1.15 format.

Parameters
  • [in] pSrc: points to the input vector

  • [in] blockSize: number of samples in input vector

  • [out] pResult: root mean square value returned here

void riscv_rms_q31(const q31_t *pSrc, uint32_t blockSize, q31_t *pResult)

Root Mean Square of the elements of a Q31 vector.

Return

none

Scaling and Overflow Behavior

The function is implemented using an internal 64-bit accumulator. The input is represented in 1.31 format, and intermediate multiplication yields a 2.62 format. The accumulator maintains full precision of the intermediate multiplication results, but provides only a single guard bit. There is no saturation on intermediate additions. If the accumulator overflows, it wraps around and distorts the result. In order to avoid overflows completely, the input signal must be scaled down by log2(blockSize) bits, as a total of blockSize additions are performed internally. Finally, the 2.62 accumulator is right shifted by 31 bits to yield a 1.31 format value.

Parameters
  • [in] pSrc: points to the input vector

  • [in] blockSize: number of samples in input vector

  • [out] pResult: root mean square value returned here